./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:10:57,445 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:10:57,446 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:10:57,516 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:10:57,517 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:10:57,519 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:10:57,521 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:10:57,523 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:10:57,525 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:10:57,529 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:10:57,530 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:10:57,532 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:10:57,532 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:10:57,534 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:10:57,536 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:10:57,537 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:10:57,538 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:10:57,538 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:10:57,539 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:10:57,559 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:10:57,560 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:10:57,562 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:10:57,563 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:10:57,563 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:10:57,566 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:10:57,567 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:10:57,567 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:10:57,568 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:10:57,569 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:10:57,570 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:10:57,570 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:10:57,571 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:10:57,573 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:10:57,573 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:10:57,579 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:10:57,579 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:10:57,580 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:10:57,580 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:10:57,580 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:10:57,581 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:10:57,582 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:10:57,582 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:10:57,622 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:10:57,622 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:10:57,623 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:10:57,623 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:10:57,624 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:10:57,624 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:10:57,625 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:10:57,625 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:10:57,625 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:10:57,625 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:10:57,626 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:10:57,626 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:10:57,637 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:10:57,637 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:10:57,638 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:10:57,638 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:10:57,638 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:10:57,638 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:10:57,638 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:10:57,638 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:10:57,639 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:10:57,639 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:10:57,639 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:10:57,639 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:10:57,639 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:10:57,640 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:10:57,640 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:10:57,640 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:10:57,640 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:10:57,641 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:10:57,641 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:10:57,641 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:10:57,642 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:10:57,642 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:10:57,642 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:10:57,642 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:10:57,642 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:10:57,642 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cfad0b2f92a7cfe2a62ca103d0ef6e2a604561400f9f39e859a6074e6dd658e5
[2023-10-25 15:10:58,032 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:10:58,059 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:10:58,061 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:10:58,062 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:10:58,062 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:10:58,063 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2023-10-25 15:10:59,786 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:11:00,229 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:11:00,229 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-tid.i
[2023-10-25 15:11:00,262 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/80199eded/287baa066e5c4cfeb3ebd4a8154417ca/FLAGfb0624e1f
[2023-10-25 15:11:00,288 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/80199eded/287baa066e5c4cfeb3ebd4a8154417ca
[2023-10-25 15:11:00,292 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:11:00,293 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:11:00,295 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:11:00,296 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:11:00,298 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:11:00,298 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:11:00" (1/1) ...
[2023-10-25 15:11:00,305 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da98a18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:00, skipping insertion in model container
[2023-10-25 15:11:00,305 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:11:00" (1/1) ...
[2023-10-25 15:11:00,317 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:11:00,389 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:11:00,646 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:11:00,961 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:11:00,984 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:11:01,008 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:11:01,062 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:11:01,141 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:11:01,145 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01 WrapperNode
[2023-10-25 15:11:01,146 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:11:01,147 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:11:01,147 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:11:01,147 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:11:01,158 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,217 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,250 INFO  L138                Inliner]: procedures = 264, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 74
[2023-10-25 15:11:01,254 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:11:01,255 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:11:01,255 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:11:01,255 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:11:01,265 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,266 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,274 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,278 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,284 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,292 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,301 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,308 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,314 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:11:01,319 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:11:01,319 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:11:01,319 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:11:01,321 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (1/1) ...
[2023-10-25 15:11:01,332 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:11:01,360 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:01,381 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:11:01,407 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 15:11:01,427 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 15:11:01,428 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:11:01,428 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:11:01,429 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:11:01,430 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 15:11:01,430 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-10-25 15:11:01,430 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:11:01,431 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:11:01,431 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:11:01,431 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:11:01,432 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:11:01,635 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:11:01,637 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:11:02,024 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:11:02,030 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:11:02,045 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:11:02,047 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:11:02 BoogieIcfgContainer
[2023-10-25 15:11:02,048 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:11:02,050 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:11:02,050 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:11:02,052 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:11:02,052 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:11:00" (1/3) ...
[2023-10-25 15:11:02,053 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3948ab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:11:02, skipping insertion in model container
[2023-10-25 15:11:02,053 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:11:01" (2/3) ...
[2023-10-25 15:11:02,054 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3948ab32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:11:02, skipping insertion in model container
[2023-10-25 15:11:02,054 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:11:02" (3/3) ...
[2023-10-25 15:11:02,055 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i
[2023-10-25 15:11:02,067 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:11:02,088 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:11:02,089 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2023-10-25 15:11:02,089 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:11:02,187 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-10-25 15:11:02,265 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-10-25 15:11:02,387 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-10-25 15:11:02,387 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:11:02,391 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2023-10-25 15:11:02,405 INFO  L82        GeneralOperation]: Start removeDead. Operand has 100 places, 101 transitions, 210 flow
[2023-10-25 15:11:02,411 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 100 places, 101 transitions, 210 flow
[2023-10-25 15:11:02,415 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:11:02,439 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 101 transitions, 210 flow
[2023-10-25 15:11:02,460 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 101 transitions, 210 flow
[2023-10-25 15:11:02,461 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 100 places, 101 transitions, 210 flow
[2023-10-25 15:11:02,509 INFO  L130       PetriNetUnfolder]: 6/142 cut-off events.
[2023-10-25 15:11:02,510 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:11:02,510 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 148 conditions, 142 events. 6/142 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 64. Up to 4 conditions per place. 
[2023-10-25 15:11:02,512 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1410
[2023-10-25 15:11:05,346 INFO  L134        LiptonReduction]: Checked pairs total: 5574
[2023-10-25 15:11:05,349 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-10-25 15:11:05,371 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:11:05,379 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d9b9ea9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:11:05,380 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-10-25 15:11:05,388 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-10-25 15:11:05,401 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:11:05,402 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:05,403 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:05,403 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:05,407 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:05,408 INFO  L85        PathProgramCache]: Analyzing trace with hash -1050340217, now seen corresponding path program 1 times
[2023-10-25 15:11:05,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:05,415 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671376014]
[2023-10-25 15:11:05,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:05,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:05,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:06,415 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:06,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:06,416 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671376014]
[2023-10-25 15:11:06,416 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671376014] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:06,417 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:06,417 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:06,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457395271]
[2023-10-25 15:11:06,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:06,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:06,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:06,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:06,474 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:06,756 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 68 out of 176
[2023-10-25 15:11:06,760 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 84 flow. Second operand  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:06,760 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:06,761 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 176
[2023-10-25 15:11:06,761 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:07,011 INFO  L130       PetriNetUnfolder]: 135/363 cut-off events.
[2023-10-25 15:11:07,012 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:11:07,014 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 691 conditions, 363 events. 135/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1596 event pairs, 91 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 632. Up to 281 conditions per place. 
[2023-10-25 15:11:07,017 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 37 selfloop transitions, 21 changer transitions 0/65 dead transitions.
[2023-10-25 15:11:07,017 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 65 transitions, 254 flow
[2023-10-25 15:11:07,018 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:07,020 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:07,045 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions.
[2023-10-25 15:11:07,049 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4431818181818182
[2023-10-25 15:11:07,049 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 468 transitions.
[2023-10-25 15:11:07,050 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 468 transitions.
[2023-10-25 15:11:07,052 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:07,054 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 468 transitions.
[2023-10-25 15:11:07,067 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 78.0) internal successors, (468), 6 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,074 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,075 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,076 INFO  L175             Difference]: Start difference. First operand has 40 places, 38 transitions, 84 flow. Second operand 6 states and 468 transitions.
[2023-10-25 15:11:07,077 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 65 transitions, 254 flow
[2023-10-25 15:11:07,096 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 65 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:07,098 INFO  L231             Difference]: Finished difference. Result has 48 places, 57 transitions, 206 flow
[2023-10-25 15:11:07,099 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=206, PETRI_PLACES=48, PETRI_TRANSITIONS=57}
[2023-10-25 15:11:07,102 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places.
[2023-10-25 15:11:07,102 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 206 flow
[2023-10-25 15:11:07,103 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 69.16666666666667) internal successors, (415), 6 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,103 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:07,103 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:07,103 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:11:07,104 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:07,104 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:07,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 647833824, now seen corresponding path program 1 times
[2023-10-25 15:11:07,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:07,105 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975462263]
[2023-10-25 15:11:07,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:07,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:07,129 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:07,209 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:07,209 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:07,210 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975462263]
[2023-10-25 15:11:07,210 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975462263] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:07,211 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:07,211 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:11:07,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735964489]
[2023-10-25 15:11:07,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:07,215 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:11:07,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:07,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:11:07,216 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:11:07,317 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 176
[2023-10-25 15:11:07,318 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 206 flow. Second operand  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,318 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:07,319 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 176
[2023-10-25 15:11:07,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:07,448 INFO  L130       PetriNetUnfolder]: 55/234 cut-off events.
[2023-10-25 15:11:07,448 INFO  L131       PetriNetUnfolder]: For 28/36 co-relation queries the response was YES.
[2023-10-25 15:11:07,452 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 489 conditions, 234 events. 55/234 cut-off events. For 28/36 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 984 event pairs, 3 based on Foata normal form. 2/210 useless extension candidates. Maximal degree in co-relation 421. Up to 79 conditions per place. 
[2023-10-25 15:11:07,453 INFO  L137   encePairwiseOnDemand]: 172/176 looper letters, 25 selfloop transitions, 2 changer transitions 2/66 dead transitions.
[2023-10-25 15:11:07,453 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 290 flow
[2023-10-25 15:11:07,453 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:11:07,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:11:07,455 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 385 transitions.
[2023-10-25 15:11:07,455 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.546875
[2023-10-25 15:11:07,455 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 385 transitions.
[2023-10-25 15:11:07,455 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 385 transitions.
[2023-10-25 15:11:07,456 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:07,456 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 385 transitions.
[2023-10-25 15:11:07,457 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,459 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,460 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,460 INFO  L175             Difference]: Start difference. First operand has 48 places, 57 transitions, 206 flow. Second operand 4 states and 385 transitions.
[2023-10-25 15:11:07,460 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 290 flow
[2023-10-25 15:11:07,465 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 66 transitions, 290 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:07,467 INFO  L231             Difference]: Finished difference. Result has 53 places, 57 transitions, 216 flow
[2023-10-25 15:11:07,467 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=53, PETRI_TRANSITIONS=57}
[2023-10-25 15:11:07,468 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places.
[2023-10-25 15:11:07,473 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 57 transitions, 216 flow
[2023-10-25 15:11:07,474 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 90.75) internal successors, (363), 4 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:07,474 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:07,474 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:07,474 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:11:07,475 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:07,477 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:07,478 INFO  L85        PathProgramCache]: Analyzing trace with hash -516340613, now seen corresponding path program 1 times
[2023-10-25 15:11:07,478 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:07,478 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439481740]
[2023-10-25 15:11:07,479 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:07,479 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:07,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:07,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:07,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:07,929 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439481740]
[2023-10-25 15:11:07,929 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439481740] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:07,930 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:07,930 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:07,930 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119859594]
[2023-10-25 15:11:07,931 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:07,931 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:07,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:07,932 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:07,932 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:08,153 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 71 out of 176
[2023-10-25 15:11:08,153 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 57 transitions, 216 flow. Second operand  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:08,153 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:08,153 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 176
[2023-10-25 15:11:08,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:08,561 INFO  L130       PetriNetUnfolder]: 193/497 cut-off events.
[2023-10-25 15:11:08,561 INFO  L131       PetriNetUnfolder]: For 111/115 co-relation queries the response was YES.
[2023-10-25 15:11:08,562 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 497 events. 193/497 cut-off events. For 111/115 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2299 event pairs, 39 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 1182. Up to 339 conditions per place. 
[2023-10-25 15:11:08,563 INFO  L137   encePairwiseOnDemand]: 158/176 looper letters, 68 selfloop transitions, 57 changer transitions 5/137 dead transitions.
[2023-10-25 15:11:08,563 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 137 transitions, 714 flow
[2023-10-25 15:11:08,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:08,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:08,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions.
[2023-10-25 15:11:08,566 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5085227272727273
[2023-10-25 15:11:08,567 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 537 transitions.
[2023-10-25 15:11:08,567 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions.
[2023-10-25 15:11:08,567 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:08,567 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions.
[2023-10-25 15:11:08,568 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:08,570 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:08,570 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:08,570 INFO  L175             Difference]: Start difference. First operand has 53 places, 57 transitions, 216 flow. Second operand 6 states and 537 transitions.
[2023-10-25 15:11:08,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 137 transitions, 714 flow
[2023-10-25 15:11:08,575 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 137 transitions, 692 flow, removed 5 selfloop flow, removed 3 redundant places.
[2023-10-25 15:11:08,577 INFO  L231             Difference]: Finished difference. Result has 58 places, 108 transitions, 562 flow
[2023-10-25 15:11:08,578 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=58, PETRI_TRANSITIONS=108}
[2023-10-25 15:11:08,579 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places.
[2023-10-25 15:11:08,579 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 108 transitions, 562 flow
[2023-10-25 15:11:08,579 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:08,579 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:08,579 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:08,580 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:11:08,582 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:08,583 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:08,583 INFO  L85        PathProgramCache]: Analyzing trace with hash 1831922026, now seen corresponding path program 1 times
[2023-10-25 15:11:08,583 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:08,583 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66233047]
[2023-10-25 15:11:08,583 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:08,583 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:08,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:09,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:11:09,080 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:09,080 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66233047]
[2023-10-25 15:11:09,080 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66233047] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:09,080 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:09,081 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:09,081 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154532007]
[2023-10-25 15:11:09,081 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:09,081 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:09,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:09,082 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:09,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:09,332 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 176
[2023-10-25 15:11:09,333 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 108 transitions, 562 flow. Second operand  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:09,333 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:09,333 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 176
[2023-10-25 15:11:09,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:09,534 INFO  L130       PetriNetUnfolder]: 200/560 cut-off events.
[2023-10-25 15:11:09,535 INFO  L131       PetriNetUnfolder]: For 335/347 co-relation queries the response was YES.
[2023-10-25 15:11:09,539 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 560 events. 200/560 cut-off events. For 335/347 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2835 event pairs, 43 based on Foata normal form. 1/539 useless extension candidates. Maximal degree in co-relation 1725. Up to 369 conditions per place. 
[2023-10-25 15:11:09,543 INFO  L137   encePairwiseOnDemand]: 165/176 looper letters, 87 selfloop transitions, 29 changer transitions 0/142 dead transitions.
[2023-10-25 15:11:09,557 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 142 transitions, 968 flow
[2023-10-25 15:11:09,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:09,558 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:09,559 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions.
[2023-10-25 15:11:09,559 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4630681818181818
[2023-10-25 15:11:09,559 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 489 transitions.
[2023-10-25 15:11:09,559 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 489 transitions.
[2023-10-25 15:11:09,560 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:09,561 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 489 transitions.
[2023-10-25 15:11:09,562 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 81.5) internal successors, (489), 6 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:09,564 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:09,564 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 176.0) internal successors, (1232), 7 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:09,564 INFO  L175             Difference]: Start difference. First operand has 58 places, 108 transitions, 562 flow. Second operand 6 states and 489 transitions.
[2023-10-25 15:11:09,564 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 142 transitions, 968 flow
[2023-10-25 15:11:09,570 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 142 transitions, 932 flow, removed 18 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:09,572 INFO  L231             Difference]: Finished difference. Result has 67 places, 132 transitions, 808 flow
[2023-10-25 15:11:09,573 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=808, PETRI_PLACES=67, PETRI_TRANSITIONS=132}
[2023-10-25 15:11:09,574 INFO  L288   CegarLoopForPetriNet]: 40 programPoint places, 27 predicate places.
[2023-10-25 15:11:09,574 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 132 transitions, 808 flow
[2023-10-25 15:11:09,574 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:09,581 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:09,581 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:11:09,581 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:11:09,581 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2023-10-25 15:11:09,582 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:09,582 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007496268, now seen corresponding path program 1 times
[2023-10-25 15:11:09,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:09,582 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176913748]
[2023-10-25 15:11:09,582 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:09,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:09,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:11:09,624 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:11:09,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:11:09,691 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:11:09,694 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:11:09,695 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-10-25 15:11:09,697 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-10-25 15:11:09,713 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-10-25 15:11:09,713 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-10-25 15:11:09,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-10-25 15:11:09,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-10-25 15:11:09,714 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-10-25 15:11:09,714 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:11:09,715 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-25 15:11:09,718 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:11:09,718 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:11:09,745 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-10-25 15:11:09,764 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-10-25 15:11:09,818 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-10-25 15:11:09,818 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:11:09,819 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2023-10-25 15:11:09,819 INFO  L82        GeneralOperation]: Start removeDead. Operand has 118 places, 118 transitions, 254 flow
[2023-10-25 15:11:09,820 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 118 places, 118 transitions, 254 flow
[2023-10-25 15:11:09,820 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:11:09,820 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 118 transitions, 254 flow
[2023-10-25 15:11:09,821 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 118 transitions, 254 flow
[2023-10-25 15:11:09,821 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 118 places, 118 transitions, 254 flow
[2023-10-25 15:11:09,862 INFO  L130       PetriNetUnfolder]: 11/257 cut-off events.
[2023-10-25 15:11:09,863 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-10-25 15:11:09,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 271 conditions, 257 events. 11/257 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 476 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 144. Up to 8 conditions per place. 
[2023-10-25 15:11:09,865 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4200
[2023-10-25 15:11:11,957 INFO  L134        LiptonReduction]: Checked pairs total: 17458
[2023-10-25 15:11:11,957 INFO  L136        LiptonReduction]: Total number of compositions: 74
[2023-10-25 15:11:11,958 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:11:11,959 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d9b9ea9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:11:11,959 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-10-25 15:11:11,961 INFO  L130       PetriNetUnfolder]: 0/13 cut-off events.
[2023-10-25 15:11:11,961 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:11:11,961 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:11,961 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:11,961 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:11,963 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:11,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 1843145426, now seen corresponding path program 1 times
[2023-10-25 15:11:11,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:11,963 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342453960]
[2023-10-25 15:11:11,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:11,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:11,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:12,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:12,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:12,196 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342453960]
[2023-10-25 15:11:12,196 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342453960] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:12,196 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:12,196 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:12,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296894997]
[2023-10-25 15:11:12,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:12,198 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:12,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:12,199 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:12,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:12,382 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 192
[2023-10-25 15:11:12,383 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:12,383 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:12,383 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 192
[2023-10-25 15:11:12,383 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:13,245 INFO  L130       PetriNetUnfolder]: 2299/4146 cut-off events.
[2023-10-25 15:11:13,250 INFO  L131       PetriNetUnfolder]: For 58/58 co-relation queries the response was YES.
[2023-10-25 15:11:13,260 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8058 conditions, 4146 events. 2299/4146 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23085 event pairs, 1715 based on Foata normal form. 0/3930 useless extension candidates. Maximal degree in co-relation 1116. Up to 3508 conditions per place. 
[2023-10-25 15:11:13,289 INFO  L137   encePairwiseOnDemand]: 178/192 looper letters, 58 selfloop transitions, 37 changer transitions 0/106 dead transitions.
[2023-10-25 15:11:13,289 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 106 transitions, 420 flow
[2023-10-25 15:11:13,290 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:13,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:13,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 570 transitions.
[2023-10-25 15:11:13,291 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4947916666666667
[2023-10-25 15:11:13,291 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 570 transitions.
[2023-10-25 15:11:13,291 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 570 transitions.
[2023-10-25 15:11:13,292 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:13,292 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 570 transitions.
[2023-10-25 15:11:13,293 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 95.0) internal successors, (570), 6 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,295 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,301 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,301 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 570 transitions.
[2023-10-25 15:11:13,301 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 106 transitions, 420 flow
[2023-10-25 15:11:13,303 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 106 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:13,305 INFO  L231             Difference]: Finished difference. Result has 66 places, 90 transitions, 338 flow
[2023-10-25 15:11:13,305 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=338, PETRI_PLACES=66, PETRI_TRANSITIONS=90}
[2023-10-25 15:11:13,308 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 9 predicate places.
[2023-10-25 15:11:13,308 INFO  L495      AbstractCegarLoop]: Abstraction has has 66 places, 90 transitions, 338 flow
[2023-10-25 15:11:13,308 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,308 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:13,308 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:13,308 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:11:13,309 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:13,309 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:13,324 INFO  L85        PathProgramCache]: Analyzing trace with hash 37653776, now seen corresponding path program 1 times
[2023-10-25 15:11:13,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:13,324 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606338459]
[2023-10-25 15:11:13,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:13,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:13,332 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:13,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:13,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:13,388 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606338459]
[2023-10-25 15:11:13,391 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606338459] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:13,391 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:13,391 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:11:13,391 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764551127]
[2023-10-25 15:11:13,391 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:13,392 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-10-25 15:11:13,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:13,392 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-10-25 15:11:13,392 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-10-25 15:11:13,478 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2023-10-25 15:11:13,479 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 90 transitions, 338 flow. Second operand  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,479 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:13,479 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2023-10-25 15:11:13,479 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:13,852 INFO  L130       PetriNetUnfolder]: 831/2045 cut-off events.
[2023-10-25 15:11:13,852 INFO  L131       PetriNetUnfolder]: For 351/391 co-relation queries the response was YES.
[2023-10-25 15:11:13,856 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 2045 events. 831/2045 cut-off events. For 351/391 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 13313 event pairs, 354 based on Foata normal form. 1/1904 useless extension candidates. Maximal degree in co-relation 2180. Up to 890 conditions per place. 
[2023-10-25 15:11:13,891 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 31 selfloop transitions, 2 changer transitions 2/100 dead transitions.
[2023-10-25 15:11:13,891 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 436 flow
[2023-10-25 15:11:13,891 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:11:13,891 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:11:13,892 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions.
[2023-10-25 15:11:13,893 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.58203125
[2023-10-25 15:11:13,893 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 447 transitions.
[2023-10-25 15:11:13,893 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions.
[2023-10-25 15:11:13,893 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:13,893 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions.
[2023-10-25 15:11:13,895 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,896 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,896 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,896 INFO  L175             Difference]: Start difference. First operand has 66 places, 90 transitions, 338 flow. Second operand 4 states and 447 transitions.
[2023-10-25 15:11:13,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 436 flow
[2023-10-25 15:11:13,899 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 436 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:13,901 INFO  L231             Difference]: Finished difference. Result has 71 places, 91 transitions, 352 flow
[2023-10-25 15:11:13,902 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=352, PETRI_PLACES=71, PETRI_TRANSITIONS=91}
[2023-10-25 15:11:13,904 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 14 predicate places.
[2023-10-25 15:11:13,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 91 transitions, 352 flow
[2023-10-25 15:11:13,905 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:13,905 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:13,905 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:13,905 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:11:13,906 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:13,907 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:13,907 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297270937, now seen corresponding path program 1 times
[2023-10-25 15:11:13,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:13,909 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569522782]
[2023-10-25 15:11:13,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:13,912 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:13,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:14,266 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:14,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:14,266 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569522782]
[2023-10-25 15:11:14,266 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569522782] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:14,267 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:14,267 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:14,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767456912]
[2023-10-25 15:11:14,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:14,267 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:14,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:14,268 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:14,268 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:14,440 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 82 out of 192
[2023-10-25 15:11:14,441 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 91 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:14,441 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:14,441 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 192
[2023-10-25 15:11:14,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:15,793 INFO  L130       PetriNetUnfolder]: 3649/6392 cut-off events.
[2023-10-25 15:11:15,794 INFO  L131       PetriNetUnfolder]: For 1465/1507 co-relation queries the response was YES.
[2023-10-25 15:11:15,800 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16449 conditions, 6392 events. 3649/6392 cut-off events. For 1465/1507 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 38348 event pairs, 1337 based on Foata normal form. 0/6111 useless extension candidates. Maximal degree in co-relation 16362. Up to 4916 conditions per place. 
[2023-10-25 15:11:15,845 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 131 selfloop transitions, 89 changer transitions 0/231 dead transitions.
[2023-10-25 15:11:15,845 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 231 transitions, 1222 flow
[2023-10-25 15:11:15,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:15,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:15,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions.
[2023-10-25 15:11:15,857 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5833333333333334
[2023-10-25 15:11:15,857 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 672 transitions.
[2023-10-25 15:11:15,857 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 672 transitions.
[2023-10-25 15:11:15,857 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:15,857 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 672 transitions.
[2023-10-25 15:11:15,859 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.0) internal successors, (672), 6 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:15,860 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:15,860 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:15,861 INFO  L175             Difference]: Start difference. First operand has 71 places, 91 transitions, 352 flow. Second operand 6 states and 672 transitions.
[2023-10-25 15:11:15,861 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 231 transitions, 1222 flow
[2023-10-25 15:11:15,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 231 transitions, 1206 flow, removed 5 selfloop flow, removed 2 redundant places.
[2023-10-25 15:11:15,888 INFO  L231             Difference]: Finished difference. Result has 77 places, 175 transitions, 910 flow
[2023-10-25 15:11:15,888 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=77, PETRI_TRANSITIONS=175}
[2023-10-25 15:11:15,889 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2023-10-25 15:11:15,890 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 175 transitions, 910 flow
[2023-10-25 15:11:15,890 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:15,890 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:15,890 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:15,890 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:11:15,891 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:15,891 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:15,891 INFO  L85        PathProgramCache]: Analyzing trace with hash 490022662, now seen corresponding path program 1 times
[2023-10-25 15:11:15,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:15,891 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945483767]
[2023-10-25 15:11:15,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:15,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:15,916 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:16,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:11:16,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:16,198 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945483767]
[2023-10-25 15:11:16,198 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945483767] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:11:16,198 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:11:16,199 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:11:16,199 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004478707]
[2023-10-25 15:11:16,199 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:11:16,200 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:11:16,200 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:16,200 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:11:16,200 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:11:16,447 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 192
[2023-10-25 15:11:16,448 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 175 transitions, 910 flow. Second operand  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:16,448 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:16,448 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 192
[2023-10-25 15:11:16,448 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:18,051 INFO  L130       PetriNetUnfolder]: 4197/7805 cut-off events.
[2023-10-25 15:11:18,052 INFO  L131       PetriNetUnfolder]: For 6317/6605 co-relation queries the response was YES.
[2023-10-25 15:11:18,081 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25509 conditions, 7805 events. 4197/7805 cut-off events. For 6317/6605 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 51218 event pairs, 1254 based on Foata normal form. 11/7497 useless extension candidates. Maximal degree in co-relation 20095. Up to 5830 conditions per place. 
[2023-10-25 15:11:18,128 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 160 selfloop transitions, 69 changer transitions 0/258 dead transitions.
[2023-10-25 15:11:18,131 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 258 transitions, 1801 flow
[2023-10-25 15:11:18,131 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:11:18,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:11:18,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions.
[2023-10-25 15:11:18,154 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5243055555555556
[2023-10-25 15:11:18,154 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 604 transitions.
[2023-10-25 15:11:18,154 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions.
[2023-10-25 15:11:18,155 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:18,155 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions.
[2023-10-25 15:11:18,158 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:18,160 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:18,174 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:18,174 INFO  L175             Difference]: Start difference. First operand has 77 places, 175 transitions, 910 flow. Second operand 6 states and 604 transitions.
[2023-10-25 15:11:18,174 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 258 transitions, 1801 flow
[2023-10-25 15:11:18,258 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 258 transitions, 1701 flow, removed 50 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:18,262 INFO  L231             Difference]: Finished difference. Result has 87 places, 235 transitions, 1526 flow
[2023-10-25 15:11:18,262 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=87, PETRI_TRANSITIONS=235}
[2023-10-25 15:11:18,263 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 30 predicate places.
[2023-10-25 15:11:18,263 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 235 transitions, 1526 flow
[2023-10-25 15:11:18,264 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.83333333333333) internal successors, (515), 6 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:18,264 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:18,265 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:18,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:11:18,275 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:18,276 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:18,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -1420041874, now seen corresponding path program 1 times
[2023-10-25 15:11:18,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:18,276 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036355671]
[2023-10-25 15:11:18,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:18,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:18,300 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:18,832 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:18,832 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:18,833 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036355671]
[2023-10-25 15:11:18,833 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036355671] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:11:18,833 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451458294]
[2023-10-25 15:11:18,833 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:18,833 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:18,833 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:18,841 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:11:18,900 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 15:11:19,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:19,050 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-25 15:11:19,056 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:11:19,115 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:11:19,177 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:11:19,177 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:11:19,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:11:19,245 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:11:19,286 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:19,287 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:11:19,337 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:19,338 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:11:19,426 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:11:19,434 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:19,442 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:11:19,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:19,643 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [451458294] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:11:19,643 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:11:19,643 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-10-25 15:11:19,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17407369]
[2023-10-25 15:11:19,645 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:11:19,645 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-10-25 15:11:19,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:19,646 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-10-25 15:11:19,646 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2023-10-25 15:11:20,418 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-25 15:11:20,419 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 235 transitions, 1526 flow. Second operand  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:20,419 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:20,419 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-25 15:11:20,419 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:22,689 INFO  L130       PetriNetUnfolder]: 4656/8478 cut-off events.
[2023-10-25 15:11:22,689 INFO  L131       PetriNetUnfolder]: For 12874/13089 co-relation queries the response was YES.
[2023-10-25 15:11:22,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32369 conditions, 8478 events. 4656/8478 cut-off events. For 12874/13089 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 54154 event pairs, 1418 based on Foata normal form. 0/8147 useless extension candidates. Maximal degree in co-relation 22476. Up to 6478 conditions per place. 
[2023-10-25 15:11:22,811 INFO  L137   encePairwiseOnDemand]: 172/192 looper letters, 329 selfloop transitions, 74 changer transitions 0/415 dead transitions.
[2023-10-25 15:11:22,818 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 415 transitions, 3510 flow
[2023-10-25 15:11:22,818 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2023-10-25 15:11:22,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2023-10-25 15:11:22,821 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions.
[2023-10-25 15:11:22,821 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.45928030303030304
[2023-10-25 15:11:22,822 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 970 transitions.
[2023-10-25 15:11:22,822 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions.
[2023-10-25 15:11:22,822 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:22,822 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions.
[2023-10-25 15:11:22,824 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:22,827 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:22,829 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:22,830 INFO  L175             Difference]: Start difference. First operand has 87 places, 235 transitions, 1526 flow. Second operand 11 states and 970 transitions.
[2023-10-25 15:11:22,830 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 415 transitions, 3510 flow
[2023-10-25 15:11:22,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 415 transitions, 3274 flow, removed 118 selfloop flow, removed 0 redundant places.
[2023-10-25 15:11:22,980 INFO  L231             Difference]: Finished difference. Result has 104 places, 271 transitions, 1985 flow
[2023-10-25 15:11:22,980 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1408, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1985, PETRI_PLACES=104, PETRI_TRANSITIONS=271}
[2023-10-25 15:11:22,981 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 47 predicate places.
[2023-10-25 15:11:22,981 INFO  L495      AbstractCegarLoop]: Abstraction has has 104 places, 271 transitions, 1985 flow
[2023-10-25 15:11:22,982 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.66666666666667) internal successors, (920), 12 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:22,982 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:22,982 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:23,004 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-25 15:11:23,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2023-10-25 15:11:23,186 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:23,187 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:23,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 668269293, now seen corresponding path program 1 times
[2023-10-25 15:11:23,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:23,187 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526373116]
[2023-10-25 15:11:23,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:23,188 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:23,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:23,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:23,666 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:23,666 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526373116]
[2023-10-25 15:11:23,666 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526373116] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:11:23,666 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826417363]
[2023-10-25 15:11:23,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:23,667 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:23,667 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:23,678 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:11:23,726 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 15:11:23,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:23,830 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-25 15:11:23,833 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:11:23,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:11:23,855 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:11:23,855 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:11:23,887 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2023-10-25 15:11:23,908 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2023-10-25 15:11:23,935 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:23,935 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2023-10-25 15:11:23,962 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:23,963 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2023-10-25 15:11:24,000 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2023-10-25 15:11:24,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:24,007 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:11:24,050 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2023-10-25 15:11:24,091 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4))))))) is different from false
[2023-10-25 15:11:24,124 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)))) (forall ((v_ArrVal_456 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_456 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_456) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-10-25 15:11:24,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 15:11:24,282 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826417363] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:11:24,282 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:11:24,282 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13
[2023-10-25 15:11:24,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179365033]
[2023-10-25 15:11:24,283 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:11:24,283 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2023-10-25 15:11:24,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:24,283 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2023-10-25 15:11:24,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210
[2023-10-25 15:11:24,393 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-10-25 15:11:24,394 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 271 transitions, 1985 flow. Second operand  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:24,394 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:24,394 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-10-25 15:11:24,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:28,931 INFO  L130       PetriNetUnfolder]: 9089/15228 cut-off events.
[2023-10-25 15:11:28,932 INFO  L131       PetriNetUnfolder]: For 26270/26274 co-relation queries the response was YES.
[2023-10-25 15:11:28,987 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61251 conditions, 15228 events. 9089/15228 cut-off events. For 26270/26274 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 98016 event pairs, 1448 based on Foata normal form. 4/13846 useless extension candidates. Maximal degree in co-relation 48685. Up to 7856 conditions per place. 
[2023-10-25 15:11:29,085 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 578 selfloop transitions, 532 changer transitions 9/1123 dead transitions.
[2023-10-25 15:11:29,085 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 1123 transitions, 9568 flow
[2023-10-25 15:11:29,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-10-25 15:11:29,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2023-10-25 15:11:29,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1636 transitions.
[2023-10-25 15:11:29,100 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.44846491228070173
[2023-10-25 15:11:29,101 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 1636 transitions.
[2023-10-25 15:11:29,101 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 1636 transitions.
[2023-10-25 15:11:29,101 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:29,102 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1636 transitions.
[2023-10-25 15:11:29,104 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 86.10526315789474) internal successors, (1636), 19 states have internal predecessors, (1636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:29,108 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:29,109 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 192.0) internal successors, (3840), 20 states have internal predecessors, (3840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:29,117 INFO  L175             Difference]: Start difference. First operand has 104 places, 271 transitions, 1985 flow. Second operand 19 states and 1636 transitions.
[2023-10-25 15:11:29,117 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 1123 transitions, 9568 flow
[2023-10-25 15:11:29,524 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 1123 transitions, 9556 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-10-25 15:11:29,550 INFO  L231             Difference]: Finished difference. Result has 131 places, 771 transitions, 7820 flow
[2023-10-25 15:11:29,551 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1974, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7820, PETRI_PLACES=131, PETRI_TRANSITIONS=771}
[2023-10-25 15:11:29,551 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 74 predicate places.
[2023-10-25 15:11:29,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 771 transitions, 7820 flow
[2023-10-25 15:11:29,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 59.666666666666664) internal successors, (895), 15 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:29,552 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:29,552 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:29,561 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-25 15:11:29,757 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:29,758 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:29,758 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:29,759 INFO  L85        PathProgramCache]: Analyzing trace with hash -220900113, now seen corresponding path program 1 times
[2023-10-25 15:11:29,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:29,759 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305373105]
[2023-10-25 15:11:29,759 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:29,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:29,797 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:30,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:30,239 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:30,239 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305373105]
[2023-10-25 15:11:30,239 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305373105] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:11:30,239 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659897212]
[2023-10-25 15:11:30,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:30,240 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:30,240 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:30,241 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:11:30,301 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 15:11:30,402 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:30,403 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-25 15:11:30,406 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:11:30,408 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:11:30,419 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:11:30,420 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:11:30,457 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:11:30,466 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:11:30,481 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:30,494 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:11:30,509 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:11:30,509 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:11:30,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:11:30,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:30,545 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:11:30,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:30,689 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659897212] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:11:30,689 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:11:30,689 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10
[2023-10-25 15:11:30,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668619612]
[2023-10-25 15:11:30,690 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:11:30,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-10-25 15:11:30,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:30,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-10-25 15:11:30,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2023-10-25 15:11:31,474 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-25 15:11:31,474 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 771 transitions, 7820 flow. Second operand  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:31,474 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:31,475 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-25 15:11:31,475 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:35,011 INFO  L130       PetriNetUnfolder]: 8746/15150 cut-off events.
[2023-10-25 15:11:35,013 INFO  L131       PetriNetUnfolder]: For 62441/63984 co-relation queries the response was YES.
[2023-10-25 15:11:35,095 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88265 conditions, 15150 events. 8746/15150 cut-off events. For 62441/63984 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 104065 event pairs, 626 based on Foata normal form. 179/14802 useless extension candidates. Maximal degree in co-relation 86284. Up to 10299 conditions per place. 
[2023-10-25 15:11:35,194 INFO  L137   encePairwiseOnDemand]: 176/192 looper letters, 839 selfloop transitions, 358 changer transitions 2/1229 dead transitions.
[2023-10-25 15:11:35,194 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 1229 transitions, 15058 flow
[2023-10-25 15:11:35,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-25 15:11:35,195 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-25 15:11:35,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1079 transitions.
[2023-10-25 15:11:35,198 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4683159722222222
[2023-10-25 15:11:35,198 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 1079 transitions.
[2023-10-25 15:11:35,198 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 1079 transitions.
[2023-10-25 15:11:35,199 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:35,199 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1079 transitions.
[2023-10-25 15:11:35,218 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 89.91666666666667) internal successors, (1079), 12 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:35,223 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:35,223 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:35,223 INFO  L175             Difference]: Start difference. First operand has 131 places, 771 transitions, 7820 flow. Second operand 12 states and 1079 transitions.
[2023-10-25 15:11:35,223 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 1229 transitions, 15058 flow
[2023-10-25 15:11:37,026 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 1229 transitions, 14413 flow, removed 318 selfloop flow, removed 4 redundant places.
[2023-10-25 15:11:37,059 INFO  L231             Difference]: Finished difference. Result has 143 places, 1023 transitions, 11838 flow
[2023-10-25 15:11:37,060 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=7529, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=157, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11838, PETRI_PLACES=143, PETRI_TRANSITIONS=1023}
[2023-10-25 15:11:37,061 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 86 predicate places.
[2023-10-25 15:11:37,061 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 1023 transitions, 11838 flow
[2023-10-25 15:11:37,061 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 76.75) internal successors, (921), 12 states have internal predecessors, (921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:37,061 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:37,062 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:37,068 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:11:37,266 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2023-10-25 15:11:37,266 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:37,267 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:37,267 INFO  L85        PathProgramCache]: Analyzing trace with hash -972504981, now seen corresponding path program 2 times
[2023-10-25 15:11:37,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:37,268 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378734666]
[2023-10-25 15:11:37,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:37,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:37,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:37,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:37,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:37,776 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378734666]
[2023-10-25 15:11:37,776 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378734666] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:11:37,776 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034338424]
[2023-10-25 15:11:37,776 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:11:37,777 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:37,777 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:37,790 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:11:37,825 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-25 15:11:37,977 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:11:37,978 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:11:37,979 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-25 15:11:37,982 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:11:37,988 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:11:38,025 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:11:38,026 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:11:38,206 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:11:38,253 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:11:38,331 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:11:38,433 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-25 15:11:38,470 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:11:38,532 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:11:38,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:38,583 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:11:38,746 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:38,746 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034338424] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:11:38,746 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:11:38,746 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 20
[2023-10-25 15:11:38,748 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556770523]
[2023-10-25 15:11:38,748 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:11:38,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2023-10-25 15:11:38,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:38,749 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2023-10-25 15:11:38,750 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462
[2023-10-25 15:11:40,078 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 192
[2023-10-25 15:11:40,079 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 1023 transitions, 11838 flow. Second operand  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:40,079 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:40,079 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 192
[2023-10-25 15:11:40,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:44,828 INFO  L130       PetriNetUnfolder]: 9057/15823 cut-off events.
[2023-10-25 15:11:44,828 INFO  L131       PetriNetUnfolder]: For 80875/82329 co-relation queries the response was YES.
[2023-10-25 15:11:44,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 95075 conditions, 15823 events. 9057/15823 cut-off events. For 80875/82329 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 109257 event pairs, 657 based on Foata normal form. 152/15449 useless extension candidates. Maximal degree in co-relation 93109. Up to 11155 conditions per place. 
[2023-10-25 15:11:45,048 INFO  L137   encePairwiseOnDemand]: 171/192 looper letters, 1149 selfloop transitions, 376 changer transitions 16/1571 dead transitions.
[2023-10-25 15:11:45,049 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 1571 transitions, 20634 flow
[2023-10-25 15:11:45,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-10-25 15:11:45,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2023-10-25 15:11:45,054 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1834 transitions.
[2023-10-25 15:11:45,055 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4548611111111111
[2023-10-25 15:11:45,055 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1834 transitions.
[2023-10-25 15:11:45,055 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1834 transitions.
[2023-10-25 15:11:45,056 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:45,056 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1834 transitions.
[2023-10-25 15:11:45,060 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 87.33333333333333) internal successors, (1834), 21 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,068 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,074 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:45,074 INFO  L175             Difference]: Start difference. First operand has 143 places, 1023 transitions, 11838 flow. Second operand 21 states and 1834 transitions.
[2023-10-25 15:11:45,074 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 1571 transitions, 20634 flow
[2023-10-25 15:11:46,736 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 1571 transitions, 20199 flow, removed 205 selfloop flow, removed 5 redundant places.
[2023-10-25 15:11:46,757 INFO  L231             Difference]: Finished difference. Result has 166 places, 1174 transitions, 14603 flow
[2023-10-25 15:11:46,758 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=11423, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=225, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=14603, PETRI_PLACES=166, PETRI_TRANSITIONS=1174}
[2023-10-25 15:11:46,759 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 109 predicate places.
[2023-10-25 15:11:46,759 INFO  L495      AbstractCegarLoop]: Abstraction has has 166 places, 1174 transitions, 14603 flow
[2023-10-25 15:11:46,759 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 76.81818181818181) internal successors, (1690), 22 states have internal predecessors, (1690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:46,759 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:46,759 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:46,779 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-25 15:11:46,977 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:46,978 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:46,978 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:46,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049850436, now seen corresponding path program 2 times
[2023-10-25 15:11:46,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:46,979 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568642994]
[2023-10-25 15:11:46,979 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:46,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:47,019 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:47,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:47,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:47,427 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568642994]
[2023-10-25 15:11:47,427 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568642994] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:11:47,427 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675746633]
[2023-10-25 15:11:47,428 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:11:47,428 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:47,428 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:47,429 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:11:47,470 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-10-25 15:11:47,613 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:11:47,614 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:11:47,615 INFO  L263         TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-25 15:11:47,619 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:11:47,632 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:11:47,663 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:11:47,663 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:11:47,849 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:11:47,927 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:11:47,982 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:11:48,029 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:11:48,079 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:11:48,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:48,114 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:11:48,143 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2023-10-25 15:11:48,183 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_784 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_784 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_784) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-25 15:11:48,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:11:48,263 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1675746633] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:11:48,263 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:11:48,263 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 21
[2023-10-25 15:11:48,263 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839391062]
[2023-10-25 15:11:48,263 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:11:48,264 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2023-10-25 15:11:48,264 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:11:48,264 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2023-10-25 15:11:48,264 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=349, Unknown=2, NotChecked=78, Total=506
[2023-10-25 15:11:48,378 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-25 15:11:48,379 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 1174 transitions, 14603 flow. Second operand  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:48,380 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:11:48,380 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-25 15:11:48,380 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:11:55,652 INFO  L130       PetriNetUnfolder]: 11708/19508 cut-off events.
[2023-10-25 15:11:55,653 INFO  L131       PetriNetUnfolder]: For 124723/124729 co-relation queries the response was YES.
[2023-10-25 15:11:55,707 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127668 conditions, 19508 events. 11708/19508 cut-off events. For 124723/124729 co-relation queries the response was YES. Maximal size of possible extension queue 671. Compared 131180 event pairs, 698 based on Foata normal form. 1/18175 useless extension candidates. Maximal degree in co-relation 125380. Up to 13919 conditions per place. 
[2023-10-25 15:11:55,873 INFO  L137   encePairwiseOnDemand]: 167/192 looper letters, 1349 selfloop transitions, 732 changer transitions 2/2087 dead transitions.
[2023-10-25 15:11:55,886 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 2087 transitions, 29755 flow
[2023-10-25 15:11:55,886 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-10-25 15:11:55,886 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2023-10-25 15:11:55,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1530 transitions.
[2023-10-25 15:11:55,889 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34646739130434784
[2023-10-25 15:11:55,889 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1530 transitions.
[2023-10-25 15:11:55,889 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1530 transitions.
[2023-10-25 15:11:55,890 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:11:55,890 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1530 transitions.
[2023-10-25 15:11:55,894 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 66.52173913043478) internal successors, (1530), 23 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:55,898 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:55,914 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:55,914 INFO  L175             Difference]: Start difference. First operand has 166 places, 1174 transitions, 14603 flow. Second operand 23 states and 1530 transitions.
[2023-10-25 15:11:55,914 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 2087 transitions, 29755 flow
[2023-10-25 15:11:58,892 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 2087 transitions, 29052 flow, removed 136 selfloop flow, removed 7 redundant places.
[2023-10-25 15:11:58,920 INFO  L231             Difference]: Finished difference. Result has 195 places, 1597 transitions, 22944 flow
[2023-10-25 15:11:58,921 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=13955, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=22944, PETRI_PLACES=195, PETRI_TRANSITIONS=1597}
[2023-10-25 15:11:58,923 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 138 predicate places.
[2023-10-25 15:11:58,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 195 places, 1597 transitions, 22944 flow
[2023-10-25 15:11:58,924 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 54.69565217391305) internal successors, (1258), 23 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:11:58,924 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:11:58,924 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:11:58,931 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-10-25 15:11:59,129 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2023-10-25 15:11:59,129 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:11:59,130 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:11:59,130 INFO  L85        PathProgramCache]: Analyzing trace with hash -862277107, now seen corresponding path program 3 times
[2023-10-25 15:11:59,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:11:59,131 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353191268]
[2023-10-25 15:11:59,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:11:59,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:11:59,173 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:11:59,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:11:59,635 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:11:59,635 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353191268]
[2023-10-25 15:11:59,635 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353191268] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:11:59,635 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746823719]
[2023-10-25 15:11:59,635 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 15:11:59,635 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:11:59,635 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:11:59,636 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:11:59,680 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2023-10-25 15:11:59,842 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 15:11:59,842 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:11:59,843 INFO  L263         TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 44 conjunts are in the unsatisfiable core
[2023-10-25 15:11:59,846 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:11:59,851 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:11:59,878 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:11:59,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:12:00,040 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:12:00,088 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:12:00,188 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:12:00,238 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-25 15:12:00,257 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:12:00,321 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:12:00,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:00,376 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:12:00,396 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) |c_ULTIMATE.start_main_#t~nondet9#1|)))) is different from false
[2023-10-25 15:12:00,426 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_895 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))) (forall ((v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))))))) is different from false
[2023-10-25 15:12:00,443 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|))))) is different from false
[2023-10-25 15:12:00,465 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse0 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse5))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse6 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)))))))) is different from false
[2023-10-25 15:12:00,485 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse6 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse1 (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)) (.cse2 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= (select (select (store (let ((.cse0 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse4 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse5 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_892 (Array Int Int)) (v_ArrVal_895 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store (let ((.cse7 (store .cse2 |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_892))) (store .cse7 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_895) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse6 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2023-10-25 15:12:00,587 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 15:12:00,588 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [746823719] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:12:00,588 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:12:00,588 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2023-10-25 15:12:00,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283526124]
[2023-10-25 15:12:00,588 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:12:00,588 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-25 15:12:00,588 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:12:00,589 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-25 15:12:00,589 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=393, Unknown=5, NotChecked=220, Total=702
[2023-10-25 15:12:00,840 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-25 15:12:00,841 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 1597 transitions, 22944 flow. Second operand  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:00,841 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:12:00,841 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-25 15:12:00,841 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:09,089 INFO  L130       PetriNetUnfolder]: 11553/19268 cut-off events.
[2023-10-25 15:12:09,089 INFO  L131       PetriNetUnfolder]: For 185351/185357 co-relation queries the response was YES.
[2023-10-25 15:12:09,152 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 139651 conditions, 19268 events. 11553/19268 cut-off events. For 185351/185357 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 129405 event pairs, 697 based on Foata normal form. 118/18359 useless extension candidates. Maximal degree in co-relation 137316. Up to 14904 conditions per place. 
[2023-10-25 15:12:09,229 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 1574 selfloop transitions, 601 changer transitions 2/2181 dead transitions.
[2023-10-25 15:12:09,230 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 2181 transitions, 34403 flow
[2023-10-25 15:12:09,230 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-25 15:12:09,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-25 15:12:09,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1635 transitions.
[2023-10-25 15:12:09,250 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.340625
[2023-10-25 15:12:09,250 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1635 transitions.
[2023-10-25 15:12:09,251 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1635 transitions.
[2023-10-25 15:12:09,251 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:09,251 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1635 transitions.
[2023-10-25 15:12:09,253 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 65.4) internal successors, (1635), 25 states have internal predecessors, (1635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:09,256 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:09,273 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:09,273 INFO  L175             Difference]: Start difference. First operand has 195 places, 1597 transitions, 22944 flow. Second operand 25 states and 1635 transitions.
[2023-10-25 15:12:09,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 2181 transitions, 34403 flow
[2023-10-25 15:12:13,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2181 transitions, 31812 flow, removed 1089 selfloop flow, removed 6 redundant places.
[2023-10-25 15:12:13,233 INFO  L231             Difference]: Finished difference. Result has 223 places, 1767 transitions, 25279 flow
[2023-10-25 15:12:13,234 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=20484, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=462, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=25279, PETRI_PLACES=223, PETRI_TRANSITIONS=1767}
[2023-10-25 15:12:13,235 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 166 predicate places.
[2023-10-25 15:12:13,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1767 transitions, 25279 flow
[2023-10-25 15:12:13,258 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 27 states, 27 states have (on average 54.7037037037037) internal successors, (1477), 27 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:13,258 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:12:13,258 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:12:13,265 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2023-10-25 15:12:13,462 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2023-10-25 15:12:13,463 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:12:13,463 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:12:13,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 329382834, now seen corresponding path program 1 times
[2023-10-25 15:12:13,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:12:13,464 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128402300]
[2023-10-25 15:12:13,464 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:13,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:12:13,481 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:13,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:13,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:12:13,858 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128402300]
[2023-10-25 15:12:13,858 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128402300] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:12:13,858 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982277139]
[2023-10-25 15:12:13,858 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:13,858 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:12:13,859 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:12:13,871 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:12:13,898 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2023-10-25 15:12:13,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:14,000 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 29 conjunts are in the unsatisfiable core
[2023-10-25 15:12:14,006 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:12:14,008 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:12:14,015 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:12:14,015 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:12:14,051 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9
[2023-10-25 15:12:14,071 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22
[2023-10-25 15:12:14,093 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:14,093 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34
[2023-10-25 15:12:14,105 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:14,105 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46
[2023-10-25 15:12:14,131 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39
[2023-10-25 15:12:14,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:14,137 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:12:14,152 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 6)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ 7 c_threadThread1of2ForFork0_~t~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2023-10-25 15:12:14,250 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse1 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 5)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2023-10-25 15:12:14,272 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 5)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 6)) (.cse2 (+ 7 c_threadThread1of2ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_985 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 4)))) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_985) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2023-10-25 15:12:14,346 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:14,346 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53
[2023-10-25 15:12:14,355 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:14,355 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32
[2023-10-25 15:12:14,365 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-25 15:12:14,371 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2023-10-25 15:12:14,378 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-25 15:12:14,379 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2023-10-25 15:12:14,385 INFO  L321             Elim1Store]: treesize reduction 40, result has 2.4 percent of original size
[2023-10-25 15:12:14,385 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1
[2023-10-25 15:12:14,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2023-10-25 15:12:14,418 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [982277139] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:12:14,418 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:12:14,418 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14
[2023-10-25 15:12:14,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424686273]
[2023-10-25 15:12:14,418 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:12:14,433 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-25 15:12:14,433 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:12:14,434 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-25 15:12:14,434 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=114, Unknown=9, NotChecked=72, Total=240
[2023-10-25 15:12:14,516 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 192
[2023-10-25 15:12:14,517 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1767 transitions, 25279 flow. Second operand  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:14,517 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:12:14,517 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 192
[2023-10-25 15:12:14,517 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:22,446 INFO  L130       PetriNetUnfolder]: 12234/20378 cut-off events.
[2023-10-25 15:12:22,447 INFO  L131       PetriNetUnfolder]: For 217902/217910 co-relation queries the response was YES.
[2023-10-25 15:12:22,525 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156294 conditions, 20378 events. 12234/20378 cut-off events. For 217902/217910 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 138964 event pairs, 1327 based on Foata normal form. 65/19384 useless extension candidates. Maximal degree in co-relation 153912. Up to 10079 conditions per place. 
[2023-10-25 15:12:22,606 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 1019 selfloop transitions, 1404 changer transitions 10/2437 dead transitions.
[2023-10-25 15:12:22,609 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 2437 transitions, 38878 flow
[2023-10-25 15:12:22,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2023-10-25 15:12:22,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2023-10-25 15:12:22,611 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1533 transitions.
[2023-10-25 15:12:22,621 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4435763888888889
[2023-10-25 15:12:22,622 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1533 transitions.
[2023-10-25 15:12:22,622 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1533 transitions.
[2023-10-25 15:12:22,622 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:22,622 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1533 transitions.
[2023-10-25 15:12:22,638 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 85.16666666666667) internal successors, (1533), 18 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:22,641 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:22,642 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:22,642 INFO  L175             Difference]: Start difference. First operand has 223 places, 1767 transitions, 25279 flow. Second operand 18 states and 1533 transitions.
[2023-10-25 15:12:22,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 2437 transitions, 38878 flow
[2023-10-25 15:12:27,484 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2437 transitions, 37334 flow, removed 671 selfloop flow, removed 8 redundant places.
[2023-10-25 15:12:27,536 INFO  L231             Difference]: Finished difference. Result has 236 places, 1973 transitions, 30792 flow
[2023-10-25 15:12:27,550 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=24133, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1767, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=30792, PETRI_PLACES=236, PETRI_TRANSITIONS=1973}
[2023-10-25 15:12:27,551 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 179 predicate places.
[2023-10-25 15:12:27,552 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 1973 transitions, 30792 flow
[2023-10-25 15:12:27,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 59.8125) internal successors, (957), 16 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:27,552 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:12:27,552 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:12:27,558 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2023-10-25 15:12:27,756 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2023-10-25 15:12:27,756 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:12:27,757 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:12:27,757 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883145753, now seen corresponding path program 1 times
[2023-10-25 15:12:27,757 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:12:27,757 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468609582]
[2023-10-25 15:12:27,757 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:27,758 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:12:27,773 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:28,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:28,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:12:28,185 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468609582]
[2023-10-25 15:12:28,185 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468609582] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:12:28,185 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508579481]
[2023-10-25 15:12:28,186 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:12:28,186 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:12:28,186 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:12:28,187 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:12:28,223 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2023-10-25 15:12:28,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:12:28,370 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 40 conjunts are in the unsatisfiable core
[2023-10-25 15:12:28,375 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:12:28,388 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:12:28,427 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:12:28,427 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:12:28,539 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:12:28,581 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:12:28,630 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:12:28,709 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:12:28,767 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:12:28,812 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:28,812 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:12:29,125 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false
[2023-10-25 15:12:29,142 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1079 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1079) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-10-25 15:12:29,167 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:29,167 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2023-10-25 15:12:29,172 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:12:29,172 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2023-10-25 15:12:29,175 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2023-10-25 15:12:29,180 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 15:12:29,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2023-10-25 15:12:29,185 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 15:12:29,186 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2023-10-25 15:12:29,231 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:12:29,232 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [508579481] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:12:29,232 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:12:29,232 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-10-25 15:12:29,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811440952]
[2023-10-25 15:12:29,233 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:12:29,234 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:12:29,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:12:29,234 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:12:29,235 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=433, Unknown=19, NotChecked=90, Total=650
[2023-10-25 15:12:29,512 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-25 15:12:29,513 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1973 transitions, 30792 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:29,513 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:12:29,513 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-25 15:12:29,513 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:12:45,578 INFO  L130       PetriNetUnfolder]: 21940/36688 cut-off events.
[2023-10-25 15:12:45,578 INFO  L131       PetriNetUnfolder]: For 426823/426905 co-relation queries the response was YES.
[2023-10-25 15:12:45,841 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 300915 conditions, 36688 events. 21940/36688 cut-off events. For 426823/426905 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 277379 event pairs, 1049 based on Foata normal form. 352/34898 useless extension candidates. Maximal degree in co-relation 294677. Up to 15484 conditions per place. 
[2023-10-25 15:12:46,005 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2770 selfloop transitions, 1147 changer transitions 2/3923 dead transitions.
[2023-10-25 15:12:46,006 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 3923 transitions, 65680 flow
[2023-10-25 15:12:46,007 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2023-10-25 15:12:46,007 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2023-10-25 15:12:46,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1986 transitions.
[2023-10-25 15:12:46,009 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34479166666666666
[2023-10-25 15:12:46,010 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1986 transitions.
[2023-10-25 15:12:46,017 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1986 transitions.
[2023-10-25 15:12:46,018 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:12:46,018 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1986 transitions.
[2023-10-25 15:12:46,020 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 66.2) internal successors, (1986), 30 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:46,023 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:46,024 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 192.0) internal successors, (5952), 31 states have internal predecessors, (5952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:12:46,024 INFO  L175             Difference]: Start difference. First operand has 236 places, 1973 transitions, 30792 flow. Second operand 30 states and 1986 transitions.
[2023-10-25 15:12:46,024 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 3923 transitions, 65680 flow
[2023-10-25 15:13:09,587 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 3923 transitions, 61915 flow, removed 686 selfloop flow, removed 10 redundant places.
[2023-10-25 15:13:09,675 INFO  L231             Difference]: Finished difference. Result has 277 places, 3020 transitions, 49672 flow
[2023-10-25 15:13:09,677 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=28910, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=287, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=49672, PETRI_PLACES=277, PETRI_TRANSITIONS=3020}
[2023-10-25 15:13:09,678 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 220 predicate places.
[2023-10-25 15:13:09,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 277 places, 3020 transitions, 49672 flow
[2023-10-25 15:13:09,678 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:09,678 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:13:09,678 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:13:09,701 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2023-10-25 15:13:09,882 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2023-10-25 15:13:09,882 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:13:09,882 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:13:09,883 INFO  L85        PathProgramCache]: Analyzing trace with hash -201168629, now seen corresponding path program 2 times
[2023-10-25 15:13:09,883 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:13:09,883 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405368390]
[2023-10-25 15:13:09,883 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:13:09,883 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:13:09,899 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:13:10,323 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:10,323 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:13:10,323 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405368390]
[2023-10-25 15:13:10,323 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405368390] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:13:10,323 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995688988]
[2023-10-25 15:13:10,323 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:13:10,323 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:13:10,323 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:13:10,337 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:13:10,385 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2023-10-25 15:13:10,542 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:13:10,542 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:13:10,543 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-25 15:13:10,545 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:13:10,548 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:13:10,567 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:13:10,568 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:13:10,670 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:13:10,697 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:13:10,746 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:13:10,847 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-25 15:13:10,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:13:10,933 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:13:10,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:10,979 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:13:10,996 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1174 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1174 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-10-25 15:13:11,153 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2023-10-25 15:13:11,178 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (and (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse3 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1174 (Array Int Int)) (v_ArrVal_1171 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1171))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1174) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0))))) is different from false
[2023-10-25 15:13:11,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:13:11,285 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [995688988] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:13:11,285 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:13:11,285 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-10-25 15:13:11,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637617720]
[2023-10-25 15:13:11,285 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:13:11,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:13:11,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:13:11,286 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:13:11,286 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=416, Unknown=9, NotChecked=132, Total=650
[2023-10-25 15:13:11,347 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-25 15:13:11,348 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 3020 transitions, 49672 flow. Second operand  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:11,348 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:13:11,348 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-25 15:13:11,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:13:35,659 INFO  L130       PetriNetUnfolder]: 25276/42687 cut-off events.
[2023-10-25 15:13:35,659 INFO  L131       PetriNetUnfolder]: For 780172/780244 co-relation queries the response was YES.
[2023-10-25 15:13:36,196 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 388629 conditions, 42687 events. 25276/42687 cut-off events. For 780172/780244 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 331992 event pairs, 1801 based on Foata normal form. 269/40371 useless extension candidates. Maximal degree in co-relation 382433. Up to 20482 conditions per place. 
[2023-10-25 15:13:36,418 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2885 selfloop transitions, 1072 changer transitions 0/3961 dead transitions.
[2023-10-25 15:13:36,419 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 3961 transitions, 72942 flow
[2023-10-25 15:13:36,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2023-10-25 15:13:36,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2023-10-25 15:13:36,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1822 transitions.
[2023-10-25 15:13:36,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36498397435897434
[2023-10-25 15:13:36,421 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 1822 transitions.
[2023-10-25 15:13:36,421 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 1822 transitions.
[2023-10-25 15:13:36,422 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:13:36,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 1822 transitions.
[2023-10-25 15:13:36,424 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 70.07692307692308) internal successors, (1822), 26 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:36,427 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:36,428 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 192.0) internal successors, (5184), 27 states have internal predecessors, (5184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:13:36,428 INFO  L175             Difference]: Start difference. First operand has 277 places, 3020 transitions, 49672 flow. Second operand 26 states and 1822 transitions.
[2023-10-25 15:13:36,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 3961 transitions, 72942 flow
[2023-10-25 15:14:18,239 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 3961 transitions, 68771 flow, removed 2083 selfloop flow, removed 3 redundant places.
[2023-10-25 15:14:18,291 INFO  L231             Difference]: Finished difference. Result has 317 places, 3492 transitions, 58992 flow
[2023-10-25 15:14:18,293 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=46139, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3020, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=621, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=58992, PETRI_PLACES=317, PETRI_TRANSITIONS=3492}
[2023-10-25 15:14:18,294 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 260 predicate places.
[2023-10-25 15:14:18,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 317 places, 3492 transitions, 58992 flow
[2023-10-25 15:14:18,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 56.80769230769231) internal successors, (1477), 26 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:18,294 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:14:18,294 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:14:18,301 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2023-10-25 15:14:18,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2023-10-25 15:14:18,500 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:14:18,501 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:14:18,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -530869613, now seen corresponding path program 3 times
[2023-10-25 15:14:18,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:14:18,502 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690735822]
[2023-10-25 15:14:18,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:14:18,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:14:18,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:14:18,946 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:14:18,946 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:14:18,946 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690735822]
[2023-10-25 15:14:18,946 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690735822] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:14:18,946 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473868361]
[2023-10-25 15:14:18,947 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-10-25 15:14:18,947 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:14:18,947 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:14:18,948 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:14:18,992 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2023-10-25 15:14:19,142 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2023-10-25 15:14:19,142 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:14:19,143 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-25 15:14:19,146 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:14:19,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:14:19,195 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:14:19,195 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:14:19,329 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:14:19,362 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:14:19,415 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:14:19,481 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2023-10-25 15:14:19,511 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:14:19,570 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:14:19,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:14:19,616 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:14:19,645 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-10-25 15:14:19,658 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1269 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)))))) is different from false
[2023-10-25 15:14:19,690 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse2 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1269 (Array Int Int)) (v_ArrVal_1266 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1266))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1269) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) 0))))) is different from false
[2023-10-25 15:14:19,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:14:19,799 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473868361] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:14:19,799 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:14:19,799 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23
[2023-10-25 15:14:19,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20775262]
[2023-10-25 15:14:19,799 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:14:19,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2023-10-25 15:14:19,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:14:19,800 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2023-10-25 15:14:19,800 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=378, Unknown=3, NotChecked=126, Total=600
[2023-10-25 15:14:19,924 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-25 15:14:19,925 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 3492 transitions, 58992 flow. Second operand  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:19,925 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:14:19,925 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-25 15:14:19,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:14:47,896 INFO  L130       PetriNetUnfolder]: 26170/44205 cut-off events.
[2023-10-25 15:14:47,896 INFO  L131       PetriNetUnfolder]: For 1031411/1031425 co-relation queries the response was YES.
[2023-10-25 15:14:48,364 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 432566 conditions, 44205 events. 26170/44205 cut-off events. For 1031411/1031425 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 345770 event pairs, 1339 based on Foata normal form. 199/41763 useless extension candidates. Maximal degree in co-relation 426112. Up to 15717 conditions per place. 
[2023-10-25 15:14:48,594 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 2780 selfloop transitions, 1750 changer transitions 2/4536 dead transitions.
[2023-10-25 15:14:48,594 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 4536 transitions, 85690 flow
[2023-10-25 15:14:48,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-25 15:14:48,595 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-25 15:14:48,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1765 transitions.
[2023-10-25 15:14:48,598 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36770833333333336
[2023-10-25 15:14:48,598 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1765 transitions.
[2023-10-25 15:14:48,599 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1765 transitions.
[2023-10-25 15:14:48,599 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:14:48,599 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1765 transitions.
[2023-10-25 15:14:48,601 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 70.6) internal successors, (1765), 25 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:48,605 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:48,605 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:14:48,605 INFO  L175             Difference]: Start difference. First operand has 317 places, 3492 transitions, 58992 flow. Second operand 25 states and 1765 transitions.
[2023-10-25 15:14:48,606 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 4536 transitions, 85690 flow
[2023-10-25 15:15:32,997 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 4536 transitions, 83793 flow, removed 946 selfloop flow, removed 3 redundant places.
[2023-10-25 15:15:33,078 INFO  L231             Difference]: Finished difference. Result has 345 places, 3971 transitions, 71320 flow
[2023-10-25 15:15:33,085 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=57313, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=71320, PETRI_PLACES=345, PETRI_TRANSITIONS=3971}
[2023-10-25 15:15:33,100 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 288 predicate places.
[2023-10-25 15:15:33,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 345 places, 3971 transitions, 71320 flow
[2023-10-25 15:15:33,101 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 56.84) internal successors, (1421), 25 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:15:33,101 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:15:33,101 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:15:33,107 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2023-10-25 15:15:33,305 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:15:33,306 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:15:33,306 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:15:33,306 INFO  L85        PathProgramCache]: Analyzing trace with hash -85817847, now seen corresponding path program 1 times
[2023-10-25 15:15:33,306 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:15:33,306 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371868338]
[2023-10-25 15:15:33,307 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:15:33,307 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:15:33,327 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:15:33,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:15:33,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:15:33,754 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371868338]
[2023-10-25 15:15:33,754 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371868338] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:15:33,754 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434241401]
[2023-10-25 15:15:33,754 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:15:33,754 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:15:33,754 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:15:33,755 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:15:33,787 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2023-10-25 15:15:33,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:15:33,947 INFO  L263         TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-10-25 15:15:33,949 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:15:33,951 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:15:33,963 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:15:33,964 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:15:33,991 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:15:34,003 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-25 15:15:34,023 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:15:34,037 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:15:34,038 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:15:34,053 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:15:34,053 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:15:34,078 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:15:34,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:15:34,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:15:34,097 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:15:34,129 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))))) is different from false
[2023-10-25 15:15:34,269 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset|)))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse2 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)))))))) is different from false
[2023-10-25 15:15:34,283 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse4 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse4 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1385 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1385) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-25 15:15:34,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 15:15:34,357 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [434241401] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:15:34,357 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:15:34,357 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-10-25 15:15:34,358 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812342264]
[2023-10-25 15:15:34,358 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:15:34,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-25 15:15:34,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:15:34,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-25 15:15:34,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-10-25 15:15:34,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-25 15:15:34,506 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 3971 transitions, 71320 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:15:34,506 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:15:34,506 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-25 15:15:34,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:16:04,521 INFO  L130       PetriNetUnfolder]: 26160/44175 cut-off events.
[2023-10-25 15:16:04,521 INFO  L131       PetriNetUnfolder]: For 1231998/1232042 co-relation queries the response was YES.
[2023-10-25 15:16:04,973 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 465723 conditions, 44175 events. 26160/44175 cut-off events. For 1231998/1232042 co-relation queries the response was YES. Maximal size of possible extension queue 1369. Compared 344462 event pairs, 3912 based on Foata normal form. 66/41604 useless extension candidates. Maximal degree in co-relation 461007. Up to 38536 conditions per place. 
[2023-10-25 15:16:05,210 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 3174 selfloop transitions, 1041 changer transitions 0/4219 dead transitions.
[2023-10-25 15:16:05,210 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 4219 transitions, 84045 flow
[2023-10-25 15:16:05,210 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-25 15:16:05,210 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-25 15:16:05,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 819 transitions.
[2023-10-25 15:16:05,218 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.35546875
[2023-10-25 15:16:05,218 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 819 transitions.
[2023-10-25 15:16:05,218 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 819 transitions.
[2023-10-25 15:16:05,220 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:16:05,220 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 819 transitions.
[2023-10-25 15:16:05,225 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.25) internal successors, (819), 12 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:05,226 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:05,227 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:05,227 INFO  L175             Difference]: Start difference. First operand has 345 places, 3971 transitions, 71320 flow. Second operand 12 states and 819 transitions.
[2023-10-25 15:16:05,227 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 4219 transitions, 84045 flow
[2023-10-25 15:16:50,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 4219 transitions, 82234 flow, removed 856 selfloop flow, removed 9 redundant places.
[2023-10-25 15:16:50,478 INFO  L231             Difference]: Finished difference. Result has 349 places, 4037 transitions, 72965 flow
[2023-10-25 15:16:50,480 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=69498, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=969, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2984, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=72965, PETRI_PLACES=349, PETRI_TRANSITIONS=4037}
[2023-10-25 15:16:50,481 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 292 predicate places.
[2023-10-25 15:16:50,481 INFO  L495      AbstractCegarLoop]: Abstraction has has 349 places, 4037 transitions, 72965 flow
[2023-10-25 15:16:50,481 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:50,481 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:16:50,481 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:16:50,488 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2023-10-25 15:16:50,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:16:50,686 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:16:50,688 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:16:50,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 92273895, now seen corresponding path program 4 times
[2023-10-25 15:16:50,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:16:50,689 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627648884]
[2023-10-25 15:16:50,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:16:50,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:16:50,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:16:51,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:16:51,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:16:51,099 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627648884]
[2023-10-25 15:16:51,099 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627648884] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:16:51,099 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783340931]
[2023-10-25 15:16:51,099 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2023-10-25 15:16:51,099 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:16:51,099 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:16:51,100 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:16:51,145 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2023-10-25 15:16:51,444 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2023-10-25 15:16:51,445 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:16:51,446 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core
[2023-10-25 15:16:51,448 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:16:51,453 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:16:51,459 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:16:51,460 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:16:51,491 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:16:51,498 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:16:51,530 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-25 15:16:51,540 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:16:51,540 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:16:51,551 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:16:51,552 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:16:51,575 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:16:51,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:16:51,582 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:16:51,612 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)))) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)))) is different from false
[2023-10-25 15:16:51,764 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1480 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2023-10-25 15:16:51,776 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= 0 (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)))) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2023-10-25 15:16:51,788 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3))) (and (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1475 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1475))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1480) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0))))) is different from false
[2023-10-25 15:16:51,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:16:51,888 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783340931] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:16:51,888 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:16:51,888 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 15
[2023-10-25 15:16:51,888 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607540359]
[2023-10-25 15:16:51,888 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:16:51,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2023-10-25 15:16:51,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:16:51,888 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2023-10-25 15:16:51,889 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=10, NotChecked=100, Total=272
[2023-10-25 15:16:51,939 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 192
[2023-10-25 15:16:51,939 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 4037 transitions, 72965 flow. Second operand  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:16:51,940 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:16:51,940 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 192
[2023-10-25 15:16:51,940 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:17:26,935 INFO  L130       PetriNetUnfolder]: 29823/50776 cut-off events.
[2023-10-25 15:17:26,936 INFO  L131       PetriNetUnfolder]: For 1471610/1471630 co-relation queries the response was YES.
[2023-10-25 15:17:27,526 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 530969 conditions, 50776 events. 29823/50776 cut-off events. For 1471610/1471630 co-relation queries the response was YES. Maximal size of possible extension queue 1522. Compared 408296 event pairs, 2784 based on Foata normal form. 184/47868 useless extension candidates. Maximal degree in co-relation 525729. Up to 32484 conditions per place. 
[2023-10-25 15:17:27,802 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 3395 selfloop transitions, 1642 changer transitions 0/5041 dead transitions.
[2023-10-25 15:17:27,802 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 5041 transitions, 102378 flow
[2023-10-25 15:17:27,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-10-25 15:17:27,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2023-10-25 15:17:27,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1702 transitions.
[2023-10-25 15:17:27,804 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3693576388888889
[2023-10-25 15:17:27,804 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 1702 transitions.
[2023-10-25 15:17:27,804 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 1702 transitions.
[2023-10-25 15:17:27,805 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:17:27,805 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1702 transitions.
[2023-10-25 15:17:27,833 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 70.91666666666667) internal successors, (1702), 24 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:17:27,840 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:17:27,840 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:17:27,840 INFO  L175             Difference]: Start difference. First operand has 349 places, 4037 transitions, 72965 flow. Second operand 24 states and 1702 transitions.
[2023-10-25 15:17:27,840 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 5041 transitions, 102378 flow
[2023-10-25 15:18:16,670 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 5041 transitions, 100501 flow, removed 117 selfloop flow, removed 7 redundant places.
[2023-10-25 15:18:16,745 INFO  L231             Difference]: Finished difference. Result has 385 places, 4635 transitions, 91290 flow
[2023-10-25 15:18:16,747 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=71127, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=91290, PETRI_PLACES=385, PETRI_TRANSITIONS=4635}
[2023-10-25 15:18:16,752 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 328 predicate places.
[2023-10-25 15:18:16,753 INFO  L495      AbstractCegarLoop]: Abstraction has has 385 places, 4635 transitions, 91290 flow
[2023-10-25 15:18:16,753 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 17 states have (on average 56.64705882352941) internal successors, (963), 17 states have internal predecessors, (963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:16,753 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:18:16,753 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:18:16,760 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2023-10-25 15:18:16,958 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-10-25 15:18:16,959 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:18:16,960 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:18:16,960 INFO  L85        PathProgramCache]: Analyzing trace with hash -1956895420, now seen corresponding path program 1 times
[2023-10-25 15:18:16,960 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:18:16,962 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366371895]
[2023-10-25 15:18:16,962 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:16,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:18:17,005 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:17,424 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:17,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:18:17,424 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366371895]
[2023-10-25 15:18:17,424 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366371895] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:18:17,424 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509581598]
[2023-10-25 15:18:17,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:18:17,424 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:18:17,424 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:18:17,425 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:18:17,465 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2023-10-25 15:18:17,625 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:18:17,626 INFO  L263         TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-25 15:18:17,630 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:18:17,638 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:18:17,671 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:18:17,671 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:18:17,802 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:18:17,833 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:18:17,882 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:18:17,929 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:18:17,996 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:18:18,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:18,042 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:18:18,076 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)))) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false
[2023-10-25 15:18:18,259 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false
[2023-10-25 15:18:18,272 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2) 0)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1571 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1571) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-10-25 15:18:18,282 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:18,283 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2023-10-25 15:18:18,287 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:18:18,287 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2023-10-25 15:18:18,306 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2023-10-25 15:18:18,312 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 15:18:18,312 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2023-10-25 15:18:18,316 INFO  L321             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2023-10-25 15:18:18,316 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2023-10-25 15:18:18,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:18:18,351 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [509581598] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:18:18,351 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:18:18,351 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24
[2023-10-25 15:18:18,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386865912]
[2023-10-25 15:18:18,352 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:18:18,352 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:18:18,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:18:18,352 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:18:18,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=404, Unknown=14, NotChecked=132, Total=650
[2023-10-25 15:18:18,532 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-25 15:18:18,533 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 4635 transitions, 91290 flow. Second operand  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:18:18,533 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:18:18,533 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-25 15:18:18,534 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:19:02,497 INFO  L130       PetriNetUnfolder]: 30142/51413 cut-off events.
[2023-10-25 15:19:02,497 INFO  L131       PetriNetUnfolder]: For 1854577/1854615 co-relation queries the response was YES.
[2023-10-25 15:19:03,158 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 574702 conditions, 51413 events. 30142/51413 cut-off events. For 1854577/1854615 co-relation queries the response was YES. Maximal size of possible extension queue 1555. Compared 415600 event pairs, 2004 based on Foata normal form. 114/48419 useless extension candidates. Maximal degree in co-relation 568834. Up to 18452 conditions per place. 
[2023-10-25 15:19:03,469 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3219 selfloop transitions, 2253 changer transitions 4/5480 dead transitions.
[2023-10-25 15:19:03,469 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 5480 transitions, 118395 flow
[2023-10-25 15:19:03,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2023-10-25 15:19:03,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2023-10-25 15:19:03,486 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2123 transitions.
[2023-10-25 15:19:03,487 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3252144607843137
[2023-10-25 15:19:03,487 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 2123 transitions.
[2023-10-25 15:19:03,487 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 2123 transitions.
[2023-10-25 15:19:03,488 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:19:03,488 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2123 transitions.
[2023-10-25 15:19:03,490 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 35 states, 34 states have (on average 62.44117647058823) internal successors, (2123), 34 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:03,510 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:03,510 INFO  L81            ComplementDD]: Finished complementDD. Result  has 35 states, 35 states have (on average 192.0) internal successors, (6720), 35 states have internal predecessors, (6720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:19:03,510 INFO  L175             Difference]: Start difference. First operand has 385 places, 4635 transitions, 91290 flow. Second operand 34 states and 2123 transitions.
[2023-10-25 15:19:03,510 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 5480 transitions, 118395 flow
[2023-10-25 15:20:05,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 5480 transitions, 115212 flow, removed 1585 selfloop flow, removed 4 redundant places.
[2023-10-25 15:20:05,343 INFO  L231             Difference]: Finished difference. Result has 422 places, 4840 transitions, 99613 flow
[2023-10-25 15:20:05,346 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=88151, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2041, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=99613, PETRI_PLACES=422, PETRI_TRANSITIONS=4840}
[2023-10-25 15:20:05,347 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 365 predicate places.
[2023-10-25 15:20:05,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 422 places, 4840 transitions, 99613 flow
[2023-10-25 15:20:05,347 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.73076923076923) internal successors, (1293), 26 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:05,347 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:20:05,347 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:20:05,354 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2023-10-25 15:20:05,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2023-10-25 15:20:05,552 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:20:05,562 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:20:05,563 INFO  L85        PathProgramCache]: Analyzing trace with hash 736991051, now seen corresponding path program 5 times
[2023-10-25 15:20:05,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:20:05,563 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128473165]
[2023-10-25 15:20:05,563 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:20:05,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:20:05,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:20:05,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:05,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:20:05,953 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128473165]
[2023-10-25 15:20:05,953 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128473165] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:20:05,953 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78526319]
[2023-10-25 15:20:05,953 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2023-10-25 15:20:05,953 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:20:05,953 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:20:05,961 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:20:06,018 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2023-10-25 15:20:06,175 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-10-25 15:20:06,175 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:20:06,177 INFO  L263         TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core
[2023-10-25 15:20:06,178 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:20:06,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:20:06,208 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:20:06,209 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:20:06,298 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:20:06,343 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-25 15:20:06,356 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:20:06,396 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:20:06,430 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:20:06,475 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:20:06,509 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:06,509 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:20:06,529 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false
[2023-10-25 15:20:06,654 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false
[2023-10-25 15:20:06,668 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1666 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1666) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false
[2023-10-25 15:20:06,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:20:06,749 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [78526319] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:20:06,749 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:20:06,749 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 24
[2023-10-25 15:20:06,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142222278]
[2023-10-25 15:20:06,749 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:20:06,749 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2023-10-25 15:20:06,749 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:20:06,750 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2023-10-25 15:20:06,750 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=414, Unknown=13, NotChecked=132, Total=650
[2023-10-25 15:20:06,879 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-25 15:20:06,881 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 4840 transitions, 99613 flow. Second operand  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:06,881 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:20:06,881 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-25 15:20:06,881 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:20:58,019 INFO  L130       PetriNetUnfolder]: 33457/57317 cut-off events.
[2023-10-25 15:20:58,019 INFO  L131       PetriNetUnfolder]: For 2928608/2928634 co-relation queries the response was YES.
[2023-10-25 15:20:58,842 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 675531 conditions, 57317 events. 33457/57317 cut-off events. For 2928608/2928634 co-relation queries the response was YES. Maximal size of possible extension queue 1726. Compared 472331 event pairs, 2420 based on Foata normal form. 184/55469 useless extension candidates. Maximal degree in co-relation 669066. Up to 22990 conditions per place. 
[2023-10-25 15:20:59,223 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 3860 selfloop transitions, 2116 changer transitions 0/5980 dead transitions.
[2023-10-25 15:20:59,224 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 5980 transitions, 136763 flow
[2023-10-25 15:20:59,224 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2023-10-25 15:20:59,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2023-10-25 15:20:59,225 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1588 transitions.
[2023-10-25 15:20:59,226 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3308333333333333
[2023-10-25 15:20:59,226 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1588 transitions.
[2023-10-25 15:20:59,226 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1588 transitions.
[2023-10-25 15:20:59,226 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:20:59,226 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1588 transitions.
[2023-10-25 15:20:59,244 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 63.52) internal successors, (1588), 25 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:59,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:59,247 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:20:59,247 INFO  L175             Difference]: Start difference. First operand has 422 places, 4840 transitions, 99613 flow. Second operand 25 states and 1588 transitions.
[2023-10-25 15:20:59,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 5980 transitions, 136763 flow
[2023-10-25 15:22:29,225 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 5980 transitions, 134508 flow, removed 720 selfloop flow, removed 13 redundant places.
[2023-10-25 15:22:29,426 INFO  L231             Difference]: Finished difference. Result has 451 places, 5469 transitions, 123099 flow
[2023-10-25 15:22:29,429 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=97634, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4836, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1597, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=123099, PETRI_PLACES=451, PETRI_TRANSITIONS=5469}
[2023-10-25 15:22:29,430 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 394 predicate places.
[2023-10-25 15:22:29,430 INFO  L495      AbstractCegarLoop]: Abstraction has has 451 places, 5469 transitions, 123099 flow
[2023-10-25 15:22:29,431 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 26 states have (on average 49.80769230769231) internal successors, (1295), 26 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:29,432 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:22:29,432 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:22:29,439 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0
[2023-10-25 15:22:29,637 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:22:29,637 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:22:29,638 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:22:29,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -159175320, now seen corresponding path program 1 times
[2023-10-25 15:22:29,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:22:29,638 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116580201]
[2023-10-25 15:22:29,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:29,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:22:29,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:30,066 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:30,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:22:30,066 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116580201]
[2023-10-25 15:22:30,067 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116580201] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:22:30,067 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716022121]
[2023-10-25 15:22:30,067 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:22:30,067 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:22:30,067 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:22:30,068 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:22:30,100 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2023-10-25 15:22:30,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:22:30,231 INFO  L263         TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 34 conjunts are in the unsatisfiable core
[2023-10-25 15:22:30,233 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:22:30,236 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:22:30,249 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:22:30,249 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:22:30,307 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:22:30,318 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-25 15:22:30,325 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-25 15:22:30,332 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2023-10-25 15:22:30,340 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:22:30,349 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:22:30,350 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:22:30,362 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:22:30,362 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:22:30,394 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:22:30,401 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:22:30,401 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:22:30,427 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 3)))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse0 |c_ULTIMATE.start_main_~ts~0#1.offset| 2)))))) is different from false
[2023-10-25 15:22:30,519 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) |c_ULTIMATE.start_main_#t~nondet9#1|)) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-25 15:22:30,531 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse2 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 1)) (.cse1 (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 |c_ULTIMATE.start_main_#t~nondet9#1|) .cse1 |c_ULTIMATE.start_main_#t~nondet9#1|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset| 3) |c_ULTIMATE.start_main_#t~nondet9#1|)))) (and (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1))) (forall ((v_ArrVal_1788 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~nondet9#1| (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1788 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1788) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~ts~0#1.offset|)) |c_ULTIMATE.start_main_#t~nondet9#1|)))))) is different from false
[2023-10-25 15:22:30,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2023-10-25 15:22:30,611 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [716022121] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:22:30,611 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:22:30,611 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 14
[2023-10-25 15:22:30,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003244350]
[2023-10-25 15:22:30,611 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:22:30,611 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2023-10-25 15:22:30,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:22:30,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2023-10-25 15:22:30,612 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=118, Unknown=9, NotChecked=72, Total=240
[2023-10-25 15:22:30,703 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 53 out of 192
[2023-10-25 15:22:30,704 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 5469 transitions, 123099 flow. Second operand  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:22:30,704 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:22:30,704 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 192
[2023-10-25 15:22:30,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:32,310 INFO  L130       PetriNetUnfolder]: 33456/57201 cut-off events.
[2023-10-25 15:23:32,310 INFO  L131       PetriNetUnfolder]: For 3318944/3318972 co-relation queries the response was YES.
[2023-10-25 15:23:33,244 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 704513 conditions, 57201 events. 33456/57201 cut-off events. For 3318944/3318972 co-relation queries the response was YES. Maximal size of possible extension queue 1718. Compared 469188 event pairs, 5576 based on Foata normal form. 2/55170 useless extension candidates. Maximal degree in co-relation 703678. Up to 50485 conditions per place. 
[2023-10-25 15:23:33,634 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 4522 selfloop transitions, 1107 changer transitions 0/5633 dead transitions.
[2023-10-25 15:23:33,634 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 5633 transitions, 137877 flow
[2023-10-25 15:23:33,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2023-10-25 15:23:33,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2023-10-25 15:23:33,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 816 transitions.
[2023-10-25 15:23:33,635 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3541666666666667
[2023-10-25 15:23:33,636 INFO  L72            ComplementDD]: Start complementDD. Operand 12 states and 816 transitions.
[2023-10-25 15:23:33,636 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 12 states and 816 transitions.
[2023-10-25 15:23:33,636 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:33,636 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 816 transitions.
[2023-10-25 15:23:33,637 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 13 states, 12 states have (on average 68.0) internal successors, (816), 12 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:33,638 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:33,638 INFO  L81            ComplementDD]: Finished complementDD. Result  has 13 states, 13 states have (on average 192.0) internal successors, (2496), 13 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:33,639 INFO  L175             Difference]: Start difference. First operand has 451 places, 5469 transitions, 123099 flow. Second operand 12 states and 816 transitions.
[2023-10-25 15:23:33,639 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 5633 transitions, 137877 flow
[2023-10-25 15:24:58,673 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 5633 transitions, 133616 flow, removed 2125 selfloop flow, removed 4 redundant places.
[2023-10-25 15:24:58,818 INFO  L231             Difference]: Finished difference. Result has 460 places, 5470 transitions, 121337 flow
[2023-10-25 15:24:58,826 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=118838, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=121337, PETRI_PLACES=460, PETRI_TRANSITIONS=5470}
[2023-10-25 15:24:58,840 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 403 predicate places.
[2023-10-25 15:24:58,841 INFO  L495      AbstractCegarLoop]: Abstraction has has 460 places, 5470 transitions, 121337 flow
[2023-10-25 15:24:58,841 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 54.75) internal successors, (876), 16 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:58,841 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:58,841 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:58,847 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0
[2023-10-25 15:24:59,046 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:24:59,046 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2023-10-25 15:24:59,047 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:59,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 818731398, now seen corresponding path program 1 times
[2023-10-25 15:24:59,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:59,047 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535163340]
[2023-10-25 15:24:59,048 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:59,048 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:59,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:59,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:59,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:59,545 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535163340]
[2023-10-25 15:24:59,545 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535163340] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:24:59,545 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468382923]
[2023-10-25 15:24:59,545 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:59,545 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:24:59,546 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:24:59,562 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:24:59,609 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2023-10-25 15:24:59,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:59,784 INFO  L263         TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core
[2023-10-25 15:24:59,787 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:24:59,792 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2023-10-25 15:24:59,836 INFO  L321             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2023-10-25 15:24:59,837 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11
[2023-10-25 15:24:59,941 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2023-10-25 15:24:59,967 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2023-10-25 15:25:00,052 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-25 15:25:00,066 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-25 15:25:00,090 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30
[2023-10-25 15:25:00,100 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42
[2023-10-25 15:25:00,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57
[2023-10-25 15:25:00,225 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50
[2023-10-25 15:25:00,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:25:00,271 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:25:00,287 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)))) is different from false
[2023-10-25 15:25:00,311 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false
[2023-10-25 15:25:00,325 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1893 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false
[2023-10-25 15:25:00,341 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse6 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0))))) is different from false
[2023-10-25 15:25:00,387 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (and (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse4 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse4 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= (select (select (store (let ((.cse5 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse5 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse5 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1888 (Array Int Int)) (v_ArrVal_1893 (Array Int Int))) (= 0 (select (select (store (let ((.cse6 (store |c_#race| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1888))) (store .cse6 |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select .cse6 |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse2 0))) |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_1893) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2)))))) is different from false
[2023-10-25 15:25:00,478 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:25:00,478 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [468382923] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:25:00,478 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:25:00,478 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 25
[2023-10-25 15:25:00,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458678540]
[2023-10-25 15:25:00,479 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:25:00,479 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 27 states
[2023-10-25 15:25:00,479 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:00,479 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants.
[2023-10-25 15:25:00,479 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=390, Unknown=5, NotChecked=220, Total=702
[2023-10-25 15:25:00,567 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 48 out of 192
[2023-10-25 15:25:00,567 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 5470 transitions, 121337 flow. Second operand  has 27 states, 27 states have (on average 50.0) internal successors, (1350), 27 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:00,567 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:00,568 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 192
[2023-10-25 15:25:00,568 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
