./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:47:44,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:47:44,173 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 02:47:44,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:47:44,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:47:44,218 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:47:44,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:47:44,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:47:44,221 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:47:44,221 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:47:44,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:47:44,222 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:47:44,222 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:47:44,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:47:44,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:47:44,223 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:47:44,223 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:47:44,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:47:44,223 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:47:44,223 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:47:44,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:47:44,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:47:44,224 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 02:47:44,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 02:47:44,224 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:47:44,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:47:44,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:47:44,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:47:44,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:47:44,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:47:44,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:47:44,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:44,226 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:47:44,226 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:47:44,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:47:44,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:44,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:47:44,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:47:44,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:47:44,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:47:44,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:47:44,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:47:44,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:47:44,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:47:44,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:47:44,228 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:47:44,228 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 20832c4ec3f8ccecbcf7cfcec0aecbbc925bfb9e6d8397db46b5825bb40681b3 [2024-11-28 02:47:44,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:47:44,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:47:44,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:47:44,564 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:47:44,565 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:47:44,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-11-28 02:47:47,429 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/data/b6abf2f81/613b7011c5684dd894922a001d580692/FLAG0fea1986b [2024-11-28 02:47:47,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:47:47,761 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2024-11-28 02:47:47,773 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/data/b6abf2f81/613b7011c5684dd894922a001d580692/FLAG0fea1986b [2024-11-28 02:47:47,797 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/data/b6abf2f81/613b7011c5684dd894922a001d580692 [2024-11-28 02:47:47,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:47:47,803 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:47:47,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:47:47,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:47:47,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:47:47,812 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:47" (1/1) ... [2024-11-28 02:47:47,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68afbd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:47, skipping insertion in model container [2024-11-28 02:47:47,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:47:47" (1/1) ... [2024-11-28 02:47:47,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:47:48,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:47:48,082 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:47:48,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:47:48,160 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:47:48,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48 WrapperNode [2024-11-28 02:47:48,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:47:48,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:47:48,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:47:48,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:47:48,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,234 INFO L138 Inliner]: procedures = 25, calls = 31, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 378 [2024-11-28 02:47:48,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:47:48,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:47:48,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:47:48,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:47:48,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,257 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,260 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,285 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,287 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,295 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,298 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:47:48,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:47:48,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:47:48,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:47:48,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (1/1) ... [2024-11-28 02:47:48,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:47:48,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:47:48,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:47:48,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_377b73f8-17a3-4aa4-bd41-2869a8b44f22/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 02:47:48,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 02:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 02:47:48,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 02:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 02:47:48,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 02:47:48,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 02:47:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 02:47:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 02:47:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:47:48,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:47:48,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 02:47:48,370 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 02:47:48,482 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:47:48,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:47:49,276 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 02:47:49,279 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:47:49,308 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:47:49,308 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 02:47:49,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:49 BoogieIcfgContainer [2024-11-28 02:47:49,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:47:49,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:47:49,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:47:49,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:47:49,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:47:47" (1/3) ... [2024-11-28 02:47:49,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bdea59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:49, skipping insertion in model container [2024-11-28 02:47:49,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:47:48" (2/3) ... [2024-11-28 02:47:49,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50bdea59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:47:49, skipping insertion in model container [2024-11-28 02:47:49,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:47:49" (3/3) ... [2024-11-28 02:47:49,322 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2024-11-28 02:47:49,338 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:47:49,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-three-array-sum-alt.wvr.c that has 4 procedures, 490 locations, 1 initial locations, 6 loop locations, and 34 error locations. [2024-11-28 02:47:49,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 02:47:49,555 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 02:47:49,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 499 places, 518 transitions, 1057 flow [2024-11-28 02:47:49,876 INFO L124 PetriNetUnfolderBase]: 29/515 cut-off events. [2024-11-28 02:47:49,881 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 02:47:49,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 515 events. 29/515 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 867 event pairs, 0 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 339. Up to 2 conditions per place. [2024-11-28 02:47:49,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 499 places, 518 transitions, 1057 flow [2024-11-28 02:47:49,908 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 455 places, 471 transitions, 960 flow [2024-11-28 02:47:49,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:47:49,931 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@239a792f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:47:49,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2024-11-28 02:47:49,940 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 02:47:49,944 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-28 02:47:49,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 02:47:49,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:49,945 INFO L206 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, 1] [2024-11-28 02:47:49,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:49,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:49,953 INFO L85 PathProgramCache]: Analyzing trace with hash 722155782, now seen corresponding path program 1 times [2024-11-28 02:47:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:49,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326484946] [2024-11-28 02:47:49,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:49,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:50,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:50,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326484946] [2024-11-28 02:47:50,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326484946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746908471] [2024-11-28 02:47:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:50,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:50,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:50,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:50,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:50,271 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 475 out of 518 [2024-11-28 02:47:50,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 471 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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) [2024-11-28 02:47:50,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:50,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 475 of 518 [2024-11-28 02:47:50,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:50,653 INFO L124 PetriNetUnfolderBase]: 33/1039 cut-off events. [2024-11-28 02:47:50,655 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-28 02:47:50,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1039 events. 33/1039 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5173 event pairs, 15 based on Foata normal form. 37/937 useless extension candidates. Maximal degree in co-relation 824. Up to 55 conditions per place. [2024-11-28 02:47:50,672 INFO L140 encePairwiseOnDemand]: 495/518 looper letters, 15 selfloop transitions, 2 changer transitions 6/450 dead transitions. [2024-11-28 02:47:50,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 450 transitions, 952 flow [2024-11-28 02:47:50,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-11-28 02:47:50,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-11-28 02:47:50,700 INFO L175 Difference]: Start difference. First operand has 455 places, 471 transitions, 960 flow. Second operand 3 states and 1463 transitions. [2024-11-28 02:47:50,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 450 transitions, 952 flow [2024-11-28 02:47:50,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 450 transitions, 940 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 02:47:50,724 INFO L231 Difference]: Finished difference. Result has 450 places, 444 transitions, 898 flow [2024-11-28 02:47:50,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=450, PETRI_TRANSITIONS=444} [2024-11-28 02:47:50,731 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-28 02:47:50,731 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 444 transitions, 898 flow [2024-11-28 02:47:50,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 476.3333333333333) internal successors, (1429), 3 states have internal predecessors, (1429), 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) [2024-11-28 02:47:50,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:50,733 INFO L206 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, 1, 1, 1, 1, 1] [2024-11-28 02:47:50,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:47:50,733 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:50,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:50,734 INFO L85 PathProgramCache]: Analyzing trace with hash -757698670, now seen corresponding path program 1 times [2024-11-28 02:47:50,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:50,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819143637] [2024-11-28 02:47:50,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:50,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:50,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:50,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819143637] [2024-11-28 02:47:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819143637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:50,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:50,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:50,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144233136] [2024-11-28 02:47:50,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:50,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:50,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:50,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:50,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 469 out of 518 [2024-11-28 02:47:50,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 444 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 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) [2024-11-28 02:47:50,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:50,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 469 of 518 [2024-11-28 02:47:50,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:51,656 INFO L124 PetriNetUnfolderBase]: 100/2658 cut-off events. [2024-11-28 02:47:51,656 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-28 02:47:51,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 2658 events. 100/2658 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 19698 event pairs, 56 based on Foata normal form. 0/2318 useless extension candidates. Maximal degree in co-relation 2797. Up to 152 conditions per place. [2024-11-28 02:47:51,687 INFO L140 encePairwiseOnDemand]: 511/518 looper letters, 18 selfloop transitions, 1 changer transitions 0/438 dead transitions. [2024-11-28 02:47:51,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 438 transitions, 924 flow [2024-11-28 02:47:51,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1432 transitions. [2024-11-28 02:47:51,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9214929214929215 [2024-11-28 02:47:51,694 INFO L175 Difference]: Start difference. First operand has 450 places, 444 transitions, 898 flow. Second operand 3 states and 1432 transitions. [2024-11-28 02:47:51,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 438 transitions, 924 flow [2024-11-28 02:47:51,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 438 transitions, 920 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:47:51,704 INFO L231 Difference]: Finished difference. Result has 438 places, 438 transitions, 884 flow [2024-11-28 02:47:51,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=438, PETRI_TRANSITIONS=438} [2024-11-28 02:47:51,706 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-28 02:47:51,706 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 438 transitions, 884 flow [2024-11-28 02:47:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 470.0) internal successors, (1410), 3 states have internal predecessors, (1410), 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) [2024-11-28 02:47:51,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:51,707 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:47:51,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1707208194, now seen corresponding path program 1 times [2024-11-28 02:47:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43998465] [2024-11-28 02:47:51,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:51,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:51,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43998465] [2024-11-28 02:47:51,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43998465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:51,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:51,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:51,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722895418] [2024-11-28 02:47:51,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:51,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:51,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:51,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:51,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:51,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-28 02:47:51,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 438 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2024-11-28 02:47:51,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:51,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-28 02:47:51,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:52,048 INFO L124 PetriNetUnfolderBase]: 13/626 cut-off events. [2024-11-28 02:47:52,048 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 02:47:52,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 626 events. 13/626 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1667 event pairs, 5 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 626. Up to 22 conditions per place. [2024-11-28 02:47:52,055 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2024-11-28 02:47:52,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 437 transitions, 908 flow [2024-11-28 02:47:52,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:52,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-28 02:47:52,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-28 02:47:52,063 INFO L175 Difference]: Start difference. First operand has 438 places, 438 transitions, 884 flow. Second operand 3 states and 1451 transitions. [2024-11-28 02:47:52,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 437 transitions, 908 flow [2024-11-28 02:47:52,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 437 transitions, 907 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 02:47:52,071 INFO L231 Difference]: Finished difference. Result has 438 places, 437 transitions, 885 flow [2024-11-28 02:47:52,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=885, PETRI_PLACES=438, PETRI_TRANSITIONS=437} [2024-11-28 02:47:52,073 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-28 02:47:52,073 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 437 transitions, 885 flow [2024-11-28 02:47:52,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2024-11-28 02:47:52,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:52,074 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:52,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:47:52,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:52,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:52,075 INFO L85 PathProgramCache]: Analyzing trace with hash 138928877, now seen corresponding path program 1 times [2024-11-28 02:47:52,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:52,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773983160] [2024-11-28 02:47:52,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:52,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:52,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:52,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773983160] [2024-11-28 02:47:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773983160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:52,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:52,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:47:52,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521709527] [2024-11-28 02:47:52,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:52,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:47:52,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:52,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:47:52,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:47:53,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 518 [2024-11-28 02:47:53,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 437 transitions, 885 flow. Second operand has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 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) [2024-11-28 02:47:53,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:53,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 518 [2024-11-28 02:47:53,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:54,820 INFO L124 PetriNetUnfolderBase]: 1199/6232 cut-off events. [2024-11-28 02:47:54,820 INFO L125 PetriNetUnfolderBase]: For 203/203 co-relation queries the response was YES. [2024-11-28 02:47:54,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8055 conditions, 6232 events. 1199/6232 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 54440 event pairs, 864 based on Foata normal form. 0/5379 useless extension candidates. Maximal degree in co-relation 8024. Up to 1772 conditions per place. [2024-11-28 02:47:54,885 INFO L140 encePairwiseOnDemand]: 500/518 looper letters, 54 selfloop transitions, 15 changer transitions 0/434 dead transitions. [2024-11-28 02:47:54,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 434 transitions, 1017 flow [2024-11-28 02:47:54,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:47:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:47:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2604 transitions. [2024-11-28 02:47:54,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8378378378378378 [2024-11-28 02:47:54,894 INFO L175 Difference]: Start difference. First operand has 438 places, 437 transitions, 885 flow. Second operand 6 states and 2604 transitions. [2024-11-28 02:47:54,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 434 transitions, 1017 flow [2024-11-28 02:47:54,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 434 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:47:54,903 INFO L231 Difference]: Finished difference. Result has 438 places, 434 transitions, 905 flow [2024-11-28 02:47:54,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=905, PETRI_PLACES=438, PETRI_TRANSITIONS=434} [2024-11-28 02:47:54,904 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-28 02:47:54,905 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 434 transitions, 905 flow [2024-11-28 02:47:54,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 423.5) internal successors, (2541), 6 states have internal predecessors, (2541), 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) [2024-11-28 02:47:54,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:54,907 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:54,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:47:54,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:54,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:54,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1200916214, now seen corresponding path program 1 times [2024-11-28 02:47:54,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:54,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777865321] [2024-11-28 02:47:54,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:54,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:54,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:54,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777865321] [2024-11-28 02:47:54,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777865321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:54,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:54,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:54,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327098916] [2024-11-28 02:47:54,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:54,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:54,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:54,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:54,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:55,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-28 02:47:55,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 434 transitions, 905 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2024-11-28 02:47:55,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:55,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-28 02:47:55,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:55,223 INFO L124 PetriNetUnfolderBase]: 14/563 cut-off events. [2024-11-28 02:47:55,223 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-28 02:47:55,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 563 events. 14/563 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1309 event pairs, 7 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 580. Up to 25 conditions per place. [2024-11-28 02:47:55,229 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-11-28 02:47:55,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 433 transitions, 929 flow [2024-11-28 02:47:55,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:55,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-28 02:47:55,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-28 02:47:55,233 INFO L175 Difference]: Start difference. First operand has 438 places, 434 transitions, 905 flow. Second operand 3 states and 1451 transitions. [2024-11-28 02:47:55,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 433 transitions, 929 flow [2024-11-28 02:47:55,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 433 transitions, 899 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 02:47:55,240 INFO L231 Difference]: Finished difference. Result has 434 places, 433 transitions, 877 flow [2024-11-28 02:47:55,241 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=434, PETRI_TRANSITIONS=433} [2024-11-28 02:47:55,242 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-11-28 02:47:55,242 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 433 transitions, 877 flow [2024-11-28 02:47:55,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2024-11-28 02:47:55,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:55,243 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:55,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:47:55,244 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:55,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash -986070048, now seen corresponding path program 1 times [2024-11-28 02:47:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:55,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108170700] [2024-11-28 02:47:55,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:55,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:55,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108170700] [2024-11-28 02:47:55,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108170700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:55,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:55,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891766496] [2024-11-28 02:47:55,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:55,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:55,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:55,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:55,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 479 out of 518 [2024-11-28 02:47:55,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 433 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2024-11-28 02:47:55,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:55,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 479 of 518 [2024-11-28 02:47:55,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:55,475 INFO L124 PetriNetUnfolderBase]: 10/440 cut-off events. [2024-11-28 02:47:55,475 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 02:47:55,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 440 events. 10/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 801 event pairs, 4 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 438. Up to 20 conditions per place. [2024-11-28 02:47:55,480 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 11 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-11-28 02:47:55,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 432 transitions, 901 flow [2024-11-28 02:47:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:55,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1451 transitions. [2024-11-28 02:47:55,485 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9337194337194337 [2024-11-28 02:47:55,485 INFO L175 Difference]: Start difference. First operand has 434 places, 433 transitions, 877 flow. Second operand 3 states and 1451 transitions. [2024-11-28 02:47:55,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 432 transitions, 901 flow [2024-11-28 02:47:55,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 432 transitions, 897 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:47:55,495 INFO L231 Difference]: Finished difference. Result has 433 places, 432 transitions, 875 flow [2024-11-28 02:47:55,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=433, PETRI_TRANSITIONS=432} [2024-11-28 02:47:55,499 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -22 predicate places. [2024-11-28 02:47:55,499 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 432 transitions, 875 flow [2024-11-28 02:47:55,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 480.3333333333333) internal successors, (1441), 3 states have internal predecessors, (1441), 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) [2024-11-28 02:47:55,501 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:55,501 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:55,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:47:55,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:55,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:55,502 INFO L85 PathProgramCache]: Analyzing trace with hash -2124731022, now seen corresponding path program 1 times [2024-11-28 02:47:55,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:55,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181290659] [2024-11-28 02:47:55,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:55,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:55,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:55,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:55,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181290659] [2024-11-28 02:47:55,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181290659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:55,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:55,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:55,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107617279] [2024-11-28 02:47:55,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:55,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:55,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:55,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:55,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:55,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:47:55,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 432 transitions, 875 flow. Second operand has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 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) [2024-11-28 02:47:55,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:55,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:47:55,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:55,755 INFO L124 PetriNetUnfolderBase]: 15/547 cut-off events. [2024-11-28 02:47:55,755 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 02:47:55,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 547 events. 15/547 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1397 event pairs, 2 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 557. Up to 14 conditions per place. [2024-11-28 02:47:55,761 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 10 selfloop transitions, 3 changer transitions 0/432 dead transitions. [2024-11-28 02:47:55,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 432 transitions, 903 flow [2024-11-28 02:47:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:55,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:55,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1458 transitions. [2024-11-28 02:47:55,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9382239382239382 [2024-11-28 02:47:55,765 INFO L175 Difference]: Start difference. First operand has 433 places, 432 transitions, 875 flow. Second operand 3 states and 1458 transitions. [2024-11-28 02:47:55,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 432 transitions, 903 flow [2024-11-28 02:47:55,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 432 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:47:55,776 INFO L231 Difference]: Finished difference. Result has 431 places, 430 transitions, 873 flow [2024-11-28 02:47:55,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=873, PETRI_PLACES=431, PETRI_TRANSITIONS=430} [2024-11-28 02:47:55,779 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -24 predicate places. [2024-11-28 02:47:55,779 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 430 transitions, 873 flow [2024-11-28 02:47:55,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.0) internal successors, (1446), 3 states have internal predecessors, (1446), 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) [2024-11-28 02:47:55,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:55,780 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:55,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:47:55,781 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:55,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:55,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1757007916, now seen corresponding path program 1 times [2024-11-28 02:47:55,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:55,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318145996] [2024-11-28 02:47:55,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:55,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:55,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318145996] [2024-11-28 02:47:55,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318145996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:55,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838031013] [2024-11-28 02:47:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:55,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:55,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:55,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:55,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:55,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:47:55,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 430 transitions, 873 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2024-11-28 02:47:55,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:55,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:47:55,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:56,150 INFO L124 PetriNetUnfolderBase]: 31/1093 cut-off events. [2024-11-28 02:47:56,150 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-28 02:47:56,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 1093 events. 31/1093 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4661 event pairs, 2 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1137. Up to 46 conditions per place. [2024-11-28 02:47:56,161 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 16 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-11-28 02:47:56,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 435 transitions, 924 flow [2024-11-28 02:47:56,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1463 transitions. [2024-11-28 02:47:56,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9414414414414415 [2024-11-28 02:47:56,165 INFO L175 Difference]: Start difference. First operand has 431 places, 430 transitions, 873 flow. Second operand 3 states and 1463 transitions. [2024-11-28 02:47:56,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 435 transitions, 924 flow [2024-11-28 02:47:56,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 435 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:47:56,174 INFO L231 Difference]: Finished difference. Result has 430 places, 430 transitions, 877 flow [2024-11-28 02:47:56,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=877, PETRI_PLACES=430, PETRI_TRANSITIONS=430} [2024-11-28 02:47:56,176 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-11-28 02:47:56,178 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 430 transitions, 877 flow [2024-11-28 02:47:56,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2024-11-28 02:47:56,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:56,180 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:56,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:47:56,180 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:56,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:56,181 INFO L85 PathProgramCache]: Analyzing trace with hash -403148282, now seen corresponding path program 1 times [2024-11-28 02:47:56,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:56,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859712429] [2024-11-28 02:47:56,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:56,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859712429] [2024-11-28 02:47:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859712429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334080473] [2024-11-28 02:47:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:56,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:56,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:56,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:56,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:47:56,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 430 transitions, 877 flow. Second operand has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2024-11-28 02:47:56,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:56,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:47:56,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:56,444 INFO L124 PetriNetUnfolderBase]: 25/750 cut-off events. [2024-11-28 02:47:56,444 INFO L125 PetriNetUnfolderBase]: For 12/33 co-relation queries the response was YES. [2024-11-28 02:47:56,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 750 events. 25/750 cut-off events. For 12/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2536 event pairs, 3 based on Foata normal form. 4/686 useless extension candidates. Maximal degree in co-relation 778. Up to 21 conditions per place. [2024-11-28 02:47:56,454 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 9 selfloop transitions, 2 changer transitions 4/430 dead transitions. [2024-11-28 02:47:56,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 430 transitions, 903 flow [2024-11-28 02:47:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-11-28 02:47:56,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-11-28 02:47:56,459 INFO L175 Difference]: Start difference. First operand has 430 places, 430 transitions, 877 flow. Second operand 3 states and 1457 transitions. [2024-11-28 02:47:56,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 430 transitions, 903 flow [2024-11-28 02:47:56,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 430 transitions, 903 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:47:56,506 INFO L231 Difference]: Finished difference. Result has 430 places, 424 transitions, 869 flow [2024-11-28 02:47:56,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=873, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=430, PETRI_TRANSITIONS=424} [2024-11-28 02:47:56,508 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -25 predicate places. [2024-11-28 02:47:56,508 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 424 transitions, 869 flow [2024-11-28 02:47:56,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.3333333333333) internal successors, (1447), 3 states have internal predecessors, (1447), 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) [2024-11-28 02:47:56,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:56,510 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:56,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:47:56,510 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:56,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:56,511 INFO L85 PathProgramCache]: Analyzing trace with hash -878401784, now seen corresponding path program 1 times [2024-11-28 02:47:56,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:56,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102135965] [2024-11-28 02:47:56,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:56,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102135965] [2024-11-28 02:47:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102135965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:56,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:56,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:56,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137451323] [2024-11-28 02:47:56,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:56,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:56,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:56,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:56,590 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:47:56,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 424 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2024-11-28 02:47:56,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:56,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:47:56,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:56,946 INFO L124 PetriNetUnfolderBase]: 73/1869 cut-off events. [2024-11-28 02:47:56,946 INFO L125 PetriNetUnfolderBase]: For 25/29 co-relation queries the response was YES. [2024-11-28 02:47:56,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1869 events. 73/1869 cut-off events. For 25/29 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 11439 event pairs, 6 based on Foata normal form. 0/1674 useless extension candidates. Maximal degree in co-relation 1989. Up to 93 conditions per place. [2024-11-28 02:47:56,963 INFO L140 encePairwiseOnDemand]: 514/518 looper letters, 15 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-11-28 02:47:56,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 915 flow [2024-11-28 02:47:56,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:56,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1462 transitions. [2024-11-28 02:47:56,967 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9407979407979408 [2024-11-28 02:47:56,967 INFO L175 Difference]: Start difference. First operand has 430 places, 424 transitions, 869 flow. Second operand 3 states and 1462 transitions. [2024-11-28 02:47:56,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 915 flow [2024-11-28 02:47:56,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:47:56,974 INFO L231 Difference]: Finished difference. Result has 425 places, 424 transitions, 875 flow [2024-11-28 02:47:56,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=875, PETRI_PLACES=425, PETRI_TRANSITIONS=424} [2024-11-28 02:47:56,975 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -30 predicate places. [2024-11-28 02:47:56,975 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 424 transitions, 875 flow [2024-11-28 02:47:56,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2024-11-28 02:47:56,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:56,976 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:56,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:47:56,977 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:56,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash -201694568, now seen corresponding path program 1 times [2024-11-28 02:47:56,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:56,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86559397] [2024-11-28 02:47:56,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:57,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:57,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86559397] [2024-11-28 02:47:57,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86559397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:57,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:57,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:47:57,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267227267] [2024-11-28 02:47:57,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:57,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:57,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:57,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:57,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:57,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-28 02:47:57,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 424 transitions, 875 flow. Second operand has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 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) [2024-11-28 02:47:57,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:57,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-28 02:47:57,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:58,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 82#L88true]) [2024-11-28 02:47:58,175 INFO L294 olderBase$Statistics]: this new event has 404 ancestors and is cut-off event [2024-11-28 02:47:58,175 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-28 02:47:58,175 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-28 02:47:58,175 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is cut-off event [2024-11-28 02:47:58,180 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1415] thread3EXIT-->L88: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][413], [537#true, Black: 526#true, 507#(= |#race~N~0| 0), 535#(= |#race~B~0| 0), Black: 533#true, 528#(= |#race~A~0| 0), 82#L88true]) [2024-11-28 02:47:58,180 INFO L294 olderBase$Statistics]: this new event has 308 ancestors and is not cut-off event [2024-11-28 02:47:58,180 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2024-11-28 02:47:58,180 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-28 02:47:58,180 INFO L297 olderBase$Statistics]: existing Event has 404 ancestors and is not cut-off event [2024-11-28 02:47:58,180 INFO L297 olderBase$Statistics]: existing Event has 359 ancestors and is not cut-off event [2024-11-28 02:47:58,205 INFO L124 PetriNetUnfolderBase]: 60/2025 cut-off events. [2024-11-28 02:47:58,205 INFO L125 PetriNetUnfolderBase]: For 13/62 co-relation queries the response was YES. [2024-11-28 02:47:58,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2268 conditions, 2025 events. 60/2025 cut-off events. For 13/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10786 event pairs, 14 based on Foata normal form. 4/1859 useless extension candidates. Maximal degree in co-relation 2234. Up to 68 conditions per place. [2024-11-28 02:47:58,223 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/467 dead transitions. [2024-11-28 02:47:58,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 467 transitions, 1133 flow [2024-11-28 02:47:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:47:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 02:47:58,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-28 02:47:58,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-28 02:47:58,239 INFO L175 Difference]: Start difference. First operand has 425 places, 424 transitions, 875 flow. Second operand 10 states and 4633 transitions. [2024-11-28 02:47:58,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 467 transitions, 1133 flow [2024-11-28 02:47:58,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 467 transitions, 1133 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:47:58,246 INFO L231 Difference]: Finished difference. Result has 438 places, 449 transitions, 1067 flow [2024-11-28 02:47:58,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1067, PETRI_PLACES=438, PETRI_TRANSITIONS=449} [2024-11-28 02:47:58,248 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -17 predicate places. [2024-11-28 02:47:58,249 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 449 transitions, 1067 flow [2024-11-28 02:47:58,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.14285714285717) internal successors, (3214), 7 states have internal predecessors, (3214), 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) [2024-11-28 02:47:58,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:58,251 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:58,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:47:58,251 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:58,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -579279945, now seen corresponding path program 1 times [2024-11-28 02:47:58,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:58,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385371298] [2024-11-28 02:47:58,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:58,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385371298] [2024-11-28 02:47:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385371298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:47:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350477659] [2024-11-28 02:47:58,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:58,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:47:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:58,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:47:58,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:47:58,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:47:58,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 449 transitions, 1067 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2024-11-28 02:47:58,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:58,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:47:58,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:58,752 INFO L124 PetriNetUnfolderBase]: 102/2072 cut-off events. [2024-11-28 02:47:58,752 INFO L125 PetriNetUnfolderBase]: For 80/90 co-relation queries the response was YES. [2024-11-28 02:47:58,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 2072 events. 102/2072 cut-off events. For 80/90 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 11438 event pairs, 2 based on Foata normal form. 0/1906 useless extension candidates. Maximal degree in co-relation 2365. Up to 124 conditions per place. [2024-11-28 02:47:58,772 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 14 selfloop transitions, 1 changer transitions 0/451 dead transitions. [2024-11-28 02:47:58,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 451 transitions, 1104 flow [2024-11-28 02:47:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:47:58,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:47:58,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1460 transitions. [2024-11-28 02:47:58,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9395109395109396 [2024-11-28 02:47:58,776 INFO L175 Difference]: Start difference. First operand has 438 places, 449 transitions, 1067 flow. Second operand 3 states and 1460 transitions. [2024-11-28 02:47:58,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 451 transitions, 1104 flow [2024-11-28 02:47:58,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 451 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:47:58,787 INFO L231 Difference]: Finished difference. Result has 439 places, 448 transitions, 1070 flow [2024-11-28 02:47:58,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1063, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=446, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1070, PETRI_PLACES=439, PETRI_TRANSITIONS=448} [2024-11-28 02:47:58,790 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -16 predicate places. [2024-11-28 02:47:58,791 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 448 transitions, 1070 flow [2024-11-28 02:47:58,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2024-11-28 02:47:58,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:58,792 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:58,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:47:58,792 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:58,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:58,793 INFO L85 PathProgramCache]: Analyzing trace with hash 431456684, now seen corresponding path program 1 times [2024-11-28 02:47:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:58,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291034325] [2024-11-28 02:47:58,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:47:59,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:47:59,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:47:59,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291034325] [2024-11-28 02:47:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291034325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:47:59,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:47:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:47:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052190996] [2024-11-28 02:47:59,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:47:59,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:47:59,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:47:59,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:47:59,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:47:59,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-28 02:47:59,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 448 transitions, 1070 flow. Second operand has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 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) [2024-11-28 02:47:59,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:47:59,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-28 02:47:59,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:47:59,790 INFO L124 PetriNetUnfolderBase]: 73/1499 cut-off events. [2024-11-28 02:47:59,790 INFO L125 PetriNetUnfolderBase]: For 103/173 co-relation queries the response was YES. [2024-11-28 02:47:59,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1499 events. 73/1499 cut-off events. For 103/173 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7126 event pairs, 28 based on Foata normal form. 4/1396 useless extension candidates. Maximal degree in co-relation 1803. Up to 99 conditions per place. [2024-11-28 02:47:59,806 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/468 dead transitions. [2024-11-28 02:47:59,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 468 transitions, 1302 flow [2024-11-28 02:47:59,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:47:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 02:47:59,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-28 02:47:59,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-28 02:47:59,816 INFO L175 Difference]: Start difference. First operand has 439 places, 448 transitions, 1070 flow. Second operand 10 states and 4633 transitions. [2024-11-28 02:47:59,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 468 transitions, 1302 flow [2024-11-28 02:47:59,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 468 transitions, 1302 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:47:59,827 INFO L231 Difference]: Finished difference. Result has 450 places, 450 transitions, 1175 flow [2024-11-28 02:47:59,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1175, PETRI_PLACES=450, PETRI_TRANSITIONS=450} [2024-11-28 02:47:59,828 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-28 02:47:59,829 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 450 transitions, 1175 flow [2024-11-28 02:47:59,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.2857142857143) internal successors, (3215), 7 states have internal predecessors, (3215), 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) [2024-11-28 02:47:59,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:47:59,831 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:47:59,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:47:59,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:47:59,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:47:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash 245063901, now seen corresponding path program 1 times [2024-11-28 02:47:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:47:59,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701191144] [2024-11-28 02:47:59,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:47:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:47:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:00,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:00,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701191144] [2024-11-28 02:48:00,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701191144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:00,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:00,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 02:48:00,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506266930] [2024-11-28 02:48:00,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:00,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:48:00,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:00,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:48:00,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:48:00,558 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 518 [2024-11-28 02:48:00,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 450 transitions, 1175 flow. Second operand has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 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) [2024-11-28 02:48:00,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:00,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 518 [2024-11-28 02:48:00,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:01,011 INFO L124 PetriNetUnfolderBase]: 72/1494 cut-off events. [2024-11-28 02:48:01,012 INFO L125 PetriNetUnfolderBase]: For 169/176 co-relation queries the response was YES. [2024-11-28 02:48:01,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1494 events. 72/1494 cut-off events. For 169/176 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 6884 event pairs, 29 based on Foata normal form. 3/1400 useless extension candidates. Maximal degree in co-relation 1837. Up to 98 conditions per place. [2024-11-28 02:48:01,025 INFO L140 encePairwiseOnDemand]: 489/518 looper letters, 40 selfloop transitions, 42 changer transitions 0/470 dead transitions. [2024-11-28 02:48:01,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 470 transitions, 1407 flow [2024-11-28 02:48:01,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 02:48:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 02:48:01,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4633 transitions. [2024-11-28 02:48:01,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944015444015444 [2024-11-28 02:48:01,034 INFO L175 Difference]: Start difference. First operand has 450 places, 450 transitions, 1175 flow. Second operand 10 states and 4633 transitions. [2024-11-28 02:48:01,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 470 transitions, 1407 flow [2024-11-28 02:48:01,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 470 transitions, 1334 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 02:48:01,043 INFO L231 Difference]: Finished difference. Result has 454 places, 452 transitions, 1207 flow [2024-11-28 02:48:01,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1102, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1207, PETRI_PLACES=454, PETRI_TRANSITIONS=452} [2024-11-28 02:48:01,046 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -1 predicate places. [2024-11-28 02:48:01,046 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 452 transitions, 1207 flow [2024-11-28 02:48:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 459.42857142857144) internal successors, (3216), 7 states have internal predecessors, (3216), 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) [2024-11-28 02:48:01,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:01,048 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:48:01,049 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:01,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:01,051 INFO L85 PathProgramCache]: Analyzing trace with hash -154705820, now seen corresponding path program 1 times [2024-11-28 02:48:01,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:01,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689797101] [2024-11-28 02:48:01,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:01,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:48:01,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:01,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689797101] [2024-11-28 02:48:01,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689797101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:01,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:01,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:48:01,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844329271] [2024-11-28 02:48:01,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:01,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:48:01,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:01,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:48:01,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:48:01,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:48:01,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 452 transitions, 1207 flow. Second operand has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 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) [2024-11-28 02:48:01,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:01,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:48:01,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:01,382 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1357] L68-->L68-1: Formula: (= |v_#race~csum~0_4| 0) InVars {} OutVars{#race~csum~0=|v_#race~csum~0_4|} AuxVars[] AssignedVars[#race~csum~0][403], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 299#L68-1true, 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 602#(= |#race~csum~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 581#true, 562#true, 279#L87true]) [2024-11-28 02:48:01,382 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-11-28 02:48:01,382 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-11-28 02:48:01,382 INFO L297 olderBase$Statistics]: existing Event has 311 ancestors and is cut-off event [2024-11-28 02:48:01,382 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-11-28 02:48:01,401 INFO L124 PetriNetUnfolderBase]: 48/1185 cut-off events. [2024-11-28 02:48:01,401 INFO L125 PetriNetUnfolderBase]: For 94/98 co-relation queries the response was YES. [2024-11-28 02:48:01,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 1185 events. 48/1185 cut-off events. For 94/98 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4437 event pairs, 3 based on Foata normal form. 6/1127 useless extension candidates. Maximal degree in co-relation 1423. Up to 37 conditions per place. [2024-11-28 02:48:01,411 INFO L140 encePairwiseOnDemand]: 513/518 looper letters, 8 selfloop transitions, 2 changer transitions 28/452 dead transitions. [2024-11-28 02:48:01,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 452 transitions, 1233 flow [2024-11-28 02:48:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:48:01,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:48:01,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1457 transitions. [2024-11-28 02:48:01,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375804375804376 [2024-11-28 02:48:01,415 INFO L175 Difference]: Start difference. First operand has 454 places, 452 transitions, 1207 flow. Second operand 3 states and 1457 transitions. [2024-11-28 02:48:01,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 452 transitions, 1233 flow [2024-11-28 02:48:01,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 452 transitions, 1160 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 02:48:01,424 INFO L231 Difference]: Finished difference. Result has 447 places, 422 transitions, 975 flow [2024-11-28 02:48:01,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=975, PETRI_PLACES=447, PETRI_TRANSITIONS=422} [2024-11-28 02:48:01,425 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-11-28 02:48:01,425 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 422 transitions, 975 flow [2024-11-28 02:48:01,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.6666666666667) internal successors, (1451), 3 states have internal predecessors, (1451), 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) [2024-11-28 02:48:01,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:01,426 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:01,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 02:48:01,427 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:01,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1338601851, now seen corresponding path program 1 times [2024-11-28 02:48:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234726644] [2024-11-28 02:48:01,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:01,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:48:02,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:02,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234726644] [2024-11-28 02:48:02,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234726644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:02,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:02,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:48:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157116086] [2024-11-28 02:48:02,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:02,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:48:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:02,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:48:02,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:48:02,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-28 02:48:02,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 422 transitions, 975 flow. Second operand has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 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) [2024-11-28 02:48:02,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:02,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-28 02:48:02,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:03,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 542#(<= ~N~0 0), Black: 558#true, Black: 526#true, 124#L67-26true, 603#true, Black: 586#(<= ~N~0 0), 507#(= |#race~N~0| 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 528#(= |#race~A~0| 0), Black: 533#true, 562#true, 279#L87true]) [2024-11-28 02:48:03,319 INFO L294 olderBase$Statistics]: this new event has 347 ancestors and is cut-off event [2024-11-28 02:48:03,319 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:03,319 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-28 02:48:03,319 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:03,599 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [560#(= |#race~C~0| 0), Black: 568#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), Black: 567#(<= ~N~0 0), 535#(= |#race~B~0| 0), Black: 543#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 549#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~N~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 600#true, Black: 542#(<= ~N~0 0), Black: 526#true, Black: 558#true, 124#L67-26true, 603#true, Black: 586#(<= ~N~0 0), Black: 587#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), 507#(= |#race~N~0| 0), Black: 533#true, 528#(= |#race~A~0| 0), 562#true, 279#L87true]) [2024-11-28 02:48:03,599 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-28 02:48:03,599 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:03,599 INFO L297 olderBase$Statistics]: existing Event has 347 ancestors and is cut-off event [2024-11-28 02:48:03,599 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-28 02:48:03,599 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:03,615 INFO L124 PetriNetUnfolderBase]: 203/3554 cut-off events. [2024-11-28 02:48:03,615 INFO L125 PetriNetUnfolderBase]: For 56/77 co-relation queries the response was YES. [2024-11-28 02:48:03,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4247 conditions, 3554 events. 203/3554 cut-off events. For 56/77 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 25945 event pairs, 44 based on Foata normal form. 4/3276 useless extension candidates. Maximal degree in co-relation 4196. Up to 292 conditions per place. [2024-11-28 02:48:03,650 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 39 selfloop transitions, 22 changer transitions 0/451 dead transitions. [2024-11-28 02:48:03,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 451 transitions, 1163 flow [2024-11-28 02:48:03,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:48:03,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:48:03,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-11-28 02:48:03,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-28 02:48:03,657 INFO L175 Difference]: Start difference. First operand has 447 places, 422 transitions, 975 flow. Second operand 6 states and 2828 transitions. [2024-11-28 02:48:03,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 451 transitions, 1163 flow [2024-11-28 02:48:03,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 451 transitions, 1087 flow, removed 14 selfloop flow, removed 15 redundant places. [2024-11-28 02:48:03,669 INFO L231 Difference]: Finished difference. Result has 434 places, 443 transitions, 1049 flow [2024-11-28 02:48:03,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1049, PETRI_PLACES=434, PETRI_TRANSITIONS=443} [2024-11-28 02:48:03,670 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -21 predicate places. [2024-11-28 02:48:03,670 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 443 transitions, 1049 flow [2024-11-28 02:48:03,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.5) internal successors, (2787), 6 states have internal predecessors, (2787), 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) [2024-11-28 02:48:03,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:03,672 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:03,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 02:48:03,672 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:03,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:03,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1577863129, now seen corresponding path program 1 times [2024-11-28 02:48:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:03,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565517908] [2024-11-28 02:48:03,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:03,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:48:04,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565517908] [2024-11-28 02:48:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565517908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:04,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:04,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:48:04,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288766359] [2024-11-28 02:48:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:04,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:48:04,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:04,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:48:04,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:48:04,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-28 02:48:04,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 443 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 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) [2024-11-28 02:48:04,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:04,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-28 02:48:04,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:06,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-1-->L59-2: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][286], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 560#(= |#race~C~0| 0), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 305#L86-1true, Black: 558#true, Black: 526#true, 427#L67-10true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 204#L59-2true]) [2024-11-28 02:48:06,600 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-28 02:48:06,600 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-28 02:48:06,600 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-28 02:48:06,601 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-28 02:48:07,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 305#L86-1true, Black: 526#true, Black: 558#true, 147#L62true, 124#L67-26true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true]) [2024-11-28 02:48:07,286 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-11-28 02:48:07,286 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-11-28 02:48:07,286 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-28 02:48:07,286 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-28 02:48:07,319 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][371], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 558#true, Black: 526#true, 124#L67-26true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 279#L87true]) [2024-11-28 02:48:07,319 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-28 02:48:07,319 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:07,319 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-28 02:48:07,319 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:07,464 INFO L124 PetriNetUnfolderBase]: 1328/14868 cut-off events. [2024-11-28 02:48:07,464 INFO L125 PetriNetUnfolderBase]: For 1651/1733 co-relation queries the response was YES. [2024-11-28 02:48:07,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18895 conditions, 14868 events. 1328/14868 cut-off events. For 1651/1733 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 172123 event pairs, 205 based on Foata normal form. 0/13463 useless extension candidates. Maximal degree in co-relation 18855. Up to 1392 conditions per place. [2024-11-28 02:48:07,545 INFO L140 encePairwiseOnDemand]: 507/518 looper letters, 55 selfloop transitions, 86 changer transitions 0/536 dead transitions. [2024-11-28 02:48:07,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 536 transitions, 1813 flow [2024-11-28 02:48:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:48:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:48:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2828 transitions. [2024-11-28 02:48:07,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9099099099099099 [2024-11-28 02:48:07,549 INFO L175 Difference]: Start difference. First operand has 434 places, 443 transitions, 1049 flow. Second operand 6 states and 2828 transitions. [2024-11-28 02:48:07,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 536 transitions, 1813 flow [2024-11-28 02:48:07,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 536 transitions, 1813 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:48:07,567 INFO L231 Difference]: Finished difference. Result has 444 places, 528 transitions, 1903 flow [2024-11-28 02:48:07,569 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1903, PETRI_PLACES=444, PETRI_TRANSITIONS=528} [2024-11-28 02:48:07,569 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -11 predicate places. [2024-11-28 02:48:07,570 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 528 transitions, 1903 flow [2024-11-28 02:48:07,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.6666666666667) internal successors, (2788), 6 states have internal predecessors, (2788), 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) [2024-11-28 02:48:07,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:07,572 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 02:48:07,572 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:07,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:07,573 INFO L85 PathProgramCache]: Analyzing trace with hash 574361930, now seen corresponding path program 1 times [2024-11-28 02:48:07,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:07,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732427374] [2024-11-28 02:48:07,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:07,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:08,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:48:08,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:08,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732427374] [2024-11-28 02:48:08,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732427374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:08,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:08,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:48:08,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666089910] [2024-11-28 02:48:08,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:08,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:48:08,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:08,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:48:08,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:48:08,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-28 02:48:08,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 528 transitions, 1903 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2024-11-28 02:48:08,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:08,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-28 02:48:08,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:11,262 INFO L124 PetriNetUnfolderBase]: 1151/12311 cut-off events. [2024-11-28 02:48:11,263 INFO L125 PetriNetUnfolderBase]: For 3738/3848 co-relation queries the response was YES. [2024-11-28 02:48:11,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17463 conditions, 12311 events. 1151/12311 cut-off events. For 3738/3848 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 136409 event pairs, 132 based on Foata normal form. 0/11311 useless extension candidates. Maximal degree in co-relation 17418. Up to 1063 conditions per place. [2024-11-28 02:48:11,338 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/535 dead transitions. [2024-11-28 02:48:11,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 535 transitions, 2195 flow [2024-11-28 02:48:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:48:11,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:48:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-11-28 02:48:11,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-11-28 02:48:11,343 INFO L175 Difference]: Start difference. First operand has 444 places, 528 transitions, 1903 flow. Second operand 6 states and 2806 transitions. [2024-11-28 02:48:11,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 535 transitions, 2195 flow [2024-11-28 02:48:11,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 535 transitions, 2195 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 02:48:11,357 INFO L231 Difference]: Finished difference. Result has 448 places, 527 transitions, 1959 flow [2024-11-28 02:48:11,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1959, PETRI_PLACES=448, PETRI_TRANSITIONS=527} [2024-11-28 02:48:11,358 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -7 predicate places. [2024-11-28 02:48:11,359 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 527 transitions, 1959 flow [2024-11-28 02:48:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2024-11-28 02:48:11,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:11,360 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:11,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 02:48:11,360 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:11,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:11,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1016688752, now seen corresponding path program 1 times [2024-11-28 02:48:11,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:11,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887475007] [2024-11-28 02:48:11,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:11,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:48:12,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887475007] [2024-11-28 02:48:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887475007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:12,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:48:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47326745] [2024-11-28 02:48:12,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:12,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:48:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:12,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:48:12,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:48:12,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 518 [2024-11-28 02:48:12,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 527 transitions, 1959 flow. Second operand has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2024-11-28 02:48:12,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:12,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 518 [2024-11-28 02:48:12,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:14,988 INFO L124 PetriNetUnfolderBase]: 1146/12228 cut-off events. [2024-11-28 02:48:14,988 INFO L125 PetriNetUnfolderBase]: For 4429/4539 co-relation queries the response was YES. [2024-11-28 02:48:15,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17858 conditions, 12228 events. 1146/12228 cut-off events. For 4429/4539 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 135228 event pairs, 132 based on Foata normal form. 0/11295 useless extension candidates. Maximal degree in co-relation 17812. Up to 1063 conditions per place. [2024-11-28 02:48:15,057 INFO L140 encePairwiseOnDemand]: 512/518 looper letters, 106 selfloop transitions, 29 changer transitions 0/534 dead transitions. [2024-11-28 02:48:15,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 534 transitions, 2251 flow [2024-11-28 02:48:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:48:15,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:48:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2806 transitions. [2024-11-28 02:48:15,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9028314028314028 [2024-11-28 02:48:15,064 INFO L175 Difference]: Start difference. First operand has 448 places, 527 transitions, 1959 flow. Second operand 6 states and 2806 transitions. [2024-11-28 02:48:15,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 534 transitions, 2251 flow [2024-11-28 02:48:15,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 534 transitions, 2193 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 02:48:15,085 INFO L231 Difference]: Finished difference. Result has 447 places, 526 transitions, 1957 flow [2024-11-28 02:48:15,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1957, PETRI_PLACES=447, PETRI_TRANSITIONS=526} [2024-11-28 02:48:15,086 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -8 predicate places. [2024-11-28 02:48:15,086 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 526 transitions, 1957 flow [2024-11-28 02:48:15,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 464.8333333333333) internal successors, (2789), 6 states have internal predecessors, (2789), 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) [2024-11-28 02:48:15,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:15,087 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:15,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 02:48:15,088 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:15,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1153265611, now seen corresponding path program 1 times [2024-11-28 02:48:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:15,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276666504] [2024-11-28 02:48:15,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:15,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:48:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:15,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276666504] [2024-11-28 02:48:15,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276666504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:15,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:15,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:48:15,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389437727] [2024-11-28 02:48:15,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:15,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:48:15,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:15,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:48:15,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:48:15,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:48:15,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 526 transitions, 1957 flow. Second operand has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2024-11-28 02:48:15,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:15,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:48:15,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:17,480 INFO L124 PetriNetUnfolderBase]: 884/10875 cut-off events. [2024-11-28 02:48:17,480 INFO L125 PetriNetUnfolderBase]: For 2295/2403 co-relation queries the response was YES. [2024-11-28 02:48:17,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14887 conditions, 10875 events. 884/10875 cut-off events. For 2295/2403 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 115985 event pairs, 71 based on Foata normal form. 1/10088 useless extension candidates. Maximal degree in co-relation 14842. Up to 727 conditions per place. [2024-11-28 02:48:17,547 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-11-28 02:48:17,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 527 transitions, 1985 flow [2024-11-28 02:48:17,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:48:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:48:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-11-28 02:48:17,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-28 02:48:17,550 INFO L175 Difference]: Start difference. First operand has 447 places, 526 transitions, 1957 flow. Second operand 3 states and 1456 transitions. [2024-11-28 02:48:17,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 527 transitions, 1985 flow [2024-11-28 02:48:17,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 527 transitions, 1927 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 02:48:17,566 INFO L231 Difference]: Finished difference. Result has 443 places, 525 transitions, 1901 flow [2024-11-28 02:48:17,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=443, PETRI_TRANSITIONS=525} [2024-11-28 02:48:17,568 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -12 predicate places. [2024-11-28 02:48:17,568 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 525 transitions, 1901 flow [2024-11-28 02:48:17,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 482.6666666666667) internal successors, (1448), 3 states have internal predecessors, (1448), 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) [2024-11-28 02:48:17,569 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:17,569 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:17,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 02:48:17,570 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:17,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -393266263, now seen corresponding path program 1 times [2024-11-28 02:48:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:17,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181465072] [2024-11-28 02:48:17,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:17,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:17,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 02:48:17,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:17,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181465072] [2024-11-28 02:48:17,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181465072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:17,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:17,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:48:17,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065923925] [2024-11-28 02:48:17,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:17,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:48:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:17,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:48:17,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:48:17,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 481 out of 518 [2024-11-28 02:48:17,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 525 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2024-11-28 02:48:17,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:17,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 481 of 518 [2024-11-28 02:48:17,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:19,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-1-->L59-2: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][278], [Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 560#(= |#race~C~0| 0), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 640#true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), 305#L86-1true, Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, Black: 526#true, 427#L67-10true, 637#true, 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 204#L59-2true]) [2024-11-28 02:48:19,735 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-28 02:48:19,736 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-28 02:48:19,736 INFO L297 olderBase$Statistics]: existing Event has 224 ancestors and is cut-off event [2024-11-28 02:48:19,736 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-28 02:48:19,990 INFO L124 PetriNetUnfolderBase]: 997/11923 cut-off events. [2024-11-28 02:48:19,990 INFO L125 PetriNetUnfolderBase]: For 1879/1980 co-relation queries the response was YES. [2024-11-28 02:48:20,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15866 conditions, 11923 events. 997/11923 cut-off events. For 1879/1980 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 131720 event pairs, 90 based on Foata normal form. 0/11080 useless extension candidates. Maximal degree in co-relation 15821. Up to 781 conditions per place. [2024-11-28 02:48:20,062 INFO L140 encePairwiseOnDemand]: 515/518 looper letters, 10 selfloop transitions, 2 changer transitions 0/526 dead transitions. [2024-11-28 02:48:20,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 526 transitions, 1929 flow [2024-11-28 02:48:20,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:48:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 02:48:20,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1456 transitions. [2024-11-28 02:48:20,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9369369369369369 [2024-11-28 02:48:20,067 INFO L175 Difference]: Start difference. First operand has 443 places, 525 transitions, 1901 flow. Second operand 3 states and 1456 transitions. [2024-11-28 02:48:20,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 526 transitions, 1929 flow [2024-11-28 02:48:20,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 526 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:48:20,083 INFO L231 Difference]: Finished difference. Result has 442 places, 524 transitions, 1899 flow [2024-11-28 02:48:20,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=442, PETRI_TRANSITIONS=524} [2024-11-28 02:48:20,084 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -13 predicate places. [2024-11-28 02:48:20,084 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 524 transitions, 1899 flow [2024-11-28 02:48:20,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 483.0) internal successors, (1449), 3 states have internal predecessors, (1449), 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) [2024-11-28 02:48:20,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:20,085 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:20,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 02:48:20,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:20,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:20,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1273338854, now seen corresponding path program 1 times [2024-11-28 02:48:20,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:20,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905212247] [2024-11-28 02:48:20,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:20,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-28 02:48:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905212247] [2024-11-28 02:48:21,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905212247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:21,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:21,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 02:48:21,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579335325] [2024-11-28 02:48:21,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:21,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 02:48:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:21,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 02:48:21,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 02:48:21,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 442 out of 518 [2024-11-28 02:48:21,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 524 transitions, 1899 flow. Second operand has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 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) [2024-11-28 02:48:21,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:21,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 442 of 518 [2024-11-28 02:48:21,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:27,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][535], [560#(= |#race~C~0| 0), 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 640#true, 79#L59-9true, 491#L51-9true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 526#true, Black: 558#true, 124#L67-26true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 603#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), Black: 533#true, 416#L85-4true]) [2024-11-28 02:48:27,238 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-11-28 02:48:27,238 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-11-28 02:48:27,238 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-28 02:48:27,238 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-28 02:48:27,359 INFO L124 PetriNetUnfolderBase]: 6087/33187 cut-off events. [2024-11-28 02:48:27,359 INFO L125 PetriNetUnfolderBase]: For 11963/12078 co-relation queries the response was YES. [2024-11-28 02:48:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55262 conditions, 33187 events. 6087/33187 cut-off events. For 11963/12078 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 407429 event pairs, 2256 based on Foata normal form. 0/31174 useless extension candidates. Maximal degree in co-relation 55216. Up to 8927 conditions per place. [2024-11-28 02:48:27,585 INFO L140 encePairwiseOnDemand]: 503/518 looper letters, 136 selfloop transitions, 77 changer transitions 0/584 dead transitions. [2024-11-28 02:48:27,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 584 transitions, 2629 flow [2024-11-28 02:48:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 02:48:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 02:48:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2749 transitions. [2024-11-28 02:48:27,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8844916344916345 [2024-11-28 02:48:27,589 INFO L175 Difference]: Start difference. First operand has 442 places, 524 transitions, 1899 flow. Second operand 6 states and 2749 transitions. [2024-11-28 02:48:27,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 584 transitions, 2629 flow [2024-11-28 02:48:27,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 584 transitions, 2625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 02:48:27,654 INFO L231 Difference]: Finished difference. Result has 450 places, 576 transitions, 2541 flow [2024-11-28 02:48:27,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2541, PETRI_PLACES=450, PETRI_TRANSITIONS=576} [2024-11-28 02:48:27,655 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, -5 predicate places. [2024-11-28 02:48:27,655 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 576 transitions, 2541 flow [2024-11-28 02:48:27,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 447.3333333333333) internal successors, (2684), 6 states have internal predecessors, (2684), 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) [2024-11-28 02:48:27,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:27,655 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:27,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 02:48:27,656 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:27,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:27,656 INFO L85 PathProgramCache]: Analyzing trace with hash -794576152, now seen corresponding path program 1 times [2024-11-28 02:48:27,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:27,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358089665] [2024-11-28 02:48:27,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:48:27,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:48:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 02:48:29,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358089665] [2024-11-28 02:48:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358089665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-28 02:48:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889445767] [2024-11-28 02:48:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:29,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 02:48:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:29,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 02:48:29,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2024-11-28 02:48:35,641 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 518 [2024-11-28 02:48:35,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 576 transitions, 2541 flow. Second operand has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 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) [2024-11-28 02:48:35,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:48:35,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 518 [2024-11-28 02:48:35,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:48:44,659 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 8#L67-9true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 279#L87true]) [2024-11-28 02:48:44,659 INFO L294 olderBase$Statistics]: this new event has 320 ancestors and is cut-off event [2024-11-28 02:48:44,659 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-28 02:48:44,659 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-28 02:48:44,659 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-28 02:48:45,632 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1414] thread2EXIT-->L87: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, 8#L67-9true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 279#L87true]) [2024-11-28 02:48:45,632 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-28 02:48:45,632 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-28 02:48:45,632 INFO L297 olderBase$Statistics]: existing Event has 269 ancestors and is cut-off event [2024-11-28 02:48:45,632 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-28 02:48:45,632 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-28 02:48:48,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), 385#L54true, 79#L59-9true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 124#L67-26true, 603#true, Black: 533#true, 416#L85-4true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:48:48,253 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-11-28 02:48:48,253 INFO L297 olderBase$Statistics]: existing Event has 258 ancestors and is cut-off event [2024-11-28 02:48:48,253 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-28 02:48:48,253 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-28 02:48:48,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1309] L67-9-->L67-10: Formula: (= |v_#race~B~0_4| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_4|} AuxVars[] AssignedVars[#race~B~0][285], [560#(= |#race~C~0| 0), 395#L50-8true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 416#L85-4true, 204#L59-2true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 427#L67-10true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:48:48,337 INFO L294 olderBase$Statistics]: this new event has 355 ancestors and is cut-off event [2024-11-28 02:48:48,337 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-28 02:48:48,337 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2024-11-28 02:48:48,337 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2024-11-28 02:48:48,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][407], [560#(= |#race~C~0| 0), 79#L59-9true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), 305#L86-1true, Black: 526#true, 124#L67-26true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:48:48,798 INFO L294 olderBase$Statistics]: this new event has 359 ancestors and is cut-off event [2024-11-28 02:48:48,798 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-28 02:48:48,798 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-11-28 02:48:48,798 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2024-11-28 02:48:50,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1349] L67-27-->L67-28: Formula: (= (store |v_#race_46| v_~C~0.base_4 (store (select |v_#race_46| v_~C~0.base_4) (+ 2 v_~C~0.offset_4 (* |v_thread3Thread1of1ForFork2_~i~2#1_43| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_7|)) |v_#race_45|) InVars {#race=|v_#race_46|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_4, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} OutVars{#race=|v_#race_45|, ~C~0.offset=v_~C~0.offset_4, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_7|, ~C~0.base=v_~C~0.base_4, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_43|} AuxVars[] AssignedVars[#race][578], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 491#L51-9true, Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 194#L67-28true, 603#true, Black: 533#true, 416#L85-4true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 478#L58-8true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2024-11-28 02:48:50,783 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2024-11-28 02:48:50,783 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-28 02:48:50,783 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-28 02:48:50,783 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-28 02:48:50,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1350] L67-28-->L67-29: Formula: (= (store |v_#race_48| v_~C~0.base_5 (store (select |v_#race_48| v_~C~0.base_5) (+ 3 v_~C~0.offset_5 (* |v_thread3Thread1of1ForFork2_~i~2#1_45| 4)) |v_thread3Thread1of1ForFork2_#t~nondet12#1_9|)) |v_#race_47|) InVars {#race=|v_#race_48|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} OutVars{#race=|v_#race_47|, ~C~0.offset=v_~C~0.offset_5, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_9|, ~C~0.base=v_~C~0.base_5, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_45|} AuxVars[] AssignedVars[#race][596], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 491#L51-9true, Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, 416#L85-4true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), 478#L58-8true, Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 391#L67-29true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0), 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0))]) [2024-11-28 02:48:50,818 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-11-28 02:48:50,818 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-28 02:48:50,818 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-28 02:48:50,818 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), 385#L54true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 124#L67-26true, 603#true, Black: 533#true, 416#L85-4true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 389#L59-7true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:48:50,833 INFO L294 olderBase$Statistics]: this new event has 397 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][411], [560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), 305#L86-1true, Black: 526#true, 124#L67-26true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 558#true, 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 389#L59-7true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:48:50,833 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L297 olderBase$Statistics]: existing Event has 261 ancestors and is cut-off event [2024-11-28 02:48:50,833 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-11-28 02:48:50,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][407], [486#L59-8true, 560#(= |#race~C~0| 0), Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), 305#L86-1true, Black: 526#true, 124#L67-26true, 603#true, Black: 533#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:48:50,863 INFO L294 olderBase$Statistics]: this new event has 403 ancestors and is cut-off event [2024-11-28 02:48:50,863 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-28 02:48:50,864 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2024-11-28 02:48:50,864 INFO L297 olderBase$Statistics]: existing Event has 262 ancestors and is cut-off event [2024-11-28 02:48:50,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1347] L67-25-->L67-26: Formula: (= (store |v_#race_42| v_~C~0.base_2 (store (select |v_#race_42| v_~C~0.base_2) (+ (* |v_thread3Thread1of1ForFork2_~i~2#1_39| 4) v_~C~0.offset_2) |v_thread3Thread1of1ForFork2_#t~nondet12#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} OutVars{#race=|v_#race_41|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet12#1=|v_thread3Thread1of1ForFork2_#t~nondet12#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][407], [486#L59-8true, 560#(= |#race~C~0| 0), 385#L54true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 124#L67-26true, 603#true, Black: 533#true, 416#L85-4true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 614#true, Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:48:50,864 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2024-11-28 02:48:50,864 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:50,864 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-11-28 02:48:50,864 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 02:48:51,087 INFO L124 PetriNetUnfolderBase]: 8434/64624 cut-off events. [2024-11-28 02:48:51,087 INFO L125 PetriNetUnfolderBase]: For 49001/54676 co-relation queries the response was YES. [2024-11-28 02:48:51,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109651 conditions, 64624 events. 8434/64624 cut-off events. For 49001/54676 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 931362 event pairs, 1041 based on Foata normal form. 501/61131 useless extension candidates. Maximal degree in co-relation 109598. Up to 4505 conditions per place. [2024-11-28 02:48:51,894 INFO L140 encePairwiseOnDemand]: 483/518 looper letters, 493 selfloop transitions, 44 changer transitions 0/939 dead transitions. [2024-11-28 02:48:51,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 939 transitions, 7205 flow [2024-11-28 02:48:51,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 02:48:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-28 02:48:51,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 13770 transitions. [2024-11-28 02:48:51,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.830719111969112 [2024-11-28 02:48:51,918 INFO L175 Difference]: Start difference. First operand has 450 places, 576 transitions, 2541 flow. Second operand 32 states and 13770 transitions. [2024-11-28 02:48:51,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 939 transitions, 7205 flow [2024-11-28 02:48:52,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 939 transitions, 7169 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-28 02:48:52,229 INFO L231 Difference]: Finished difference. Result has 485 places, 593 transitions, 2700 flow [2024-11-28 02:48:52,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=518, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2700, PETRI_PLACES=485, PETRI_TRANSITIONS=593} [2024-11-28 02:48:52,230 INFO L279 CegarLoopForPetriNet]: 455 programPoint places, 30 predicate places. [2024-11-28 02:48:52,230 INFO L471 AbstractCegarLoop]: Abstraction has has 485 places, 593 transitions, 2700 flow [2024-11-28 02:48:52,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 429.5) internal successors, (9449), 22 states have internal predecessors, (9449), 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) [2024-11-28 02:48:52,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 02:48:52,233 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:48:52,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 02:48:52,233 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 54 more)] === [2024-11-28 02:48:52,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:48:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1506866034, now seen corresponding path program 2 times [2024-11-28 02:48:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:48:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001778886] [2024-11-28 02:48:52,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 02:48:52,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:48:52,379 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 02:48:52,380 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 02:48:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-28 02:48:55,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:48:55,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001778886] [2024-11-28 02:48:55,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001778886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:48:55,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:48:55,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-28 02:48:55,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868819402] [2024-11-28 02:48:55,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:48:55,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-28 02:48:55,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:48:55,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-28 02:48:55,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2024-11-28 02:49:04,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 384 out of 518 [2024-11-28 02:49:04,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 485 places, 593 transitions, 2700 flow. Second operand has 27 states, 27 states have (on average 386.77777777777777) internal successors, (10443), 27 states have internal predecessors, (10443), 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) [2024-11-28 02:49:04,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 02:49:04,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 384 of 518 [2024-11-28 02:49:04,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 02:49:08,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1238] L59-1-->L59-2: Formula: (= |v_#race~B~0_1| 0) InVars {} OutVars{#race~B~0=|v_#race~B~0_1|} AuxVars[] AssignedVars[#race~B~0][291], [560#(= |#race~C~0| 0), 385#L54true, Black: 648#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 3)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), Black: 645#(= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|), 804#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (= ~A~0.offset 0) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 647#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1))) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 2)))), 643#true, Black: 646#(and (= (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset)) |thread3Thread1of1ForFork2_#t~nondet12#1|) (= |thread3Thread1of1ForFork2_#t~nondet12#1| (select (select |#race| ~C~0.base) (+ (* |thread3Thread1of1ForFork2_~i~2#1| 4) ~C~0.offset 1)))), Black: 526#true, 603#true, Black: 533#true, Black: 723#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 721#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 727#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 416#L85-4true, Black: 725#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= (select (select |#race| ~A~0.base) ~A~0.offset) 0) (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1) (= (select (select |#race| ~A~0.base) (+ 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ ~A~0.offset 1)) 0)), 204#L59-2true, 614#true, Black: 608#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 3 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), Black: 606#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset)))), Black: 605#(= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))), Black: 607#(and (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset 1)) 0) (= 0 (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) ~A~0.offset))) (= (select (select |#race| ~A~0.base) (+ (* |thread1Thread1of1ForFork0_~i~0#1| 4) 2 ~A~0.offset)) 0)), 535#(= |#race~B~0| 0), Black: 547#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 617#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), Black: 616#(= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0), Black: 619#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0) (= 0 (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 3 ~B~0.offset)))), Black: 618#(and (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset 1)) 0) (= (select (select |#race| ~B~0.base) (+ (* 4 |thread2Thread1of1ForFork1_~i~1#1|) ~B~0.offset)) 0)), 719#(and (not (= ~A~0.base |ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (not (= ~C~0.base ~A~0.base)) (= (select |#valid| |ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (not (= ~A~0.base ~B~0.base)) (= (select |#valid| ~A~0.base) 1)), Black: 558#true, 427#L67-10true, 507#(= |#race~N~0| 0), 528#(= |#race~A~0| 0)]) [2024-11-28 02:49:08,425 INFO L294 olderBase$Statistics]: this new event has 309 ancestors and is cut-off event [2024-11-28 02:49:08,425 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-11-28 02:49:08,425 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2024-11-28 02:49:08,425 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event