./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 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/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_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx --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.2.3-dev-527bcce [2023-11-21 20:59:16,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 20:59:16,254 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-21 20:59:16,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 20:59:16,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 20:59:16,300 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 20:59:16,301 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 20:59:16,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 20:59:16,303 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 20:59:16,308 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 20:59:16,309 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 20:59:16,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 20:59:16,310 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 20:59:16,312 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 20:59:16,312 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-21 20:59:16,313 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 20:59:16,313 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 20:59:16,314 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 20:59:16,314 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 20:59:16,315 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-21 20:59:16,315 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 20:59:16,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-21 20:59:16,316 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-21 20:59:16,317 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 20:59:16,317 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 20:59:16,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 20:59:16,318 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 20:59:16,319 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 20:59:16,319 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 20:59:16,320 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 20:59:16,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:59:16,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 20:59:16,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 20:59:16,322 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-21 20:59:16,322 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 20:59:16,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 20:59:16,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 20:59:16,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 20:59:16,324 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-21 20:59:16,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 20:59:16,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 20:59:16,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx 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 [2023-11-21 20:59:16,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 20:59:16,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 20:59:16,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 20:59:16,662 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 20:59:16,663 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 20:59:16,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-11-21 20:59:19,965 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 20:59:20,348 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 20:59:20,348 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/sv-benchmarks/c/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-11-21 20:59:20,362 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/data/19cbcfdcc/9fa74f93693e4c948190f6181a6b9cf7/FLAGf4e045ff4 [2023-11-21 20:59:20,379 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/data/19cbcfdcc/9fa74f93693e4c948190f6181a6b9cf7 [2023-11-21 20:59:20,384 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 20:59:20,386 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 20:59:20,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:20,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 20:59:20,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 20:59:20,395 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298e6f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20, skipping insertion in model container [2023-11-21 20:59:20,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 20:59:20,695 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:20,709 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 20:59:20,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 20:59:20,778 INFO L206 MainTranslator]: Completed translation [2023-11-21 20:59:20,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20 WrapperNode [2023-11-21 20:59:20,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 20:59:20,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:20,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 20:59:20,780 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 20:59:20,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,799 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,845 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 417 [2023-11-21 20:59:20,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 20:59:20,846 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 20:59:20,846 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 20:59:20,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 20:59:20,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,887 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,897 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 20:59:20,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 20:59:20,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 20:59:20,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 20:59:20,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (1/1) ... [2023-11-21 20:59:20,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 20:59:20,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 20:59:20,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 20:59:20,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_718fca34-66a9-484d-b396-2e5114e00fc8/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 20:59:21,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 20:59:21,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 20:59:21,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 20:59:21,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 20:59:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-21 20:59:21,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-21 20:59:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-21 20:59:21,012 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-21 20:59:21,012 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-21 20:59:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-21 20:59:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 20:59:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 20:59:21,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 20:59:21,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 20:59:21,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 20:59:21,017 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 20:59:21,192 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 20:59:21,195 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 20:59:21,947 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 20:59:21,978 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 20:59:21,979 INFO L308 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-21 20:59:21,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:21 BoogieIcfgContainer [2023-11-21 20:59:21,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 20:59:21,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 20:59:21,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 20:59:21,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 20:59:21,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 08:59:20" (1/3) ... [2023-11-21 20:59:21,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353c2d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:21, skipping insertion in model container [2023-11-21 20:59:21,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 08:59:20" (2/3) ... [2023-11-21 20:59:21,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@353c2d48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 08:59:21, skipping insertion in model container [2023-11-21 20:59:21,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 08:59:21" (3/3) ... [2023-11-21 20:59:21,993 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2023-11-21 20:59:22,002 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-21 20:59:22,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 20:59:22,015 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2023-11-21 20:59:22,015 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 20:59:22,198 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-21 20:59:22,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 529 places, 548 transitions, 1117 flow [2023-11-21 20:59:22,566 INFO L124 PetriNetUnfolderBase]: 29/545 cut-off events. [2023-11-21 20:59:22,566 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-21 20:59:22,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 545 events. 29/545 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 954 event pairs, 0 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 339. Up to 2 conditions per place. [2023-11-21 20:59:22,580 INFO L82 GeneralOperation]: Start removeDead. Operand has 529 places, 548 transitions, 1117 flow [2023-11-21 20:59:22,596 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 479 places, 495 transitions, 1008 flow [2023-11-21 20:59:22,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 20:59:22,621 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1b6e7c69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 20:59:22,621 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-21 20:59:22,627 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 20:59:22,627 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-21 20:59:22,627 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 20:59:22,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:22,628 INFO L208 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] [2023-11-21 20:59:22,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:22,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1740169790, now seen corresponding path program 1 times [2023-11-21 20:59:22,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:22,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172172038] [2023-11-21 20:59:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:22,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:22,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:22,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172172038] [2023-11-21 20:59:22,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172172038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:22,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634865230] [2023-11-21 20:59:22,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:22,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:22,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:22,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:22,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:23,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 505 out of 548 [2023-11-21 20:59:23,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 495 transitions, 1008 flow. Second operand has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:23,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:23,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 505 of 548 [2023-11-21 20:59:23,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:23,522 INFO L124 PetriNetUnfolderBase]: 33/1079 cut-off events. [2023-11-21 20:59:23,523 INFO L125 PetriNetUnfolderBase]: For 28/33 co-relation queries the response was YES. [2023-11-21 20:59:23,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 1079 events. 33/1079 cut-off events. For 28/33 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5558 event pairs, 15 based on Foata normal form. 38/973 useless extension candidates. Maximal degree in co-relation 847. Up to 55 conditions per place. [2023-11-21 20:59:23,549 INFO L140 encePairwiseOnDemand]: 525/548 looper letters, 15 selfloop transitions, 2 changer transitions 6/474 dead transitions. [2023-11-21 20:59:23,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 474 transitions, 1000 flow [2023-11-21 20:59:23,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2023-11-21 20:59:23,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.944647201946472 [2023-11-21 20:59:23,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1553 transitions. [2023-11-21 20:59:23,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1553 transitions. [2023-11-21 20:59:23,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:23,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1553 transitions. [2023-11-21 20:59:23,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 517.6666666666666) internal successors, (1553), 3 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:23,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:23,618 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:23,620 INFO L175 Difference]: Start difference. First operand has 479 places, 495 transitions, 1008 flow. Second operand 3 states and 1553 transitions. [2023-11-21 20:59:23,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 474 transitions, 1000 flow [2023-11-21 20:59:23,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 474 transitions, 988 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-21 20:59:23,648 INFO L231 Difference]: Finished difference. Result has 474 places, 468 transitions, 946 flow [2023-11-21 20:59:23,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=472, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=474, PETRI_TRANSITIONS=468} [2023-11-21 20:59:23,656 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -5 predicate places. [2023-11-21 20:59:23,657 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 468 transitions, 946 flow [2023-11-21 20:59:23,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 506.3333333333333) internal successors, (1519), 3 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:23,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:23,659 INFO L208 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] [2023-11-21 20:59:23,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 20:59:23,661 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:23,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1036921209, now seen corresponding path program 1 times [2023-11-21 20:59:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:23,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470068688] [2023-11-21 20:59:23,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:23,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470068688] [2023-11-21 20:59:23,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470068688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:23,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324022626] [2023-11-21 20:59:23,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:23,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:23,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:23,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 499 out of 548 [2023-11-21 20:59:23,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 468 transitions, 946 flow. Second operand has 3 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:23,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:23,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 499 of 548 [2023-11-21 20:59:23,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:24,857 INFO L124 PetriNetUnfolderBase]: 100/2698 cut-off events. [2023-11-21 20:59:24,857 INFO L125 PetriNetUnfolderBase]: For 14/31 co-relation queries the response was YES. [2023-11-21 20:59:24,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2869 conditions, 2698 events. 100/2698 cut-off events. For 14/31 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 20020 event pairs, 56 based on Foata normal form. 0/2352 useless extension candidates. Maximal degree in co-relation 2837. Up to 152 conditions per place. [2023-11-21 20:59:24,894 INFO L140 encePairwiseOnDemand]: 541/548 looper letters, 18 selfloop transitions, 1 changer transitions 0/462 dead transitions. [2023-11-21 20:59:24,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 462 transitions, 972 flow [2023-11-21 20:59:24,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:24,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:24,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1522 transitions. [2023-11-21 20:59:24,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9257907542579076 [2023-11-21 20:59:24,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1522 transitions. [2023-11-21 20:59:24,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1522 transitions. [2023-11-21 20:59:24,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:24,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1522 transitions. [2023-11-21 20:59:24,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 507.3333333333333) internal successors, (1522), 3 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:24,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:24,918 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:24,919 INFO L175 Difference]: Start difference. First operand has 474 places, 468 transitions, 946 flow. Second operand 3 states and 1522 transitions. [2023-11-21 20:59:24,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 462 transitions, 972 flow [2023-11-21 20:59:24,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 462 transitions, 968 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:24,931 INFO L231 Difference]: Finished difference. Result has 462 places, 462 transitions, 932 flow [2023-11-21 20:59:24,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=932, PETRI_PLACES=462, PETRI_TRANSITIONS=462} [2023-11-21 20:59:24,933 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -17 predicate places. [2023-11-21 20:59:24,933 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 462 transitions, 932 flow [2023-11-21 20:59:24,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 500.0) internal successors, (1500), 3 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:24,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:24,940 INFO L208 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] [2023-11-21 20:59:24,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 20:59:24,941 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:24,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:24,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1056744078, now seen corresponding path program 1 times [2023-11-21 20:59:24,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:24,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357210124] [2023-11-21 20:59:24,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:24,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357210124] [2023-11-21 20:59:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357210124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821848769] [2023-11-21 20:59:25,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:25,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:25,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:25,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:25,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:26,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 548 [2023-11-21 20:59:26,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 462 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 441.5) internal successors, (2649), 6 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:26,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:26,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 548 [2023-11-21 20:59:26,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:34,451 INFO L124 PetriNetUnfolderBase]: 7047/28402 cut-off events. [2023-11-21 20:59:34,451 INFO L125 PetriNetUnfolderBase]: For 206/840 co-relation queries the response was YES. [2023-11-21 20:59:34,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38179 conditions, 28402 events. 7047/28402 cut-off events. For 206/840 co-relation queries the response was YES. Maximal size of possible extension queue 468. Compared 329806 event pairs, 5840 based on Foata normal form. 0/24782 useless extension candidates. Maximal degree in co-relation 38148. Up to 9728 conditions per place. [2023-11-21 20:59:35,080 INFO L140 encePairwiseOnDemand]: 530/548 looper letters, 66 selfloop transitions, 15 changer transitions 0/459 dead transitions. [2023-11-21 20:59:35,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 459 transitions, 1088 flow [2023-11-21 20:59:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:59:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2724 transitions. [2023-11-21 20:59:35,090 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8284671532846716 [2023-11-21 20:59:35,091 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2724 transitions. [2023-11-21 20:59:35,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2724 transitions. [2023-11-21 20:59:35,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:35,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2724 transitions. [2023-11-21 20:59:35,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 454.0) internal successors, (2724), 6 states have internal predecessors, (2724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,118 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,119 INFO L175 Difference]: Start difference. First operand has 462 places, 462 transitions, 932 flow. Second operand 6 states and 2724 transitions. [2023-11-21 20:59:35,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 459 transitions, 1088 flow [2023-11-21 20:59:35,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 459 transitions, 1087 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-21 20:59:35,132 INFO L231 Difference]: Finished difference. Result has 463 places, 459 transitions, 955 flow [2023-11-21 20:59:35,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=925, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=955, PETRI_PLACES=463, PETRI_TRANSITIONS=459} [2023-11-21 20:59:35,136 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -16 predicate places. [2023-11-21 20:59:35,136 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 459 transitions, 955 flow [2023-11-21 20:59:35,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 441.5) internal successors, (2649), 6 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:35,139 INFO L208 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] [2023-11-21 20:59:35,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 20:59:35,140 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:35,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash 227499759, now seen corresponding path program 1 times [2023-11-21 20:59:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720998394] [2023-11-21 20:59:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:35,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:35,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720998394] [2023-11-21 20:59:35,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720998394] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:35,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:35,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449196397] [2023-11-21 20:59:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:35,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:35,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:35,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:35,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:35,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 548 [2023-11-21 20:59:35,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 459 transitions, 955 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:35,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 548 [2023-11-21 20:59:35,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:35,459 INFO L124 PetriNetUnfolderBase]: 16/883 cut-off events. [2023-11-21 20:59:35,459 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-21 20:59:35,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 883 events. 16/883 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2934 event pairs, 5 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 901. Up to 25 conditions per place. [2023-11-21 20:59:35,474 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 11 selfloop transitions, 2 changer transitions 0/458 dead transitions. [2023-11-21 20:59:35,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 458 transitions, 979 flow [2023-11-21 20:59:35,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2023-11-21 20:59:35,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373479318734793 [2023-11-21 20:59:35,480 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1541 transitions. [2023-11-21 20:59:35,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1541 transitions. [2023-11-21 20:59:35,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:35,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1541 transitions. [2023-11-21 20:59:35,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 513.6666666666666) internal successors, (1541), 3 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,496 INFO L175 Difference]: Start difference. First operand has 463 places, 459 transitions, 955 flow. Second operand 3 states and 1541 transitions. [2023-11-21 20:59:35,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 458 transitions, 979 flow [2023-11-21 20:59:35,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 459 places, 458 transitions, 949 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-21 20:59:35,514 INFO L231 Difference]: Finished difference. Result has 459 places, 458 transitions, 927 flow [2023-11-21 20:59:35,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=927, PETRI_PLACES=459, PETRI_TRANSITIONS=458} [2023-11-21 20:59:35,518 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -20 predicate places. [2023-11-21 20:59:35,518 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 458 transitions, 927 flow [2023-11-21 20:59:35,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:35,521 INFO L208 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] [2023-11-21 20:59:35,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 20:59:35,521 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:35,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:35,522 INFO L85 PathProgramCache]: Analyzing trace with hash 395981782, now seen corresponding path program 1 times [2023-11-21 20:59:35,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218320724] [2023-11-21 20:59:35,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:35,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:35,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218320724] [2023-11-21 20:59:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218320724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:35,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:35,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049684187] [2023-11-21 20:59:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:35,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:35,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:35,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 548 [2023-11-21 20:59:35,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 458 transitions, 927 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:35,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 548 [2023-11-21 20:59:35,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:35,781 INFO L124 PetriNetUnfolderBase]: 14/626 cut-off events. [2023-11-21 20:59:35,781 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-21 20:59:35,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 626 events. 14/626 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1727 event pairs, 7 based on Foata normal form. 0/567 useless extension candidates. Maximal degree in co-relation 630. Up to 25 conditions per place. [2023-11-21 20:59:35,793 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 11 selfloop transitions, 2 changer transitions 0/457 dead transitions. [2023-11-21 20:59:35,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 457 transitions, 951 flow [2023-11-21 20:59:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2023-11-21 20:59:35,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373479318734793 [2023-11-21 20:59:35,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1541 transitions. [2023-11-21 20:59:35,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1541 transitions. [2023-11-21 20:59:35,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:35,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1541 transitions. [2023-11-21 20:59:35,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 513.6666666666666) internal successors, (1541), 3 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,820 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,820 INFO L175 Difference]: Start difference. First operand has 459 places, 458 transitions, 927 flow. Second operand 3 states and 1541 transitions. [2023-11-21 20:59:35,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 457 transitions, 951 flow [2023-11-21 20:59:35,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 457 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:35,834 INFO L231 Difference]: Finished difference. Result has 458 places, 457 transitions, 925 flow [2023-11-21 20:59:35,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=458, PETRI_TRANSITIONS=457} [2023-11-21 20:59:35,838 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -21 predicate places. [2023-11-21 20:59:35,838 INFO L495 AbstractCegarLoop]: Abstraction has has 458 places, 457 transitions, 925 flow [2023-11-21 20:59:35,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:35,842 INFO L208 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] [2023-11-21 20:59:35,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 20:59:35,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:35,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1774229213, now seen corresponding path program 1 times [2023-11-21 20:59:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681572052] [2023-11-21 20:59:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:35,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:35,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681572052] [2023-11-21 20:59:35,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681572052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:35,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:35,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:35,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367985076] [2023-11-21 20:59:35,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:35,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:35,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:35,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:35,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:35,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 509 out of 548 [2023-11-21 20:59:35,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 458 places, 457 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:35,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:35,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 509 of 548 [2023-11-21 20:59:35,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:36,264 INFO L124 PetriNetUnfolderBase]: 13/691 cut-off events. [2023-11-21 20:59:36,264 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2023-11-21 20:59:36,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 691 events. 13/691 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1718 event pairs, 4 based on Foata normal form. 0/622 useless extension candidates. Maximal degree in co-relation 692. Up to 23 conditions per place. [2023-11-21 20:59:36,273 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 11 selfloop transitions, 2 changer transitions 0/456 dead transitions. [2023-11-21 20:59:36,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 456 transitions, 949 flow [2023-11-21 20:59:36,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1541 transitions. [2023-11-21 20:59:36,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9373479318734793 [2023-11-21 20:59:36,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1541 transitions. [2023-11-21 20:59:36,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1541 transitions. [2023-11-21 20:59:36,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:36,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1541 transitions. [2023-11-21 20:59:36,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 513.6666666666666) internal successors, (1541), 3 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,294 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,294 INFO L175 Difference]: Start difference. First operand has 458 places, 457 transitions, 925 flow. Second operand 3 states and 1541 transitions. [2023-11-21 20:59:36,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 456 transitions, 949 flow [2023-11-21 20:59:36,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 456 transitions, 945 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:36,306 INFO L231 Difference]: Finished difference. Result has 457 places, 456 transitions, 923 flow [2023-11-21 20:59:36,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=455, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=457, PETRI_TRANSITIONS=456} [2023-11-21 20:59:36,311 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -22 predicate places. [2023-11-21 20:59:36,312 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 456 transitions, 923 flow [2023-11-21 20:59:36,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 510.3333333333333) internal successors, (1531), 3 states have internal predecessors, (1531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:36,313 INFO L208 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] [2023-11-21 20:59:36,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 20:59:36,314 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:36,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1400620447, now seen corresponding path program 1 times [2023-11-21 20:59:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382318370] [2023-11-21 20:59:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:36,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:36,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:36,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:36,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382318370] [2023-11-21 20:59:36,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382318370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:36,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:36,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:36,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830881858] [2023-11-21 20:59:36,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:36,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:36,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:36,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:36,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-21 20:59:36,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 456 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:36,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-21 20:59:36,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:36,561 INFO L124 PetriNetUnfolderBase]: 15/571 cut-off events. [2023-11-21 20:59:36,562 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2023-11-21 20:59:36,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 612 conditions, 571 events. 15/571 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1553 event pairs, 2 based on Foata normal form. 1/525 useless extension candidates. Maximal degree in co-relation 581. Up to 14 conditions per place. [2023-11-21 20:59:36,571 INFO L140 encePairwiseOnDemand]: 543/548 looper letters, 10 selfloop transitions, 3 changer transitions 0/456 dead transitions. [2023-11-21 20:59:36,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 456 transitions, 951 flow [2023-11-21 20:59:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:36,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1548 transitions. [2023-11-21 20:59:36,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9416058394160584 [2023-11-21 20:59:36,578 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1548 transitions. [2023-11-21 20:59:36,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1548 transitions. [2023-11-21 20:59:36,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:36,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1548 transitions. [2023-11-21 20:59:36,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 516.0) internal successors, (1548), 3 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,610 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,612 INFO L175 Difference]: Start difference. First operand has 457 places, 456 transitions, 923 flow. Second operand 3 states and 1548 transitions. [2023-11-21 20:59:36,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 456 transitions, 951 flow [2023-11-21 20:59:36,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 456 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:36,625 INFO L231 Difference]: Finished difference. Result has 455 places, 454 transitions, 921 flow [2023-11-21 20:59:36,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=451, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=921, PETRI_PLACES=455, PETRI_TRANSITIONS=454} [2023-11-21 20:59:36,627 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -24 predicate places. [2023-11-21 20:59:36,627 INFO L495 AbstractCegarLoop]: Abstraction has has 455 places, 454 transitions, 921 flow [2023-11-21 20:59:36,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.0) internal successors, (1536), 3 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:36,629 INFO L208 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] [2023-11-21 20:59:36,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 20:59:36,629 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:36,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:36,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1671445373, now seen corresponding path program 1 times [2023-11-21 20:59:36,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:36,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629364597] [2023-11-21 20:59:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:36,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:36,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629364597] [2023-11-21 20:59:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629364597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006551869] [2023-11-21 20:59:36,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:36,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:36,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:36,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:36,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:36,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-21 20:59:36,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 454 transitions, 921 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:36,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:36,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-21 20:59:36,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:37,029 INFO L124 PetriNetUnfolderBase]: 31/1134 cut-off events. [2023-11-21 20:59:37,029 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-21 20:59:37,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 1134 events. 31/1134 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4904 event pairs, 2 based on Foata normal form. 1/1022 useless extension candidates. Maximal degree in co-relation 1178. Up to 46 conditions per place. [2023-11-21 20:59:37,051 INFO L140 encePairwiseOnDemand]: 544/548 looper letters, 16 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2023-11-21 20:59:37,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 459 transitions, 972 flow [2023-11-21 20:59:37,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1553 transitions. [2023-11-21 20:59:37,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.944647201946472 [2023-11-21 20:59:37,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1553 transitions. [2023-11-21 20:59:37,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1553 transitions. [2023-11-21 20:59:37,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:37,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1553 transitions. [2023-11-21 20:59:37,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 517.6666666666666) internal successors, (1553), 3 states have internal predecessors, (1553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,071 INFO L175 Difference]: Start difference. First operand has 455 places, 454 transitions, 921 flow. Second operand 3 states and 1553 transitions. [2023-11-21 20:59:37,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 459 transitions, 972 flow [2023-11-21 20:59:37,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 459 transitions, 966 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:37,084 INFO L231 Difference]: Finished difference. Result has 454 places, 454 transitions, 925 flow [2023-11-21 20:59:37,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=454, PETRI_TRANSITIONS=454} [2023-11-21 20:59:37,088 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -25 predicate places. [2023-11-21 20:59:37,089 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 454 transitions, 925 flow [2023-11-21 20:59:37,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:37,090 INFO L208 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] [2023-11-21 20:59:37,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 20:59:37,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:37,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:37,091 INFO L85 PathProgramCache]: Analyzing trace with hash -971748554, now seen corresponding path program 1 times [2023-11-21 20:59:37,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:37,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750835109] [2023-11-21 20:59:37,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:37,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:37,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:37,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:37,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750835109] [2023-11-21 20:59:37,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750835109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:37,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:37,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:37,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352891570] [2023-11-21 20:59:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:37,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:37,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:37,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:37,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-21 20:59:37,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 454 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:37,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-21 20:59:37,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:37,479 INFO L124 PetriNetUnfolderBase]: 25/807 cut-off events. [2023-11-21 20:59:37,479 INFO L125 PetriNetUnfolderBase]: For 16/37 co-relation queries the response was YES. [2023-11-21 20:59:37,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 866 conditions, 807 events. 25/807 cut-off events. For 16/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2962 event pairs, 3 based on Foata normal form. 4/735 useless extension candidates. Maximal degree in co-relation 835. Up to 21 conditions per place. [2023-11-21 20:59:37,504 INFO L140 encePairwiseOnDemand]: 543/548 looper letters, 9 selfloop transitions, 2 changer transitions 4/454 dead transitions. [2023-11-21 20:59:37,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 454 transitions, 951 flow [2023-11-21 20:59:37,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1547 transitions. [2023-11-21 20:59:37,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9409975669099757 [2023-11-21 20:59:37,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1547 transitions. [2023-11-21 20:59:37,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1547 transitions. [2023-11-21 20:59:37,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:37,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1547 transitions. [2023-11-21 20:59:37,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 515.6666666666666) internal successors, (1547), 3 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,529 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,530 INFO L175 Difference]: Start difference. First operand has 454 places, 454 transitions, 925 flow. Second operand 3 states and 1547 transitions. [2023-11-21 20:59:37,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 454 transitions, 951 flow [2023-11-21 20:59:37,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 454 transitions, 951 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 20:59:37,546 INFO L231 Difference]: Finished difference. Result has 454 places, 448 transitions, 917 flow [2023-11-21 20:59:37,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=454, PETRI_TRANSITIONS=448} [2023-11-21 20:59:37,548 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -25 predicate places. [2023-11-21 20:59:37,548 INFO L495 AbstractCegarLoop]: Abstraction has has 454 places, 448 transitions, 917 flow [2023-11-21 20:59:37,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.3333333333334) internal successors, (1537), 3 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:37,550 INFO L208 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] [2023-11-21 20:59:37,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 20:59:37,551 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:37,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1842414664, now seen corresponding path program 1 times [2023-11-21 20:59:37,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:37,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269985460] [2023-11-21 20:59:37,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:37,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:37,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:37,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269985460] [2023-11-21 20:59:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269985460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:37,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:37,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:37,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311988014] [2023-11-21 20:59:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:37,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:37,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:37,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:37,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:37,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-21 20:59:37,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 448 transitions, 917 flow. Second operand has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:37,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:37,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-21 20:59:37,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:38,258 INFO L124 PetriNetUnfolderBase]: 73/1928 cut-off events. [2023-11-21 20:59:38,258 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2023-11-21 20:59:38,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2080 conditions, 1928 events. 73/1928 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11837 event pairs, 6 based on Foata normal form. 0/1727 useless extension candidates. Maximal degree in co-relation 2048. Up to 93 conditions per place. [2023-11-21 20:59:38,292 INFO L140 encePairwiseOnDemand]: 544/548 looper letters, 15 selfloop transitions, 2 changer transitions 0/452 dead transitions. [2023-11-21 20:59:38,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 450 places, 452 transitions, 963 flow [2023-11-21 20:59:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1552 transitions. [2023-11-21 20:59:38,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2023-11-21 20:59:38,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1552 transitions. [2023-11-21 20:59:38,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1552 transitions. [2023-11-21 20:59:38,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:38,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1552 transitions. [2023-11-21 20:59:38,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 517.3333333333334) internal successors, (1552), 3 states have internal predecessors, (1552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:38,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:38,315 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:38,315 INFO L175 Difference]: Start difference. First operand has 454 places, 448 transitions, 917 flow. Second operand 3 states and 1552 transitions. [2023-11-21 20:59:38,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 450 places, 452 transitions, 963 flow [2023-11-21 20:59:38,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 452 transitions, 959 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 20:59:38,329 INFO L231 Difference]: Finished difference. Result has 449 places, 448 transitions, 923 flow [2023-11-21 20:59:38,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=909, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=923, PETRI_PLACES=449, PETRI_TRANSITIONS=448} [2023-11-21 20:59:38,331 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -30 predicate places. [2023-11-21 20:59:38,331 INFO L495 AbstractCegarLoop]: Abstraction has has 449 places, 448 transitions, 923 flow [2023-11-21 20:59:38,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 512.6666666666666) internal successors, (1538), 3 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:38,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:38,333 INFO L208 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] [2023-11-21 20:59:38,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 20:59:38,333 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:38,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:38,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1346113913, now seen corresponding path program 1 times [2023-11-21 20:59:38,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:38,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316921111] [2023-11-21 20:59:38,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:38,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:38,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316921111] [2023-11-21 20:59:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316921111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:38,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:38,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 20:59:38,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112413431] [2023-11-21 20:59:38,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:38,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 20:59:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:38,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 20:59:38,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:59:39,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 548 [2023-11-21 20:59:39,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 448 transitions, 923 flow. Second operand has 7 states, 7 states have (on average 489.14285714285717) internal successors, (3424), 7 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:39,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:39,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 548 [2023-11-21 20:59:39,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:39,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1475] thread3EXIT-->L88-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][476], [Black: 572#true, 574#(= |#race~B~0| 0), 565#(= |#race~A~0| 0), 577#true, 538#(= |#race~N~0| 0), Black: 563#true, 325#L88-7true]) [2023-11-21 20:59:39,959 INFO L294 olderBase$Statistics]: this new event has 424 ancestors and is cut-off event [2023-11-21 20:59:39,959 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is cut-off event [2023-11-21 20:59:39,959 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is cut-off event [2023-11-21 20:59:39,960 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2023-11-21 20:59:39,962 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1475] thread3EXIT-->L88-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem33#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem33#1=|v_ULTIMATE.start_main_#t~mem33#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][476], [Black: 572#true, 574#(= |#race~B~0| 0), 565#(= |#race~A~0| 0), 577#true, 538#(= |#race~N~0| 0), Black: 563#true, 325#L88-7true]) [2023-11-21 20:59:39,963 INFO L294 olderBase$Statistics]: this new event has 328 ancestors and is not cut-off event [2023-11-21 20:59:39,963 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is not cut-off event [2023-11-21 20:59:39,963 INFO L297 olderBase$Statistics]: existing Event has 379 ancestors and is not cut-off event [2023-11-21 20:59:39,963 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is not cut-off event [2023-11-21 20:59:39,963 INFO L297 olderBase$Statistics]: existing Event has 424 ancestors and is not cut-off event [2023-11-21 20:59:40,003 INFO L124 PetriNetUnfolderBase]: 60/2172 cut-off events. [2023-11-21 20:59:40,003 INFO L125 PetriNetUnfolderBase]: For 28/80 co-relation queries the response was YES. [2023-11-21 20:59:40,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 2172 events. 60/2172 cut-off events. For 28/80 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 12000 event pairs, 14 based on Foata normal form. 4/1988 useless extension candidates. Maximal degree in co-relation 2381. Up to 68 conditions per place. [2023-11-21 20:59:40,050 INFO L140 encePairwiseOnDemand]: 519/548 looper letters, 40 selfloop transitions, 42 changer transitions 0/491 dead transitions. [2023-11-21 20:59:40,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 491 transitions, 1181 flow [2023-11-21 20:59:40,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 20:59:40,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 20:59:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4933 transitions. [2023-11-21 20:59:40,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9001824817518248 [2023-11-21 20:59:40,073 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 4933 transitions. [2023-11-21 20:59:40,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 4933 transitions. [2023-11-21 20:59:40,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:40,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 4933 transitions. [2023-11-21 20:59:40,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:40,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:40,118 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:40,118 INFO L175 Difference]: Start difference. First operand has 449 places, 448 transitions, 923 flow. Second operand 10 states and 4933 transitions. [2023-11-21 20:59:40,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 491 transitions, 1181 flow [2023-11-21 20:59:40,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 491 transitions, 1181 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 20:59:40,135 INFO L231 Difference]: Finished difference. Result has 462 places, 473 transitions, 1115 flow [2023-11-21 20:59:40,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=923, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1115, PETRI_PLACES=462, PETRI_TRANSITIONS=473} [2023-11-21 20:59:40,137 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -17 predicate places. [2023-11-21 20:59:40,138 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 473 transitions, 1115 flow [2023-11-21 20:59:40,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 489.14285714285717) internal successors, (3424), 7 states have internal predecessors, (3424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:40,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:40,142 INFO L208 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] [2023-11-21 20:59:40,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 20:59:40,143 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:40,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -694292208, now seen corresponding path program 1 times [2023-11-21 20:59:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:40,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984304236] [2023-11-21 20:59:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:40,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:40,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984304236] [2023-11-21 20:59:40,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984304236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:40,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:40,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 20:59:40,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251006206] [2023-11-21 20:59:40,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:40,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 20:59:40,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:40,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 20:59:40,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 20:59:40,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 511 out of 548 [2023-11-21 20:59:40,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 462 places, 473 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:40,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:40,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 511 of 548 [2023-11-21 20:59:40,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:41,097 INFO L124 PetriNetUnfolderBase]: 102/2166 cut-off events. [2023-11-21 20:59:41,098 INFO L125 PetriNetUnfolderBase]: For 90/112 co-relation queries the response was YES. [2023-11-21 20:59:41,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 2166 events. 102/2166 cut-off events. For 90/112 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 12663 event pairs, 2 based on Foata normal form. 6/1990 useless extension candidates. Maximal degree in co-relation 2459. Up to 124 conditions per place. [2023-11-21 20:59:41,139 INFO L140 encePairwiseOnDemand]: 545/548 looper letters, 14 selfloop transitions, 1 changer transitions 0/475 dead transitions. [2023-11-21 20:59:41,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 475 transitions, 1152 flow [2023-11-21 20:59:41,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 20:59:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 20:59:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1550 transitions. [2023-11-21 20:59:41,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9428223844282239 [2023-11-21 20:59:41,147 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1550 transitions. [2023-11-21 20:59:41,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1550 transitions. [2023-11-21 20:59:41,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:41,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1550 transitions. [2023-11-21 20:59:41,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 516.6666666666666) internal successors, (1550), 3 states have internal predecessors, (1550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:41,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:41,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 548.0) internal successors, (2192), 4 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:41,162 INFO L175 Difference]: Start difference. First operand has 462 places, 473 transitions, 1115 flow. Second operand 3 states and 1550 transitions. [2023-11-21 20:59:41,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 475 transitions, 1152 flow [2023-11-21 20:59:41,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 475 transitions, 1152 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 20:59:41,186 INFO L231 Difference]: Finished difference. Result has 463 places, 472 transitions, 1118 flow [2023-11-21 20:59:41,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=470, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=463, PETRI_TRANSITIONS=472} [2023-11-21 20:59:41,189 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -16 predicate places. [2023-11-21 20:59:41,190 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 472 transitions, 1118 flow [2023-11-21 20:59:41,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 513.0) internal successors, (1539), 3 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:41,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:41,191 INFO L208 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] [2023-11-21 20:59:41,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 20:59:41,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:41,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:41,193 INFO L85 PathProgramCache]: Analyzing trace with hash -2010669904, now seen corresponding path program 1 times [2023-11-21 20:59:41,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:41,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470058570] [2023-11-21 20:59:41,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:41,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:42,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:42,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470058570] [2023-11-21 20:59:42,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470058570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:42,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:42,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:42,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743298145] [2023-11-21 20:59:42,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:42,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:42,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 548 [2023-11-21 20:59:42,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 472 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 493.6666666666667) internal successors, (2962), 6 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:42,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:42,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 548 [2023-11-21 20:59:42,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:44,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][372], [Black: 572#true, 42#L67-27true, 565#(= |#race~A~0| 0), 577#true, Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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|)), 538#(= |#race~N~0| 0), Black: 589#(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|)), 601#(= |#race~C~0| 0), Black: 563#true, 604#true, Black: 599#true, 296#L87-7true]) [2023-11-21 20:59:44,847 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-21 20:59:44,847 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 20:59:44,848 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-21 20:59:44,848 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 20:59:45,208 INFO L124 PetriNetUnfolderBase]: 320/5425 cut-off events. [2023-11-21 20:59:45,208 INFO L125 PetriNetUnfolderBase]: For 98/434 co-relation queries the response was YES. [2023-11-21 20:59:45,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 5425 events. 320/5425 cut-off events. For 98/434 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 44374 event pairs, 24 based on Foata normal form. 31/4954 useless extension candidates. Maximal degree in co-relation 6261. Up to 403 conditions per place. [2023-11-21 20:59:45,280 INFO L140 encePairwiseOnDemand]: 538/548 looper letters, 32 selfloop transitions, 21 changer transitions 0/495 dead transitions. [2023-11-21 20:59:45,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 495 transitions, 1273 flow [2023-11-21 20:59:45,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:59:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3006 transitions. [2023-11-21 20:59:45,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9142335766423357 [2023-11-21 20:59:45,293 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3006 transitions. [2023-11-21 20:59:45,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3006 transitions. [2023-11-21 20:59:45,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:45,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3006 transitions. [2023-11-21 20:59:45,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 501.0) internal successors, (3006), 6 states have internal predecessors, (3006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:45,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:45,319 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:45,319 INFO L175 Difference]: Start difference. First operand has 463 places, 472 transitions, 1118 flow. Second operand 6 states and 3006 transitions. [2023-11-21 20:59:45,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 495 transitions, 1273 flow [2023-11-21 20:59:45,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 468 places, 495 transitions, 1273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 20:59:45,336 INFO L231 Difference]: Finished difference. Result has 473 places, 492 transitions, 1260 flow [2023-11-21 20:59:45,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=463, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1260, PETRI_PLACES=473, PETRI_TRANSITIONS=492} [2023-11-21 20:59:45,338 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, -6 predicate places. [2023-11-21 20:59:45,338 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 492 transitions, 1260 flow [2023-11-21 20:59:45,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 493.6666666666667) internal successors, (2962), 6 states have internal predecessors, (2962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:45,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:45,340 INFO L208 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] [2023-11-21 20:59:45,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 20:59:45,340 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:45,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:45,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1538783012, now seen corresponding path program 1 times [2023-11-21 20:59:45,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:45,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952492398] [2023-11-21 20:59:45,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:45,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:45,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952492398] [2023-11-21 20:59:45,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952492398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:45,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:45,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 20:59:45,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096581523] [2023-11-21 20:59:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:45,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 20:59:45,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:45,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 20:59:45,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:59:46,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 548 [2023-11-21 20:59:46,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 492 transitions, 1260 flow. Second operand has 7 states, 7 states have (on average 489.2857142857143) internal successors, (3425), 7 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:46,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:46,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 548 [2023-11-21 20:59:46,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:46,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, 42#L67-27true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 587#(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|)), 49#L86-7true, Black: 589#(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|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-21 20:59:46,660 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-21 20:59:46,660 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2023-11-21 20:59:46,660 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2023-11-21 20:59:46,661 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2023-11-21 20:59:46,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, 42#L67-27true, 154#L62true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 587#(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|)), 49#L86-7true, Black: 589#(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|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-21 20:59:46,670 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2023-11-21 20:59:46,670 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-21 20:59:46,670 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-21 20:59:46,670 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-21 20:59:46,671 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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|)), 49#L86-7true, Black: 589#(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|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 202#L67-28true]) [2023-11-21 20:59:46,671 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2023-11-21 20:59:46,672 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-21 20:59:46,672 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2023-11-21 20:59:46,672 INFO L297 olderBase$Statistics]: existing Event has 350 ancestors and is cut-off event [2023-11-21 20:59:46,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 154#L62true, 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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|)), 49#L86-7true, Black: 589#(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|)), 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 202#L67-28true]) [2023-11-21 20:59:46,680 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2023-11-21 20:59:46,680 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-21 20:59:46,681 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-21 20:59:46,681 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-21 20:59:46,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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|)), 538#(= |#race~N~0| 0), 49#L86-7true, Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 413#L67-29true]) [2023-11-21 20:59:46,682 INFO L294 olderBase$Statistics]: this new event has 261 ancestors and is cut-off event [2023-11-21 20:59:46,682 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-21 20:59:46,683 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2023-11-21 20:59:46,683 INFO L297 olderBase$Statistics]: existing Event has 351 ancestors and is cut-off event [2023-11-21 20:59:46,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 154#L62true, 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 577#true, Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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|)), 538#(= |#race~N~0| 0), 49#L86-7true, Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true, 413#L67-29true]) [2023-11-21 20:59:46,691 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2023-11-21 20:59:46,692 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-21 20:59:46,692 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-21 20:59:46,692 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-21 20:59:46,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), 577#true, Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 295#L59true, 400#L67-30true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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|)), 49#L86-7true, 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-21 20:59:46,694 INFO L294 olderBase$Statistics]: this new event has 262 ancestors and is cut-off event [2023-11-21 20:59:46,694 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-21 20:59:46,694 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2023-11-21 20:59:46,694 INFO L297 olderBase$Statistics]: existing Event has 352 ancestors and is cut-off event [2023-11-21 20:59:46,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1473] thread1EXIT-->L86-7: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem31#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem31#1=|v_ULTIMATE.start_main_#t~mem31#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][377], [Black: 572#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 154#L62true, 565#(= |#race~A~0| 0), 577#true, Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 604#true, Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 400#L67-30true, Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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|)), 49#L86-7true, 538#(= |#race~N~0| 0), Black: 563#true, 601#(= |#race~C~0| 0), 616#true, Black: 599#true]) [2023-11-21 20:59:46,703 INFO L294 olderBase$Statistics]: this new event has 263 ancestors and is cut-off event [2023-11-21 20:59:46,703 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2023-11-21 20:59:46,703 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2023-11-21 20:59:46,703 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2023-11-21 20:59:47,399 INFO L124 PetriNetUnfolderBase]: 233/3855 cut-off events. [2023-11-21 20:59:47,400 INFO L125 PetriNetUnfolderBase]: For 252/363 co-relation queries the response was YES. [2023-11-21 20:59:47,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4665 conditions, 3855 events. 233/3855 cut-off events. For 252/363 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 28229 event pairs, 68 based on Foata normal form. 9/3481 useless extension candidates. Maximal degree in co-relation 4617. Up to 213 conditions per place. [2023-11-21 20:59:47,450 INFO L140 encePairwiseOnDemand]: 519/548 looper letters, 40 selfloop transitions, 42 changer transitions 0/512 dead transitions. [2023-11-21 20:59:47,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 512 transitions, 1492 flow [2023-11-21 20:59:47,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 20:59:47,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 20:59:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4933 transitions. [2023-11-21 20:59:47,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9001824817518248 [2023-11-21 20:59:47,467 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 4933 transitions. [2023-11-21 20:59:47,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 4933 transitions. [2023-11-21 20:59:47,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:47,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 4933 transitions. [2023-11-21 20:59:47,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:47,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:47,504 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:47,504 INFO L175 Difference]: Start difference. First operand has 473 places, 492 transitions, 1260 flow. Second operand 10 states and 4933 transitions. [2023-11-21 20:59:47,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 512 transitions, 1492 flow [2023-11-21 20:59:47,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 512 transitions, 1492 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 20:59:47,519 INFO L231 Difference]: Finished difference. Result has 484 places, 494 transitions, 1365 flow [2023-11-21 20:59:47,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1260, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1365, PETRI_PLACES=484, PETRI_TRANSITIONS=494} [2023-11-21 20:59:47,521 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 5 predicate places. [2023-11-21 20:59:47,521 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 494 transitions, 1365 flow [2023-11-21 20:59:47,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 489.2857142857143) internal successors, (3425), 7 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:47,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:47,523 INFO L208 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] [2023-11-21 20:59:47,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 20:59:47,524 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:47,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1085727542, now seen corresponding path program 1 times [2023-11-21 20:59:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369439882] [2023-11-21 20:59:47,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:47,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:47,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369439882] [2023-11-21 20:59:47,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369439882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:47,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:47,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 20:59:47,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539300273] [2023-11-21 20:59:47,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:47,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 20:59:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 20:59:47,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-21 20:59:48,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 548 [2023-11-21 20:59:48,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 494 transitions, 1365 flow. Second operand has 7 states, 7 states have (on average 489.42857142857144) internal successors, (3426), 7 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:48,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:48,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 548 [2023-11-21 20:59:48,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:49,642 INFO L124 PetriNetUnfolderBase]: 266/4410 cut-off events. [2023-11-21 20:59:49,643 INFO L125 PetriNetUnfolderBase]: For 321/348 co-relation queries the response was YES. [2023-11-21 20:59:49,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 4410 events. 266/4410 cut-off events. For 321/348 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 35860 event pairs, 36 based on Foata normal form. 3/4058 useless extension candidates. Maximal degree in co-relation 5474. Up to 209 conditions per place. [2023-11-21 20:59:49,699 INFO L140 encePairwiseOnDemand]: 519/548 looper letters, 40 selfloop transitions, 42 changer transitions 0/514 dead transitions. [2023-11-21 20:59:49,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 514 transitions, 1597 flow [2023-11-21 20:59:49,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-21 20:59:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-21 20:59:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4933 transitions. [2023-11-21 20:59:49,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9001824817518248 [2023-11-21 20:59:49,715 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 4933 transitions. [2023-11-21 20:59:49,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 4933 transitions. [2023-11-21 20:59:49,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:49,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 4933 transitions. [2023-11-21 20:59:49,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 493.3) internal successors, (4933), 10 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:49,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:49,745 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 548.0) internal successors, (6028), 11 states have internal predecessors, (6028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:49,745 INFO L175 Difference]: Start difference. First operand has 484 places, 494 transitions, 1365 flow. Second operand 10 states and 4933 transitions. [2023-11-21 20:59:49,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 514 transitions, 1597 flow [2023-11-21 20:59:49,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 514 transitions, 1524 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-21 20:59:49,760 INFO L231 Difference]: Finished difference. Result has 488 places, 496 transitions, 1397 flow [2023-11-21 20:59:49,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1292, PETRI_DIFFERENCE_MINUEND_PLACES=477, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=494, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1397, PETRI_PLACES=488, PETRI_TRANSITIONS=496} [2023-11-21 20:59:49,762 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 9 predicate places. [2023-11-21 20:59:49,762 INFO L495 AbstractCegarLoop]: Abstraction has has 488 places, 496 transitions, 1397 flow [2023-11-21 20:59:49,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 489.42857142857144) internal successors, (3426), 7 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:49,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:49,764 INFO L208 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] [2023-11-21 20:59:49,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 20:59:49,764 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:49,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:49,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1383619303, now seen corresponding path program 1 times [2023-11-21 20:59:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:49,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052939120] [2023-11-21 20:59:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:50,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:50,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:50,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052939120] [2023-11-21 20:59:50,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052939120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:50,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:50,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898394717] [2023-11-21 20:59:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:50,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:51,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 548 [2023-11-21 20:59:51,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 496 transitions, 1397 flow. Second operand has 6 states, 6 states have (on average 493.8333333333333) internal successors, (2963), 6 states have internal predecessors, (2963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:51,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:51,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 548 [2023-11-21 20:59:51,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:52,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][419], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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: 589#(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|)), 601#(= |#race~C~0| 0), 656#true, 604#true, Black: 599#true, 296#L87-7true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, 616#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 20:59:52,964 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-21 20:59:52,964 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 20:59:52,964 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-21 20:59:52,965 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 20:59:53,342 INFO L124 PetriNetUnfolderBase]: 388/5410 cut-off events. [2023-11-21 20:59:53,342 INFO L125 PetriNetUnfolderBase]: For 707/847 co-relation queries the response was YES. [2023-11-21 20:59:53,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7169 conditions, 5410 events. 388/5410 cut-off events. For 707/847 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 46311 event pairs, 8 based on Foata normal form. 44/5027 useless extension candidates. Maximal degree in co-relation 7111. Up to 472 conditions per place. [2023-11-21 20:59:53,419 INFO L140 encePairwiseOnDemand]: 538/548 looper letters, 47 selfloop transitions, 37 changer transitions 0/534 dead transitions. [2023-11-21 20:59:53,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 534 transitions, 1739 flow [2023-11-21 20:59:53,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:59:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3005 transitions. [2023-11-21 20:59:53,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9139294403892944 [2023-11-21 20:59:53,428 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3005 transitions. [2023-11-21 20:59:53,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3005 transitions. [2023-11-21 20:59:53,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:53,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3005 transitions. [2023-11-21 20:59:53,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 500.8333333333333) internal successors, (3005), 6 states have internal predecessors, (3005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:53,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:53,443 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:53,443 INFO L175 Difference]: Start difference. First operand has 488 places, 496 transitions, 1397 flow. Second operand 6 states and 3005 transitions. [2023-11-21 20:59:53,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 534 transitions, 1739 flow [2023-11-21 20:59:53,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 534 transitions, 1666 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-21 20:59:53,460 INFO L231 Difference]: Finished difference. Result has 491 places, 532 transitions, 1666 flow [2023-11-21 20:59:53,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=481, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1666, PETRI_PLACES=491, PETRI_TRANSITIONS=532} [2023-11-21 20:59:53,462 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 12 predicate places. [2023-11-21 20:59:53,462 INFO L495 AbstractCegarLoop]: Abstraction has has 491 places, 532 transitions, 1666 flow [2023-11-21 20:59:53,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 493.8333333333333) internal successors, (2963), 6 states have internal predecessors, (2963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:53,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:53,464 INFO L208 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] [2023-11-21 20:59:53,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 20:59:53,464 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:53,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:53,465 INFO L85 PathProgramCache]: Analyzing trace with hash -844920033, now seen corresponding path program 1 times [2023-11-21 20:59:53,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:53,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519841572] [2023-11-21 20:59:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:53,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 20:59:54,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:54,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519841572] [2023-11-21 20:59:54,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519841572] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:54,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:54,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:54,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321230890] [2023-11-21 20:59:54,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:54,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:54,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:54,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:54,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 492 out of 548 [2023-11-21 20:59:54,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 532 transitions, 1666 flow. Second operand has 6 states, 6 states have (on average 494.0) internal successors, (2964), 6 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:54,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:54,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 492 of 548 [2023-11-21 20:59:54,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 20:59:56,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][426], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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: 589#(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|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 296#L87-7true, Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 20:59:56,252 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-21 20:59:56,252 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 20:59:56,253 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-21 20:59:56,253 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 20:59:56,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][424], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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: 589#(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|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 599#true, Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 256#L88-2true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 20:59:56,299 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2023-11-21 20:59:56,299 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-21 20:59:56,299 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-21 20:59:56,299 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-21 20:59:56,318 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][427], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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: 589#(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|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 465#L88-3true, 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 20:59:56,318 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2023-11-21 20:59:56,318 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-21 20:59:56,318 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-21 20:59:56,318 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-21 20:59:56,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][425], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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: 589#(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|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 599#true, Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), 521#L88-4true, Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 20:59:56,338 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2023-11-21 20:59:56,338 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-21 20:59:56,338 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-21 20:59:56,338 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-21 20:59:56,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][423], [Black: 572#true, 42#L67-27true, 218#L88-5true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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: 589#(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|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 20:59:56,355 INFO L294 olderBase$Statistics]: this new event has 366 ancestors and is cut-off event [2023-11-21 20:59:56,355 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-21 20:59:56,355 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-21 20:59:56,355 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-21 20:59:56,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][423], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), 574#(= |#race~B~0| 0), Black: 587#(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: 589#(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|)), 601#(= |#race~C~0| 0), Black: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 656#true, 668#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 324#L88-6true, 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 20:59:56,372 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2023-11-21 20:59:56,372 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2023-11-21 20:59:56,373 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-21 20:59:56,373 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-21 20:59:56,798 INFO L124 PetriNetUnfolderBase]: 493/6094 cut-off events. [2023-11-21 20:59:56,798 INFO L125 PetriNetUnfolderBase]: For 2088/2355 co-relation queries the response was YES. [2023-11-21 20:59:56,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8829 conditions, 6094 events. 493/6094 cut-off events. For 2088/2355 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 53318 event pairs, 12 based on Foata normal form. 84/5709 useless extension candidates. Maximal degree in co-relation 8768. Up to 568 conditions per place. [2023-11-21 20:59:56,898 INFO L140 encePairwiseOnDemand]: 538/548 looper letters, 78 selfloop transitions, 53 changer transitions 0/585 dead transitions. [2023-11-21 20:59:56,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 585 transitions, 2323 flow [2023-11-21 20:59:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 20:59:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 20:59:56,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3004 transitions. [2023-11-21 20:59:56,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9136253041362531 [2023-11-21 20:59:56,909 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3004 transitions. [2023-11-21 20:59:56,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3004 transitions. [2023-11-21 20:59:56,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 20:59:56,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3004 transitions. [2023-11-21 20:59:56,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 500.6666666666667) internal successors, (3004), 6 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:56,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:56,925 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 548.0) internal successors, (3836), 7 states have internal predecessors, (3836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:56,926 INFO L175 Difference]: Start difference. First operand has 491 places, 532 transitions, 1666 flow. Second operand 6 states and 3004 transitions. [2023-11-21 20:59:56,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 496 places, 585 transitions, 2323 flow [2023-11-21 20:59:56,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 585 transitions, 2323 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-21 20:59:56,948 INFO L231 Difference]: Finished difference. Result has 501 places, 584 transitions, 2304 flow [2023-11-21 20:59:56,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=1666, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2304, PETRI_PLACES=501, PETRI_TRANSITIONS=584} [2023-11-21 20:59:56,950 INFO L281 CegarLoopForPetriNet]: 479 programPoint places, 22 predicate places. [2023-11-21 20:59:56,950 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 584 transitions, 2304 flow [2023-11-21 20:59:56,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 494.0) internal successors, (2964), 6 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:56,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 20:59:56,952 INFO L208 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] [2023-11-21 20:59:56,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 20:59:56,952 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2023-11-21 20:59:56,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 20:59:56,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1992841587, now seen corresponding path program 1 times [2023-11-21 20:59:56,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 20:59:56,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354999999] [2023-11-21 20:59:56,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 20:59:56,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 20:59:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 20:59:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-21 20:59:57,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 20:59:57,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354999999] [2023-11-21 20:59:57,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354999999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 20:59:57,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 20:59:57,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 20:59:57,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939592707] [2023-11-21 20:59:57,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 20:59:57,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 20:59:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 20:59:57,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 20:59:57,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-21 20:59:58,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 491 out of 548 [2023-11-21 20:59:58,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 584 transitions, 2304 flow. Second operand has 6 states, 6 states have (on average 494.5) internal successors, (2967), 6 states have internal predecessors, (2967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 20:59:58,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 20:59:58,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 491 of 548 [2023-11-21 20:59:58,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:00:02,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][432], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 601#(= |#race~C~0| 0), 668#true, 656#true, 680#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 296#L87-7true, Black: 599#true, Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 673#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 670#(= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 672#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 671#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 21:00:02,652 INFO L294 olderBase$Statistics]: this new event has 360 ancestors and is cut-off event [2023-11-21 21:00:02,652 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 21:00:02,653 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2023-11-21 21:00:02,653 INFO L297 olderBase$Statistics]: existing Event has 315 ancestors and is cut-off event [2023-11-21 21:00:02,812 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][422], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 601#(= |#race~C~0| 0), 668#true, 656#true, 680#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 599#true, Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), 256#L88-2true, Black: 673#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 670#(= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 565#(= |#race~A~0| 0), Black: 672#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 671#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 21:00:02,812 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2023-11-21 21:00:02,812 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-21 21:00:02,813 INFO L297 olderBase$Statistics]: existing Event has 318 ancestors and is cut-off event [2023-11-21 21:00:02,813 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is cut-off event [2023-11-21 21:00:02,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][427], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 601#(= |#race~C~0| 0), 668#true, 656#true, 680#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 673#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 670#(= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0), 565#(= |#race~A~0| 0), Black: 672#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 671#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 465#L88-3true, 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 21:00:02,865 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2023-11-21 21:00:02,865 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-21 21:00:02,865 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2023-11-21 21:00:02,865 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-21 21:00:03,063 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][429], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 601#(= |#race~C~0| 0), 668#true, 656#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 680#true, 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 599#true, Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 673#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 670#(= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0), 565#(= |#race~A~0| 0), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 672#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 671#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, 521#L88-4true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 21:00:03,063 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2023-11-21 21:00:03,063 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-21 21:00:03,063 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2023-11-21 21:00:03,063 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2023-11-21 21:00:03,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][433], [Black: 572#true, 42#L67-27true, 218#L88-5true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 601#(= |#race~C~0| 0), 668#true, 656#true, 680#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 673#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 670#(= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 672#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 671#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 21:00:03,110 INFO L294 olderBase$Statistics]: this new event has 366 ancestors and is cut-off event [2023-11-21 21:00:03,110 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-21 21:00:03,110 INFO L297 olderBase$Statistics]: existing Event has 276 ancestors and is cut-off event [2023-11-21 21:00:03,110 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2023-11-21 21:00:03,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1407] L67-26-->L67-27: 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~nondet13#1_3|)) |v_#race_41|) InVars {#race=|v_#race_42|, ~C~0.offset=v_~C~0.offset_2, thread3Thread1of1ForFork2_#t~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#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~nondet13#1=|v_thread3Thread1of1ForFork2_#t~nondet13#1_3|, ~C~0.base=v_~C~0.base_2, thread3Thread1of1ForFork2_~i~2#1=|v_thread3Thread1of1ForFork2_~i~2#1_39|} AuxVars[] AssignedVars[#race][433], [Black: 572#true, 42#L67-27true, Black: 642#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~N~0 0)), Black: 641#(<= ~N~0 0), Black: 582#(<= ~N~0 0), 574#(= |#race~B~0| 0), Black: 583#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= ~N~0 0)), Black: 587#(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: 589#(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: 658#(= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0), 601#(= |#race~C~0| 0), 668#true, 656#true, 680#true, Black: 659#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), 604#true, Black: 660#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0)), Black: 661#(and (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) |ULTIMATE.start_main_~#t2~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t2~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ |ULTIMATE.start_main_~#t2~0#1.offset| 1)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_~#t2~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t2~0#1.offset|)))), Black: 599#true, Black: 673#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 608#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 609#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 670#(= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0), 565#(= |#race~A~0| 0), Black: 606#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 672#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 671#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0)), Black: 607#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 324#L88-6true, 538#(= |#race~N~0| 0), Black: 563#true, Black: 621#(<= ~N~0 0), Black: 622#(and (<= ~N~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 636#true]) [2023-11-21 21:00:03,153 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2023-11-21 21:00:03,153 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2023-11-21 21:00:03,154 INFO L297 olderBase$Statistics]: existing Event has 277 ancestors and is cut-off event [2023-11-21 21:00:03,154 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event