./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc 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_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-word-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya --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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:28:50,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:28:50,451 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-29 02:28:50,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:28:50,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:28:50,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:28:50,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:28:50,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:28:50,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:28:50,480 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:28:50,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:28:50,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:28:50,482 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:28:50,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:28:50,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:28:50,483 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:28:50,484 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:28:50,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:28:50,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:28:50,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:28:50,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:28:50,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:28:50,487 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-29 02:28:50,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:28:50,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:28:50,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:28:50,488 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:28:50,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:28:50,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:28:50,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:28:50,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:28:50,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:28:50,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:28:50,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:28:50,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:28:50,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:28:50,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:28:50,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:28:50,491 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:28:50,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:28:50,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:28:50,492 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_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/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_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2023-11-29 02:28:50,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:28:50,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:28:50,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:28:50,758 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:28:50,758 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:28:50,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2023-11-29 02:28:53,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:28:53,786 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:28:53,787 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2023-11-29 02:28:53,796 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/data/4d15cf0c5/7c34b802a3bd45e0bbc4118d300d5897/FLAG010af4ec7 [2023-11-29 02:28:53,809 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/data/4d15cf0c5/7c34b802a3bd45e0bbc4118d300d5897 [2023-11-29 02:28:53,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:28:53,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:28:53,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:28:53,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:28:53,820 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:28:53,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:28:53" (1/1) ... [2023-11-29 02:28:53,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@123b0965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:53, skipping insertion in model container [2023-11-29 02:28:53,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:28:53" (1/1) ... [2023-11-29 02:28:53,849 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:28:54,071 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:28:54,082 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:28:54,129 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:28:54,147 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:28:54,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54 WrapperNode [2023-11-29 02:28:54,148 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:28:54,149 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:28:54,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:28:54,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:28:54,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,207 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 281 [2023-11-29 02:28:54,208 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:28:54,209 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:28:54,209 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:28:54,209 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:28:54,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,228 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,262 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,275 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:28:54,276 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:28:54,276 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:28:54,276 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:28:54,277 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (1/1) ... [2023-11-29 02:28:54,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:28:54,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:28:54,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:28:54,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:28:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:28:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:28:54,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 02:28:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 02:28:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 02:28:54,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 02:28:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 02:28:54,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 02:28:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 02:28:54,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 02:28:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 02:28:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:28:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:28:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:28:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:28:54,350 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 02:28:54,486 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:28:54,489 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:28:55,293 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:28:55,315 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:28:55,315 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-29 02:28:55,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:55 BoogieIcfgContainer [2023-11-29 02:28:55,317 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:28:55,320 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:28:55,320 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:28:55,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:28:55,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:28:53" (1/3) ... [2023-11-29 02:28:55,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37291a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:28:55, skipping insertion in model container [2023-11-29 02:28:55,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:54" (2/3) ... [2023-11-29 02:28:55,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37291a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:28:55, skipping insertion in model container [2023-11-29 02:28:55,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:55" (3/3) ... [2023-11-29 02:28:55,327 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2023-11-29 02:28:55,336 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-29 02:28:55,348 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:28:55,348 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2023-11-29 02:28:55,349 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:28:55,537 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 02:28:55,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 662 places, 685 transitions, 1391 flow [2023-11-29 02:28:55,927 INFO L124 PetriNetUnfolderBase]: 33/682 cut-off events. [2023-11-29 02:28:55,927 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 02:28:55,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 695 conditions, 682 events. 33/682 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1774 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2023-11-29 02:28:55,947 INFO L82 GeneralOperation]: Start removeDead. Operand has 662 places, 685 transitions, 1391 flow [2023-11-29 02:28:55,965 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 635 places, 656 transitions, 1330 flow [2023-11-29 02:28:55,976 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:28:55,984 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;@f2fcb15, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:28:55,984 INFO L358 AbstractCegarLoop]: Starting to check reachability of 140 error locations. [2023-11-29 02:28:55,990 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:28:55,990 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2023-11-29 02:28:55,990 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:28:55,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:55,991 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] [2023-11-29 02:28:55,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:28:55,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:55,997 INFO L85 PathProgramCache]: Analyzing trace with hash 618701980, now seen corresponding path program 1 times [2023-11-29 02:28:56,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:56,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060130774] [2023-11-29 02:28:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:56,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:56,219 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-29 02:28:56,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060130774] [2023-11-29 02:28:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060130774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:56,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:28:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353595471] [2023-11-29 02:28:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:56,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:56,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:56,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:56,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:56,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 685 [2023-11-29 02:28:56,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 656 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:28:56,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:56,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 685 [2023-11-29 02:28:56,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:56,896 INFO L124 PetriNetUnfolderBase]: 78/1542 cut-off events. [2023-11-29 02:28:56,896 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-29 02:28:56,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1629 conditions, 1542 events. 78/1542 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9339 event pairs, 20 based on Foata normal form. 30/1270 useless extension candidates. Maximal degree in co-relation 1207. Up to 50 conditions per place. [2023-11-29 02:28:56,927 INFO L140 encePairwiseOnDemand]: 669/685 looper letters, 13 selfloop transitions, 2 changer transitions 7/642 dead transitions. [2023-11-29 02:28:56,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 642 transitions, 1332 flow [2023-11-29 02:28:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:28:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:28:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1988 transitions. [2023-11-29 02:28:56,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9673965936739659 [2023-11-29 02:28:56,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1988 transitions. [2023-11-29 02:28:56,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1988 transitions. [2023-11-29 02:28:56,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:56,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1988 transitions. [2023-11-29 02:28:56,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.6666666666666) internal successors, (1988), 3 states have internal predecessors, (1988), 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-29 02:28:56,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:56,982 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:56,984 INFO L175 Difference]: Start difference. First operand has 635 places, 656 transitions, 1330 flow. Second operand 3 states and 1988 transitions. [2023-11-29 02:28:56,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 642 transitions, 1332 flow [2023-11-29 02:28:56,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 642 transitions, 1320 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 02:28:57,008 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1280 flow [2023-11-29 02:28:57,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1290, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1280, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2023-11-29 02:28:57,015 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -5 predicate places. [2023-11-29 02:28:57,016 INFO L495 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1280 flow [2023-11-29 02:28:57,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:28:57,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:57,018 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] [2023-11-29 02:28:57,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:28:57,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:28:57,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2007662114, now seen corresponding path program 1 times [2023-11-29 02:28:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571359012] [2023-11-29 02:28:57,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:57,087 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-29 02:28:57,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:57,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571359012] [2023-11-29 02:28:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571359012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:57,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:57,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:28:57,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447531739] [2023-11-29 02:28:57,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:57,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:57,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:57,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:57,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 685 [2023-11-29 02:28:57,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1280 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:28:57,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:57,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 685 [2023-11-29 02:28:57,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:57,502 INFO L124 PetriNetUnfolderBase]: 50/1110 cut-off events. [2023-11-29 02:28:57,502 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 02:28:57,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 1110 events. 50/1110 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5532 event pairs, 12 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 1124. Up to 38 conditions per place. [2023-11-29 02:28:57,530 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/634 dead transitions. [2023-11-29 02:28:57,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 634 transitions, 1308 flow [2023-11-29 02:28:57,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:28:57,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:28:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2023-11-29 02:28:57,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2023-11-29 02:28:57,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2023-11-29 02:28:57,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2023-11-29 02:28:57,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:57,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2023-11-29 02:28:57,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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-29 02:28:57,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:57,560 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:57,560 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1280 flow. Second operand 3 states and 1975 transitions. [2023-11-29 02:28:57,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 634 transitions, 1308 flow [2023-11-29 02:28:57,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 634 transitions, 1304 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:28:57,578 INFO L231 Difference]: Finished difference. Result has 622 places, 634 transitions, 1278 flow [2023-11-29 02:28:57,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1274, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1278, PETRI_PLACES=622, PETRI_TRANSITIONS=634} [2023-11-29 02:28:57,581 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -13 predicate places. [2023-11-29 02:28:57,581 INFO L495 AbstractCegarLoop]: Abstraction has has 622 places, 634 transitions, 1278 flow [2023-11-29 02:28:57,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:28:57,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:57,584 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] [2023-11-29 02:28:57,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:28:57,584 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:28:57,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:57,585 INFO L85 PathProgramCache]: Analyzing trace with hash 614960525, now seen corresponding path program 1 times [2023-11-29 02:28:57,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:57,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849412161] [2023-11-29 02:28:57,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:57,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:57,649 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-29 02:28:57,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:57,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849412161] [2023-11-29 02:28:57,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849412161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:57,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:57,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:28:57,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342136914] [2023-11-29 02:28:57,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:57,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:57,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:57,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:57,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 685 [2023-11-29 02:28:57,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 634 transitions, 1278 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:28:57,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:57,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 685 [2023-11-29 02:28:57,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:58,104 INFO L124 PetriNetUnfolderBase]: 78/1509 cut-off events. [2023-11-29 02:28:58,104 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 02:28:58,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1570 conditions, 1509 events. 78/1509 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8413 event pairs, 20 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 1525. Up to 50 conditions per place. [2023-11-29 02:28:58,134 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2023-11-29 02:28:58,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 633 transitions, 1306 flow [2023-11-29 02:28:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:28:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:28:58,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2023-11-29 02:28:58,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2023-11-29 02:28:58,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2023-11-29 02:28:58,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2023-11-29 02:28:58,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:58,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2023-11-29 02:28:58,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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-29 02:28:58,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:58,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:58,159 INFO L175 Difference]: Start difference. First operand has 622 places, 634 transitions, 1278 flow. Second operand 3 states and 1975 transitions. [2023-11-29 02:28:58,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 633 transitions, 1306 flow [2023-11-29 02:28:58,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 633 transitions, 1302 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:28:58,174 INFO L231 Difference]: Finished difference. Result has 621 places, 633 transitions, 1276 flow [2023-11-29 02:28:58,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1276, PETRI_PLACES=621, PETRI_TRANSITIONS=633} [2023-11-29 02:28:58,176 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -14 predicate places. [2023-11-29 02:28:58,176 INFO L495 AbstractCegarLoop]: Abstraction has has 621 places, 633 transitions, 1276 flow [2023-11-29 02:28:58,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:28:58,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:58,179 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] [2023-11-29 02:28:58,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:28:58,179 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:28:58,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash -353379854, now seen corresponding path program 1 times [2023-11-29 02:28:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183984343] [2023-11-29 02:28:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:58,238 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-29 02:28:58,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:58,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183984343] [2023-11-29 02:28:58,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183984343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:58,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:58,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:28:58,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284971304] [2023-11-29 02:28:58,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:58,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:58,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:58,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:58,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:58,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 652 out of 685 [2023-11-29 02:28:58,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 633 transitions, 1276 flow. Second operand has 3 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 02:28:58,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:58,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 652 of 685 [2023-11-29 02:28:58,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:58,787 INFO L124 PetriNetUnfolderBase]: 88/1882 cut-off events. [2023-11-29 02:28:58,787 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 02:28:58,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 1882 events. 88/1882 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 12528 event pairs, 20 based on Foata normal form. 0/1531 useless extension candidates. Maximal degree in co-relation 1899. Up to 51 conditions per place. [2023-11-29 02:28:58,819 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/632 dead transitions. [2023-11-29 02:28:58,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 632 transitions, 1306 flow [2023-11-29 02:28:58,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:28:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:28:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1973 transitions. [2023-11-29 02:28:58,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9600973236009732 [2023-11-29 02:28:58,826 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1973 transitions. [2023-11-29 02:28:58,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1973 transitions. [2023-11-29 02:28:58,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:58,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1973 transitions. [2023-11-29 02:28:58,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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-29 02:28:58,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:58,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:58,844 INFO L175 Difference]: Start difference. First operand has 621 places, 633 transitions, 1276 flow. Second operand 3 states and 1973 transitions. [2023-11-29 02:28:58,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 632 transitions, 1306 flow [2023-11-29 02:28:58,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 632 transitions, 1302 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:28:58,857 INFO L231 Difference]: Finished difference. Result has 620 places, 632 transitions, 1274 flow [2023-11-29 02:28:58,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1270, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1274, PETRI_PLACES=620, PETRI_TRANSITIONS=632} [2023-11-29 02:28:58,860 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -15 predicate places. [2023-11-29 02:28:58,860 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 632 transitions, 1274 flow [2023-11-29 02:28:58,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 02:28:58,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:58,862 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] [2023-11-29 02:28:58,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:28:58,862 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:28:58,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:58,863 INFO L85 PathProgramCache]: Analyzing trace with hash -777997135, now seen corresponding path program 1 times [2023-11-29 02:28:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103485239] [2023-11-29 02:28:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:58,912 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-29 02:28:58,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:58,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103485239] [2023-11-29 02:28:58,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103485239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:58,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:58,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:28:58,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328527919] [2023-11-29 02:28:58,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:58,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:58,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:58,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:58,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:58,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 652 out of 685 [2023-11-29 02:28:58,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 632 transitions, 1274 flow. Second operand has 3 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 02:28:58,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:58,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 652 of 685 [2023-11-29 02:28:58,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:59,288 INFO L124 PetriNetUnfolderBase]: 59/1304 cut-off events. [2023-11-29 02:28:59,289 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-11-29 02:28:59,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1304 events. 59/1304 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6857 event pairs, 12 based on Foata normal form. 0/1074 useless extension candidates. Maximal degree in co-relation 1298. Up to 42 conditions per place. [2023-11-29 02:28:59,310 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/631 dead transitions. [2023-11-29 02:28:59,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 631 transitions, 1304 flow [2023-11-29 02:28:59,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:28:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:28:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1973 transitions. [2023-11-29 02:28:59,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9600973236009732 [2023-11-29 02:28:59,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1973 transitions. [2023-11-29 02:28:59,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1973 transitions. [2023-11-29 02:28:59,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:59,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1973 transitions. [2023-11-29 02:28:59,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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-29 02:28:59,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:59,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:59,332 INFO L175 Difference]: Start difference. First operand has 620 places, 632 transitions, 1274 flow. Second operand 3 states and 1973 transitions. [2023-11-29 02:28:59,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 631 transitions, 1304 flow [2023-11-29 02:28:59,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 631 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:28:59,346 INFO L231 Difference]: Finished difference. Result has 619 places, 631 transitions, 1272 flow [2023-11-29 02:28:59,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1272, PETRI_PLACES=619, PETRI_TRANSITIONS=631} [2023-11-29 02:28:59,348 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -16 predicate places. [2023-11-29 02:28:59,349 INFO L495 AbstractCegarLoop]: Abstraction has has 619 places, 631 transitions, 1272 flow [2023-11-29 02:28:59,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 02:28:59,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:59,350 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] [2023-11-29 02:28:59,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:28:59,351 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:28:59,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:59,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1764077194, now seen corresponding path program 1 times [2023-11-29 02:28:59,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:59,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266983262] [2023-11-29 02:28:59,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:59,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:59,398 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-29 02:28:59,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:59,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266983262] [2023-11-29 02:28:59,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266983262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:59,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:59,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:28:59,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576008649] [2023-11-29 02:28:59,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:59,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:59,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:59,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:59,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 652 out of 685 [2023-11-29 02:28:59,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 631 transitions, 1272 flow. Second operand has 3 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 02:28:59,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:59,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 652 of 685 [2023-11-29 02:28:59,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:28:59,708 INFO L124 PetriNetUnfolderBase]: 48/984 cut-off events. [2023-11-29 02:28:59,709 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 02:28:59,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 984 events. 48/984 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4587 event pairs, 20 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 977. Up to 51 conditions per place. [2023-11-29 02:28:59,722 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/630 dead transitions. [2023-11-29 02:28:59,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 630 transitions, 1302 flow [2023-11-29 02:28:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:28:59,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:28:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1973 transitions. [2023-11-29 02:28:59,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9600973236009732 [2023-11-29 02:28:59,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1973 transitions. [2023-11-29 02:28:59,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1973 transitions. [2023-11-29 02:28:59,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:28:59,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1973 transitions. [2023-11-29 02:28:59,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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-29 02:28:59,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:59,745 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:28:59,745 INFO L175 Difference]: Start difference. First operand has 619 places, 631 transitions, 1272 flow. Second operand 3 states and 1973 transitions. [2023-11-29 02:28:59,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 630 transitions, 1302 flow [2023-11-29 02:28:59,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 630 transitions, 1298 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:28:59,758 INFO L231 Difference]: Finished difference. Result has 618 places, 630 transitions, 1270 flow [2023-11-29 02:28:59,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1266, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=630, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1270, PETRI_PLACES=618, PETRI_TRANSITIONS=630} [2023-11-29 02:28:59,760 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -17 predicate places. [2023-11-29 02:28:59,760 INFO L495 AbstractCegarLoop]: Abstraction has has 618 places, 630 transitions, 1270 flow [2023-11-29 02:28:59,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 653.3333333333334) internal successors, (1960), 3 states have internal predecessors, (1960), 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-29 02:28:59,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:28:59,762 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] [2023-11-29 02:28:59,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:28:59,763 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:28:59,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash 392216525, now seen corresponding path program 1 times [2023-11-29 02:28:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598863198] [2023-11-29 02:28:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:59,807 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-29 02:28:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598863198] [2023-11-29 02:28:59,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598863198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:59,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:59,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:28:59,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758672259] [2023-11-29 02:28:59,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:59,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:28:59,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:59,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:28:59,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:28:59,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 685 [2023-11-29 02:28:59,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 630 transitions, 1270 flow. Second operand has 3 states, 3 states have (on average 649.0) internal successors, (1947), 3 states have internal predecessors, (1947), 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-29 02:28:59,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:28:59,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 685 [2023-11-29 02:28:59,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:00,343 INFO L124 PetriNetUnfolderBase]: 165/2391 cut-off events. [2023-11-29 02:29:00,344 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 02:29:00,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2579 conditions, 2391 events. 165/2391 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18414 event pairs, 64 based on Foata normal form. 0/1962 useless extension candidates. Maximal degree in co-relation 2502. Up to 151 conditions per place. [2023-11-29 02:29:00,382 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 16 selfloop transitions, 1 changer transitions 0/625 dead transitions. [2023-11-29 02:29:00,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 625 transitions, 1294 flow [2023-11-29 02:29:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1966 transitions. [2023-11-29 02:29:00,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.95669099756691 [2023-11-29 02:29:00,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1966 transitions. [2023-11-29 02:29:00,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1966 transitions. [2023-11-29 02:29:00,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:00,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1966 transitions. [2023-11-29 02:29:00,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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-29 02:29:00,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:00,402 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:00,402 INFO L175 Difference]: Start difference. First operand has 618 places, 630 transitions, 1270 flow. Second operand 3 states and 1966 transitions. [2023-11-29 02:29:00,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 625 transitions, 1294 flow [2023-11-29 02:29:00,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 625 transitions, 1290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:00,415 INFO L231 Difference]: Finished difference. Result has 613 places, 625 transitions, 1258 flow [2023-11-29 02:29:00,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1258, PETRI_PLACES=613, PETRI_TRANSITIONS=625} [2023-11-29 02:29:00,417 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -22 predicate places. [2023-11-29 02:29:00,417 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 625 transitions, 1258 flow [2023-11-29 02:29:00,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.0) internal successors, (1947), 3 states have internal predecessors, (1947), 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-29 02:29:00,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:00,418 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] [2023-11-29 02:29:00,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:29:00,418 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:00,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:00,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1875766911, now seen corresponding path program 1 times [2023-11-29 02:29:00,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:00,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713158692] [2023-11-29 02:29:00,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:00,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,487 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-29 02:29:00,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:00,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713158692] [2023-11-29 02:29:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713158692] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:00,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:00,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357664731] [2023-11-29 02:29:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:00,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:00,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:00,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:00,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:00,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 685 [2023-11-29 02:29:00,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 625 transitions, 1258 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:29:00,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:00,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 685 [2023-11-29 02:29:00,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:00,947 INFO L124 PetriNetUnfolderBase]: 88/1870 cut-off events. [2023-11-29 02:29:00,947 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 02:29:00,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1870 events. 88/1870 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11461 event pairs, 20 based on Foata normal form. 0/1529 useless extension candidates. Maximal degree in co-relation 1861. Up to 50 conditions per place. [2023-11-29 02:29:00,974 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/624 dead transitions. [2023-11-29 02:29:00,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 624 transitions, 1286 flow [2023-11-29 02:29:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:00,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2023-11-29 02:29:00,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2023-11-29 02:29:00,981 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2023-11-29 02:29:00,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2023-11-29 02:29:00,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:00,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2023-11-29 02:29:00,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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-29 02:29:00,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:00,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:00,993 INFO L175 Difference]: Start difference. First operand has 613 places, 625 transitions, 1258 flow. Second operand 3 states and 1975 transitions. [2023-11-29 02:29:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 624 transitions, 1286 flow [2023-11-29 02:29:00,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 624 transitions, 1285 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:29:01,005 INFO L231 Difference]: Finished difference. Result has 613 places, 624 transitions, 1259 flow [2023-11-29 02:29:01,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1255, PETRI_DIFFERENCE_MINUEND_PLACES=611, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=624, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1259, PETRI_PLACES=613, PETRI_TRANSITIONS=624} [2023-11-29 02:29:01,007 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -22 predicate places. [2023-11-29 02:29:01,008 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 624 transitions, 1259 flow [2023-11-29 02:29:01,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:29:01,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:01,009 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] [2023-11-29 02:29:01,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:29:01,009 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:01,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1976246175, now seen corresponding path program 1 times [2023-11-29 02:29:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136178639] [2023-11-29 02:29:01,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:01,609 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-29 02:29:01,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:01,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136178639] [2023-11-29 02:29:01,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136178639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:01,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:01,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:29:01,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946398672] [2023-11-29 02:29:01,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:01,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:01,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:01,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:01,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:02,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 562 out of 685 [2023-11-29 02:29:02,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 624 transitions, 1259 flow. Second operand has 6 states, 6 states have (on average 563.5) internal successors, (3381), 6 states have internal predecessors, (3381), 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-29 02:29:02,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:02,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 562 of 685 [2023-11-29 02:29:02,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:49,111 INFO L124 PetriNetUnfolderBase]: 78707/250876 cut-off events. [2023-11-29 02:29:49,111 INFO L125 PetriNetUnfolderBase]: For 909/1075 co-relation queries the response was YES. [2023-11-29 02:29:50,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350578 conditions, 250876 events. 78707/250876 cut-off events. For 909/1075 co-relation queries the response was YES. Maximal size of possible extension queue 4899. Compared 3894479 event pairs, 67808 based on Foata normal form. 0/212262 useless extension candidates. Maximal degree in co-relation 350502. Up to 99375 conditions per place. [2023-11-29 02:29:51,569 INFO L140 encePairwiseOnDemand]: 667/685 looper letters, 90 selfloop transitions, 15 changer transitions 0/621 dead transitions. [2023-11-29 02:29:51,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 621 transitions, 1463 flow [2023-11-29 02:29:51,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:29:51,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:29:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3480 transitions. [2023-11-29 02:29:51,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8467153284671532 [2023-11-29 02:29:51,578 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3480 transitions. [2023-11-29 02:29:51,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3480 transitions. [2023-11-29 02:29:51,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:51,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3480 transitions. [2023-11-29 02:29:51,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 580.0) internal successors, (3480), 6 states have internal predecessors, (3480), 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-29 02:29:51,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:29:51,594 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:29:51,594 INFO L175 Difference]: Start difference. First operand has 613 places, 624 transitions, 1259 flow. Second operand 6 states and 3480 transitions. [2023-11-29 02:29:51,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 621 transitions, 1463 flow [2023-11-29 02:29:51,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 621 transitions, 1459 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:51,603 INFO L231 Difference]: Finished difference. Result has 613 places, 621 transitions, 1279 flow [2023-11-29 02:29:51,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1249, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1279, PETRI_PLACES=613, PETRI_TRANSITIONS=621} [2023-11-29 02:29:51,605 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -22 predicate places. [2023-11-29 02:29:51,605 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 621 transitions, 1279 flow [2023-11-29 02:29:51,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 563.5) internal successors, (3381), 6 states have internal predecessors, (3381), 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-29 02:29:51,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:51,606 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] [2023-11-29 02:29:51,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:29:51,606 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:51,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:51,607 INFO L85 PathProgramCache]: Analyzing trace with hash 537604945, now seen corresponding path program 1 times [2023-11-29 02:29:51,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:51,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851026045] [2023-11-29 02:29:51,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:51,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-29 02:29:51,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:51,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851026045] [2023-11-29 02:29:51,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851026045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:51,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:51,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100558321] [2023-11-29 02:29:51,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:51,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:51,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:51,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:51,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:51,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 685 [2023-11-29 02:29:51,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 621 transitions, 1279 flow. Second operand has 3 states, 3 states have (on average 649.0) internal successors, (1947), 3 states have internal predecessors, (1947), 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-29 02:29:51,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:51,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 685 [2023-11-29 02:29:51,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:52,078 INFO L124 PetriNetUnfolderBase]: 113/1737 cut-off events. [2023-11-29 02:29:52,078 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 02:29:52,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1737 events. 113/1737 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 11200 event pairs, 32 based on Foata normal form. 0/1451 useless extension candidates. Maximal degree in co-relation 1822. Up to 102 conditions per place. [2023-11-29 02:29:52,104 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 16 selfloop transitions, 1 changer transitions 0/616 dead transitions. [2023-11-29 02:29:52,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 616 transitions, 1303 flow [2023-11-29 02:29:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1966 transitions. [2023-11-29 02:29:52,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.95669099756691 [2023-11-29 02:29:52,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1966 transitions. [2023-11-29 02:29:52,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1966 transitions. [2023-11-29 02:29:52,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:52,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1966 transitions. [2023-11-29 02:29:52,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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-29 02:29:52,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:52,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:52,118 INFO L175 Difference]: Start difference. First operand has 613 places, 621 transitions, 1279 flow. Second operand 3 states and 1966 transitions. [2023-11-29 02:29:52,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 616 transitions, 1303 flow [2023-11-29 02:29:52,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 616 transitions, 1273 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:29:52,129 INFO L231 Difference]: Finished difference. Result has 605 places, 616 transitions, 1241 flow [2023-11-29 02:29:52,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=616, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1241, PETRI_PLACES=605, PETRI_TRANSITIONS=616} [2023-11-29 02:29:52,131 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -30 predicate places. [2023-11-29 02:29:52,131 INFO L495 AbstractCegarLoop]: Abstraction has has 605 places, 616 transitions, 1241 flow [2023-11-29 02:29:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.0) internal successors, (1947), 3 states have internal predecessors, (1947), 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-29 02:29:52,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:52,132 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] [2023-11-29 02:29:52,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:29:52,133 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:52,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1982786160, now seen corresponding path program 1 times [2023-11-29 02:29:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986642110] [2023-11-29 02:29:52,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:52,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:52,179 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-29 02:29:52,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:52,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986642110] [2023-11-29 02:29:52,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986642110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:52,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:52,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:52,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124226952] [2023-11-29 02:29:52,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:52,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:52,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:52,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:52,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 685 [2023-11-29 02:29:52,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 616 transitions, 1241 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:29:52,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:52,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 685 [2023-11-29 02:29:52,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:52,534 INFO L124 PetriNetUnfolderBase]: 50/1135 cut-off events. [2023-11-29 02:29:52,534 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 02:29:52,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1135 events. 50/1135 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5425 event pairs, 12 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1109. Up to 38 conditions per place. [2023-11-29 02:29:52,547 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/615 dead transitions. [2023-11-29 02:29:52,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 615 transitions, 1269 flow [2023-11-29 02:29:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:52,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2023-11-29 02:29:52,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2023-11-29 02:29:52,552 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2023-11-29 02:29:52,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2023-11-29 02:29:52,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:52,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2023-11-29 02:29:52,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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-29 02:29:52,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:52,561 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:52,561 INFO L175 Difference]: Start difference. First operand has 605 places, 616 transitions, 1241 flow. Second operand 3 states and 1975 transitions. [2023-11-29 02:29:52,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 615 transitions, 1269 flow [2023-11-29 02:29:52,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 615 transitions, 1268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:29:52,574 INFO L231 Difference]: Finished difference. Result has 605 places, 615 transitions, 1242 flow [2023-11-29 02:29:52,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1238, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1242, PETRI_PLACES=605, PETRI_TRANSITIONS=615} [2023-11-29 02:29:52,576 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -30 predicate places. [2023-11-29 02:29:52,576 INFO L495 AbstractCegarLoop]: Abstraction has has 605 places, 615 transitions, 1242 flow [2023-11-29 02:29:52,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:29:52,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:52,577 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-29 02:29:52,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:29:52,577 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:52,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1804052888, now seen corresponding path program 1 times [2023-11-29 02:29:52,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:52,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431034164] [2023-11-29 02:29:52,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:52,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:52,627 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-29 02:29:52,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:52,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431034164] [2023-11-29 02:29:52,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431034164] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:52,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:52,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:52,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136688358] [2023-11-29 02:29:52,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:52,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:52,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:52,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:52,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:52,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 648 out of 685 [2023-11-29 02:29:52,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 615 transitions, 1242 flow. Second operand has 3 states, 3 states have (on average 649.0) internal successors, (1947), 3 states have internal predecessors, (1947), 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-29 02:29:52,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:52,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 648 of 685 [2023-11-29 02:29:52,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:53,137 INFO L124 PetriNetUnfolderBase]: 174/2078 cut-off events. [2023-11-29 02:29:53,138 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2023-11-29 02:29:53,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 2078 events. 174/2078 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14248 event pairs, 64 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2190. Up to 174 conditions per place. [2023-11-29 02:29:53,166 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 16 selfloop transitions, 1 changer transitions 0/610 dead transitions. [2023-11-29 02:29:53,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 610 transitions, 1266 flow [2023-11-29 02:29:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:53,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1966 transitions. [2023-11-29 02:29:53,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.95669099756691 [2023-11-29 02:29:53,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1966 transitions. [2023-11-29 02:29:53,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1966 transitions. [2023-11-29 02:29:53,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:53,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1966 transitions. [2023-11-29 02:29:53,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 655.3333333333334) internal successors, (1966), 3 states have internal predecessors, (1966), 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-29 02:29:53,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:53,179 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:53,179 INFO L175 Difference]: Start difference. First operand has 605 places, 615 transitions, 1242 flow. Second operand 3 states and 1966 transitions. [2023-11-29 02:29:53,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 610 transitions, 1266 flow [2023-11-29 02:29:53,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 610 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:53,188 INFO L231 Difference]: Finished difference. Result has 600 places, 610 transitions, 1230 flow [2023-11-29 02:29:53,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=600, PETRI_TRANSITIONS=610} [2023-11-29 02:29:53,190 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -35 predicate places. [2023-11-29 02:29:53,190 INFO L495 AbstractCegarLoop]: Abstraction has has 600 places, 610 transitions, 1230 flow [2023-11-29 02:29:53,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 649.0) internal successors, (1947), 3 states have internal predecessors, (1947), 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-29 02:29:53,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:53,192 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] [2023-11-29 02:29:53,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:29:53,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:53,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1750414585, now seen corresponding path program 1 times [2023-11-29 02:29:53,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:53,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578803626] [2023-11-29 02:29:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:53,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:53,240 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-29 02:29:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:53,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578803626] [2023-11-29 02:29:53,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578803626] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:53,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:53,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007029081] [2023-11-29 02:29:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:53,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:53,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:53,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 653 out of 685 [2023-11-29 02:29:53,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:29:53,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:53,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 653 of 685 [2023-11-29 02:29:53,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:53,449 INFO L124 PetriNetUnfolderBase]: 48/955 cut-off events. [2023-11-29 02:29:53,449 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-29 02:29:53,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1017 conditions, 955 events. 48/955 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4007 event pairs, 20 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 940. Up to 50 conditions per place. [2023-11-29 02:29:53,461 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2023-11-29 02:29:53,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 609 transitions, 1258 flow [2023-11-29 02:29:53,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2023-11-29 02:29:53,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610705596107056 [2023-11-29 02:29:53,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1975 transitions. [2023-11-29 02:29:53,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1975 transitions. [2023-11-29 02:29:53,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:53,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1975 transitions. [2023-11-29 02:29:53,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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-29 02:29:53,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:53,474 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:53,474 INFO L175 Difference]: Start difference. First operand has 600 places, 610 transitions, 1230 flow. Second operand 3 states and 1975 transitions. [2023-11-29 02:29:53,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 609 transitions, 1258 flow [2023-11-29 02:29:53,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 609 transitions, 1257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:29:53,483 INFO L231 Difference]: Finished difference. Result has 600 places, 609 transitions, 1231 flow [2023-11-29 02:29:53,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1227, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1231, PETRI_PLACES=600, PETRI_TRANSITIONS=609} [2023-11-29 02:29:53,485 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -35 predicate places. [2023-11-29 02:29:53,485 INFO L495 AbstractCegarLoop]: Abstraction has has 600 places, 609 transitions, 1231 flow [2023-11-29 02:29:53,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 654.3333333333334) internal successors, (1963), 3 states have internal predecessors, (1963), 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-29 02:29:53,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:53,486 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] [2023-11-29 02:29:53,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:29:53,486 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:53,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:53,487 INFO L85 PathProgramCache]: Analyzing trace with hash -943841369, now seen corresponding path program 1 times [2023-11-29 02:29:53,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:53,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097310809] [2023-11-29 02:29:53,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:53,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:53,542 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-29 02:29:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097310809] [2023-11-29 02:29:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097310809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896431874] [2023-11-29 02:29:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:53,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:53,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:53,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:53,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 685 [2023-11-29 02:29:53,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 609 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 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-29 02:29:53,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:53,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 685 [2023-11-29 02:29:53,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:53,955 INFO L124 PetriNetUnfolderBase]: 157/2258 cut-off events. [2023-11-29 02:29:53,955 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 02:29:53,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 2258 events. 157/2258 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 17264 event pairs, 53 based on Foata normal form. 0/1902 useless extension candidates. Maximal degree in co-relation 2347. Up to 123 conditions per place. [2023-11-29 02:29:53,980 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 17 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2023-11-29 02:29:53,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 609 transitions, 1271 flow [2023-11-29 02:29:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions. [2023-11-29 02:29:53,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9615571776155718 [2023-11-29 02:29:53,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions. [2023-11-29 02:29:53,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions. [2023-11-29 02:29:53,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:53,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions. [2023-11-29 02:29:53,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 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-29 02:29:53,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:53,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:53,993 INFO L175 Difference]: Start difference. First operand has 600 places, 609 transitions, 1231 flow. Second operand 3 states and 1976 transitions. [2023-11-29 02:29:53,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 609 transitions, 1271 flow [2023-11-29 02:29:53,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 609 transitions, 1267 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:54,008 INFO L231 Difference]: Finished difference. Result has 597 places, 607 transitions, 1233 flow [2023-11-29 02:29:54,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1219, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1233, PETRI_PLACES=597, PETRI_TRANSITIONS=607} [2023-11-29 02:29:54,010 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -38 predicate places. [2023-11-29 02:29:54,010 INFO L495 AbstractCegarLoop]: Abstraction has has 597 places, 607 transitions, 1233 flow [2023-11-29 02:29:54,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 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-29 02:29:54,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:54,011 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] [2023-11-29 02:29:54,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:29:54,011 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:54,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:54,012 INFO L85 PathProgramCache]: Analyzing trace with hash -793406871, now seen corresponding path program 1 times [2023-11-29 02:29:54,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:54,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377326255] [2023-11-29 02:29:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:54,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:54,068 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-29 02:29:54,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:54,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377326255] [2023-11-29 02:29:54,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377326255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:54,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:54,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464357601] [2023-11-29 02:29:54,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:54,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:54,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:54,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:54,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:54,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 685 [2023-11-29 02:29:54,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 607 transitions, 1233 flow. Second operand has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 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-29 02:29:54,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:54,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 685 [2023-11-29 02:29:54,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:54,453 INFO L124 PetriNetUnfolderBase]: 101/1685 cut-off events. [2023-11-29 02:29:54,453 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-29 02:29:54,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1787 conditions, 1685 events. 101/1685 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10433 event pairs, 23 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1710. Up to 75 conditions per place. [2023-11-29 02:29:54,477 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 17 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2023-11-29 02:29:54,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 607 transitions, 1273 flow [2023-11-29 02:29:54,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions. [2023-11-29 02:29:54,481 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9615571776155718 [2023-11-29 02:29:54,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions. [2023-11-29 02:29:54,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions. [2023-11-29 02:29:54,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:54,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions. [2023-11-29 02:29:54,486 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 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-29 02:29:54,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:54,489 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:54,489 INFO L175 Difference]: Start difference. First operand has 597 places, 607 transitions, 1233 flow. Second operand 3 states and 1976 transitions. [2023-11-29 02:29:54,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 607 transitions, 1273 flow [2023-11-29 02:29:54,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:29:54,497 INFO L231 Difference]: Finished difference. Result has 596 places, 605 transitions, 1239 flow [2023-11-29 02:29:54,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=596, PETRI_TRANSITIONS=605} [2023-11-29 02:29:54,499 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -39 predicate places. [2023-11-29 02:29:54,499 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 605 transitions, 1239 flow [2023-11-29 02:29:54,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 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-29 02:29:54,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:54,500 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] [2023-11-29 02:29:54,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:29:54,500 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:54,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:54,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1555621331, now seen corresponding path program 1 times [2023-11-29 02:29:54,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:54,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313268519] [2023-11-29 02:29:54,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:54,551 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-29 02:29:54,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:54,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313268519] [2023-11-29 02:29:54,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313268519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:54,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:54,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:54,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385625434] [2023-11-29 02:29:54,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:54,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:54,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:54,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:54,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:54,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 685 [2023-11-29 02:29:54,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 605 transitions, 1239 flow. Second operand has 3 states, 3 states have (on average 652.6666666666666) internal successors, (1958), 3 states have internal predecessors, (1958), 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-29 02:29:54,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:54,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 685 [2023-11-29 02:29:54,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:55,126 INFO L124 PetriNetUnfolderBase]: 250/3307 cut-off events. [2023-11-29 02:29:55,126 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2023-11-29 02:29:55,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3544 conditions, 3307 events. 250/3307 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 28831 event pairs, 74 based on Foata normal form. 0/2816 useless extension candidates. Maximal degree in co-relation 3466. Up to 202 conditions per place. [2023-11-29 02:29:55,158 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 17 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2023-11-29 02:29:55,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 605 transitions, 1279 flow [2023-11-29 02:29:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1976 transitions. [2023-11-29 02:29:55,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9615571776155718 [2023-11-29 02:29:55,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1976 transitions. [2023-11-29 02:29:55,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1976 transitions. [2023-11-29 02:29:55,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:55,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1976 transitions. [2023-11-29 02:29:55,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 658.6666666666666) internal successors, (1976), 3 states have internal predecessors, (1976), 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-29 02:29:55,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:55,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:55,171 INFO L175 Difference]: Start difference. First operand has 596 places, 605 transitions, 1239 flow. Second operand 3 states and 1976 transitions. [2023-11-29 02:29:55,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 605 transitions, 1279 flow [2023-11-29 02:29:55,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 605 transitions, 1279 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:29:55,180 INFO L231 Difference]: Finished difference. Result has 595 places, 603 transitions, 1245 flow [2023-11-29 02:29:55,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1231, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1245, PETRI_PLACES=595, PETRI_TRANSITIONS=603} [2023-11-29 02:29:55,181 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -40 predicate places. [2023-11-29 02:29:55,181 INFO L495 AbstractCegarLoop]: Abstraction has has 595 places, 603 transitions, 1245 flow [2023-11-29 02:29:55,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.6666666666666) internal successors, (1958), 3 states have internal predecessors, (1958), 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-29 02:29:55,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:55,182 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-29 02:29:55,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:29:55,182 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:55,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash -795202891, now seen corresponding path program 1 times [2023-11-29 02:29:55,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:55,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102609591] [2023-11-29 02:29:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:55,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:55,234 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-29 02:29:55,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:55,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102609591] [2023-11-29 02:29:55,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102609591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:55,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:55,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318983591] [2023-11-29 02:29:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:55,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:55,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:55,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:55,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:55,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 685 [2023-11-29 02:29:55,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 603 transitions, 1245 flow. Second operand has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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-29 02:29:55,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:55,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 685 [2023-11-29 02:29:55,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:55,642 INFO L124 PetriNetUnfolderBase]: 108/2102 cut-off events. [2023-11-29 02:29:55,643 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2023-11-29 02:29:55,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2212 conditions, 2102 events. 108/2102 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 13945 event pairs, 8 based on Foata normal form. 1/1809 useless extension candidates. Maximal degree in co-relation 2134. Up to 33 conditions per place. [2023-11-29 02:29:55,665 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2023-11-29 02:29:55,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 604 transitions, 1279 flow [2023-11-29 02:29:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2023-11-29 02:29:55,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9654501216545012 [2023-11-29 02:29:55,669 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2023-11-29 02:29:55,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2023-11-29 02:29:55,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:55,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2023-11-29 02:29:55,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 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-29 02:29:55,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:55,674 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:55,674 INFO L175 Difference]: Start difference. First operand has 595 places, 603 transitions, 1245 flow. Second operand 3 states and 1984 transitions. [2023-11-29 02:29:55,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 604 transitions, 1279 flow [2023-11-29 02:29:55,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 604 transitions, 1279 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:29:55,683 INFO L231 Difference]: Finished difference. Result has 596 places, 602 transitions, 1247 flow [2023-11-29 02:29:55,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1247, PETRI_PLACES=596, PETRI_TRANSITIONS=602} [2023-11-29 02:29:55,684 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -39 predicate places. [2023-11-29 02:29:55,685 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 602 transitions, 1247 flow [2023-11-29 02:29:55,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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-29 02:29:55,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:55,685 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, 1] [2023-11-29 02:29:55,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:29:55,686 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:55,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:55,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1308853279, now seen corresponding path program 1 times [2023-11-29 02:29:55,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:55,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705538957] [2023-11-29 02:29:55,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:55,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:55,750 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-29 02:29:55,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:55,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705538957] [2023-11-29 02:29:55,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705538957] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:55,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:55,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:29:55,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367612964] [2023-11-29 02:29:55,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:55,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:55,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:55,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:55,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 685 [2023-11-29 02:29:55,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 602 transitions, 1247 flow. Second operand has 3 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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-29 02:29:55,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:55,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 685 [2023-11-29 02:29:55,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:56,147 INFO L124 PetriNetUnfolderBase]: 89/1620 cut-off events. [2023-11-29 02:29:56,147 INFO L125 PetriNetUnfolderBase]: For 4/11 co-relation queries the response was YES. [2023-11-29 02:29:56,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1736 conditions, 1620 events. 89/1620 cut-off events. For 4/11 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10455 event pairs, 12 based on Foata normal form. 1/1400 useless extension candidates. Maximal degree in co-relation 1678. Up to 40 conditions per place. [2023-11-29 02:29:56,164 INFO L140 encePairwiseOnDemand]: 681/685 looper letters, 14 selfloop transitions, 3 changer transitions 0/605 dead transitions. [2023-11-29 02:29:56,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 605 transitions, 1289 flow [2023-11-29 02:29:56,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2023-11-29 02:29:56,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664233576642336 [2023-11-29 02:29:56,168 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2023-11-29 02:29:56,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2023-11-29 02:29:56,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:56,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2023-11-29 02:29:56,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:29:56,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:56,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:56,174 INFO L175 Difference]: Start difference. First operand has 596 places, 602 transitions, 1247 flow. Second operand 3 states and 1986 transitions. [2023-11-29 02:29:56,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 605 transitions, 1289 flow [2023-11-29 02:29:56,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 605 transitions, 1285 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:56,185 INFO L231 Difference]: Finished difference. Result has 598 places, 603 transitions, 1261 flow [2023-11-29 02:29:56,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1261, PETRI_PLACES=598, PETRI_TRANSITIONS=603} [2023-11-29 02:29:56,186 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -37 predicate places. [2023-11-29 02:29:56,186 INFO L495 AbstractCegarLoop]: Abstraction has has 598 places, 603 transitions, 1261 flow [2023-11-29 02:29:56,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.6666666666666) internal successors, (1973), 3 states have internal predecessors, (1973), 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-29 02:29:56,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:56,187 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, 1, 1, 1, 1] [2023-11-29 02:29:56,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:29:56,187 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:56,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:56,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1614865348, now seen corresponding path program 1 times [2023-11-29 02:29:56,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:56,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318214858] [2023-11-29 02:29:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:56,255 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-29 02:29:56,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:56,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318214858] [2023-11-29 02:29:56,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318214858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:56,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:56,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767987536] [2023-11-29 02:29:56,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:56,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:56,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:56,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:56,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 685 [2023-11-29 02:29:56,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 603 transitions, 1261 flow. Second operand has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 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-29 02:29:56,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:56,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 685 [2023-11-29 02:29:56,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:56,867 INFO L124 PetriNetUnfolderBase]: 197/2654 cut-off events. [2023-11-29 02:29:56,867 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-29 02:29:56,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2948 conditions, 2654 events. 197/2654 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 20045 event pairs, 24 based on Foata normal form. 0/2303 useless extension candidates. Maximal degree in co-relation 2868. Up to 168 conditions per place. [2023-11-29 02:29:56,901 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 20 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2023-11-29 02:29:56,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 606 transitions, 1316 flow [2023-11-29 02:29:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1979 transitions. [2023-11-29 02:29:56,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9630170316301703 [2023-11-29 02:29:56,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1979 transitions. [2023-11-29 02:29:56,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1979 transitions. [2023-11-29 02:29:56,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:56,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1979 transitions. [2023-11-29 02:29:56,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 659.6666666666666) internal successors, (1979), 3 states have internal predecessors, (1979), 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-29 02:29:56,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:56,910 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:56,910 INFO L175 Difference]: Start difference. First operand has 598 places, 603 transitions, 1261 flow. Second operand 3 states and 1979 transitions. [2023-11-29 02:29:56,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 606 transitions, 1316 flow [2023-11-29 02:29:56,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 606 transitions, 1310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:29:56,923 INFO L231 Difference]: Finished difference. Result has 595 places, 601 transitions, 1261 flow [2023-11-29 02:29:56,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1261, PETRI_PLACES=595, PETRI_TRANSITIONS=601} [2023-11-29 02:29:56,924 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -40 predicate places. [2023-11-29 02:29:56,925 INFO L495 AbstractCegarLoop]: Abstraction has has 595 places, 601 transitions, 1261 flow [2023-11-29 02:29:56,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.3333333333334) internal successors, (1957), 3 states have internal predecessors, (1957), 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-29 02:29:56,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:56,925 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, 1, 1, 1, 1, 1] [2023-11-29 02:29:56,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:29:56,926 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:56,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:56,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1299863257, now seen corresponding path program 1 times [2023-11-29 02:29:56,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:56,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732171150] [2023-11-29 02:29:56,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:56,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:57,565 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-29 02:29:57,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732171150] [2023-11-29 02:29:57,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732171150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:57,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:57,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:29:57,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021806042] [2023-11-29 02:29:57,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:57,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:57,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:57,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:58,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 642 out of 685 [2023-11-29 02:29:58,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 601 transitions, 1261 flow. Second operand has 6 states, 6 states have (on average 643.6666666666666) internal successors, (3862), 6 states have internal predecessors, (3862), 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-29 02:29:58,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:58,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 642 of 685 [2023-11-29 02:29:58,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:58,687 INFO L124 PetriNetUnfolderBase]: 62/1314 cut-off events. [2023-11-29 02:29:58,687 INFO L125 PetriNetUnfolderBase]: For 7/21 co-relation queries the response was YES. [2023-11-29 02:29:58,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1406 conditions, 1314 events. 62/1314 cut-off events. For 7/21 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7204 event pairs, 0 based on Foata normal form. 8/1160 useless extension candidates. Maximal degree in co-relation 1324. Up to 18 conditions per place. [2023-11-29 02:29:58,705 INFO L140 encePairwiseOnDemand]: 680/685 looper letters, 21 selfloop transitions, 4 changer transitions 0/600 dead transitions. [2023-11-29 02:29:58,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 600 transitions, 1309 flow [2023-11-29 02:29:58,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:29:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:29:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3878 transitions. [2023-11-29 02:29:58,712 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9435523114355231 [2023-11-29 02:29:58,712 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3878 transitions. [2023-11-29 02:29:58,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3878 transitions. [2023-11-29 02:29:58,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:58,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3878 transitions. [2023-11-29 02:29:58,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 646.3333333333334) internal successors, (3878), 6 states have internal predecessors, (3878), 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-29 02:29:58,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:29:58,721 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:29:58,721 INFO L175 Difference]: Start difference. First operand has 595 places, 601 transitions, 1261 flow. Second operand 6 states and 3878 transitions. [2023-11-29 02:29:58,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 600 transitions, 1309 flow [2023-11-29 02:29:58,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 600 transitions, 1309 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:29:58,730 INFO L231 Difference]: Finished difference. Result has 599 places, 600 transitions, 1267 flow [2023-11-29 02:29:58,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1267, PETRI_PLACES=599, PETRI_TRANSITIONS=600} [2023-11-29 02:29:58,731 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -36 predicate places. [2023-11-29 02:29:58,731 INFO L495 AbstractCegarLoop]: Abstraction has has 599 places, 600 transitions, 1267 flow [2023-11-29 02:29:58,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 643.6666666666666) internal successors, (3862), 6 states have internal predecessors, (3862), 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-29 02:29:58,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:58,732 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, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:58,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:29:58,732 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:58,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash -2121914526, now seen corresponding path program 1 times [2023-11-29 02:29:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:58,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777538781] [2023-11-29 02:29:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:58,804 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-29 02:29:58,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:58,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777538781] [2023-11-29 02:29:58,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777538781] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:58,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:58,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:58,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313542146] [2023-11-29 02:29:58,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:58,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:58,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:58,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:58,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:58,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:29:58,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 600 transitions, 1267 flow. Second operand has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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-29 02:29:58,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:58,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:29:58,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:59,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1851] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][501], [691#(= |#race~n1~0| 0), 722#(= |#race~count1~0| 0), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 727#(= |#race~count2~0| 0), 714#(= |#race~n3~0| 0), 747#(= |#race~get1~0| 0), 706#(= |#race~n2~0| 0), Black: 745#true, 755#(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)), 536#L124-7true, 757#true, Black: 720#true, 732#(= |#race~count3~0| 0), Black: 725#true, 413#$Ultimate##0true, Black: 730#true]) [2023-11-29 02:29:59,308 INFO L294 olderBase$Statistics]: this new event has 270 ancestors and is not cut-off event [2023-11-29 02:29:59,308 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is not cut-off event [2023-11-29 02:29:59,308 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is not cut-off event [2023-11-29 02:29:59,308 INFO L297 olderBase$Statistics]: existing Event has 273 ancestors and is not cut-off event [2023-11-29 02:29:59,406 INFO L124 PetriNetUnfolderBase]: 169/2952 cut-off events. [2023-11-29 02:29:59,406 INFO L125 PetriNetUnfolderBase]: For 24/62 co-relation queries the response was YES. [2023-11-29 02:29:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3204 conditions, 2952 events. 169/2952 cut-off events. For 24/62 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 22478 event pairs, 17 based on Foata normal form. 2/2545 useless extension candidates. Maximal degree in co-relation 3123. Up to 72 conditions per place. [2023-11-29 02:29:59,440 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2023-11-29 02:29:59,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 601 transitions, 1303 flow [2023-11-29 02:29:59,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:29:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:29:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1982 transitions. [2023-11-29 02:29:59,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644768856447689 [2023-11-29 02:29:59,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1982 transitions. [2023-11-29 02:29:59,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1982 transitions. [2023-11-29 02:29:59,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:29:59,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1982 transitions. [2023-11-29 02:29:59,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.6666666666666) internal successors, (1982), 3 states have internal predecessors, (1982), 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-29 02:29:59,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:59,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:29:59,449 INFO L175 Difference]: Start difference. First operand has 599 places, 600 transitions, 1267 flow. Second operand 3 states and 1982 transitions. [2023-11-29 02:29:59,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 601 transitions, 1303 flow [2023-11-29 02:29:59,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 601 transitions, 1296 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:29:59,458 INFO L231 Difference]: Finished difference. Result has 596 places, 599 transitions, 1262 flow [2023-11-29 02:29:59,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1258, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1262, PETRI_PLACES=596, PETRI_TRANSITIONS=599} [2023-11-29 02:29:59,459 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -39 predicate places. [2023-11-29 02:29:59,459 INFO L495 AbstractCegarLoop]: Abstraction has has 596 places, 599 transitions, 1262 flow [2023-11-29 02:29:59,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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-29 02:29:59,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:29:59,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:59,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:29:59,459 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:29:59,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:59,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1725508436, now seen corresponding path program 1 times [2023-11-29 02:29:59,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:59,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240963637] [2023-11-29 02:29:59,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:59,508 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-29 02:29:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240963637] [2023-11-29 02:29:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240963637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:59,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:29:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103892480] [2023-11-29 02:29:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:59,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:29:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:29:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:29:59,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 685 [2023-11-29 02:29:59,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 599 transitions, 1262 flow. Second operand has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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-29 02:29:59,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:29:59,530 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 685 [2023-11-29 02:29:59,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:29:59,986 INFO L124 PetriNetUnfolderBase]: 147/2607 cut-off events. [2023-11-29 02:29:59,986 INFO L125 PetriNetUnfolderBase]: For 10/20 co-relation queries the response was YES. [2023-11-29 02:30:00,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2807 conditions, 2607 events. 147/2607 cut-off events. For 10/20 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18647 event pairs, 10 based on Foata normal form. 2/2263 useless extension candidates. Maximal degree in co-relation 2769. Up to 44 conditions per place. [2023-11-29 02:30:00,013 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2023-11-29 02:30:00,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 600 transitions, 1296 flow [2023-11-29 02:30:00,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2023-11-29 02:30:00,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9654501216545012 [2023-11-29 02:30:00,019 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2023-11-29 02:30:00,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2023-11-29 02:30:00,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:00,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2023-11-29 02:30:00,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 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-29 02:30:00,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:00,024 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:00,024 INFO L175 Difference]: Start difference. First operand has 596 places, 599 transitions, 1262 flow. Second operand 3 states and 1984 transitions. [2023-11-29 02:30:00,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 600 transitions, 1296 flow [2023-11-29 02:30:00,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 600 transitions, 1292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:00,033 INFO L231 Difference]: Finished difference. Result has 595 places, 598 transitions, 1260 flow [2023-11-29 02:30:00,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1260, PETRI_PLACES=595, PETRI_TRANSITIONS=598} [2023-11-29 02:30:00,033 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -40 predicate places. [2023-11-29 02:30:00,034 INFO L495 AbstractCegarLoop]: Abstraction has has 595 places, 598 transitions, 1260 flow [2023-11-29 02:30:00,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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-29 02:30:00,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:00,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:00,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 02:30:00,034 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:00,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash 452291394, now seen corresponding path program 1 times [2023-11-29 02:30:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:00,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039246169] [2023-11-29 02:30:00,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:00,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,276 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-29 02:30:00,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:00,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039246169] [2023-11-29 02:30:00,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039246169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:00,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:00,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:30:00,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344050030] [2023-11-29 02:30:00,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:00,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:30:00,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:00,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:30:00,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:30:00,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 685 [2023-11-29 02:30:00,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 598 transitions, 1260 flow. Second operand has 8 states, 8 states have (on average 628.125) internal successors, (5025), 8 states have internal predecessors, (5025), 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-29 02:30:00,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:00,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 685 [2023-11-29 02:30:00,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:01,654 INFO L124 PetriNetUnfolderBase]: 235/3751 cut-off events. [2023-11-29 02:30:01,654 INFO L125 PetriNetUnfolderBase]: For 17/40 co-relation queries the response was YES. [2023-11-29 02:30:01,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 3751 events. 235/3751 cut-off events. For 17/40 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 32048 event pairs, 43 based on Foata normal form. 6/3284 useless extension candidates. Maximal degree in co-relation 4175. Up to 155 conditions per place. [2023-11-29 02:30:01,701 INFO L140 encePairwiseOnDemand]: 670/685 looper letters, 70 selfloop transitions, 16 changer transitions 0/637 dead transitions. [2023-11-29 02:30:01,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 637 transitions, 1526 flow [2023-11-29 02:30:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:30:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:30:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6950 transitions. [2023-11-29 02:30:01,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9223623092236231 [2023-11-29 02:30:01,717 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6950 transitions. [2023-11-29 02:30:01,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6950 transitions. [2023-11-29 02:30:01,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:01,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6950 transitions. [2023-11-29 02:30:01,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 631.8181818181819) internal successors, (6950), 11 states have internal predecessors, (6950), 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-29 02:30:01,736 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:01,737 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:01,737 INFO L175 Difference]: Start difference. First operand has 595 places, 598 transitions, 1260 flow. Second operand 11 states and 6950 transitions. [2023-11-29 02:30:01,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 637 transitions, 1526 flow [2023-11-29 02:30:01,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 637 transitions, 1522 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:01,749 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1340 flow [2023-11-29 02:30:01,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1256, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1340, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2023-11-29 02:30:01,750 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -27 predicate places. [2023-11-29 02:30:01,750 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1340 flow [2023-11-29 02:30:01,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 628.125) internal successors, (5025), 8 states have internal predecessors, (5025), 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-29 02:30:01,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:01,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:01,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:30:01,751 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:01,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1289170524, now seen corresponding path program 1 times [2023-11-29 02:30:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:01,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416545226] [2023-11-29 02:30:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:01,811 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-29 02:30:01,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:01,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416545226] [2023-11-29 02:30:01,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416545226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:01,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:01,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:01,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023990945] [2023-11-29 02:30:01,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:01,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:01,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:01,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:01,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:01,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:30:01,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1340 flow. Second operand has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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-29 02:30:01,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:01,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:30:01,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:02,432 INFO L124 PetriNetUnfolderBase]: 188/2725 cut-off events. [2023-11-29 02:30:02,432 INFO L125 PetriNetUnfolderBase]: For 94/129 co-relation queries the response was YES. [2023-11-29 02:30:02,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 2725 events. 188/2725 cut-off events. For 94/129 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21078 event pairs, 37 based on Foata normal form. 6/2381 useless extension candidates. Maximal degree in co-relation 3020. Up to 162 conditions per place. [2023-11-29 02:30:02,463 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2023-11-29 02:30:02,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 608 transitions, 1376 flow [2023-11-29 02:30:02,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1982 transitions. [2023-11-29 02:30:02,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644768856447689 [2023-11-29 02:30:02,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1982 transitions. [2023-11-29 02:30:02,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1982 transitions. [2023-11-29 02:30:02,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:02,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1982 transitions. [2023-11-29 02:30:02,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.6666666666666) internal successors, (1982), 3 states have internal predecessors, (1982), 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-29 02:30:02,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:02,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:02,471 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1340 flow. Second operand 3 states and 1982 transitions. [2023-11-29 02:30:02,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 608 transitions, 1376 flow [2023-11-29 02:30:02,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 608 transitions, 1372 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:30:02,480 INFO L231 Difference]: Finished difference. Result has 608 places, 606 transitions, 1338 flow [2023-11-29 02:30:02,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1338, PETRI_PLACES=608, PETRI_TRANSITIONS=606} [2023-11-29 02:30:02,481 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -27 predicate places. [2023-11-29 02:30:02,481 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 606 transitions, 1338 flow [2023-11-29 02:30:02,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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-29 02:30:02,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:02,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:02,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:30:02,482 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:02,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:02,482 INFO L85 PathProgramCache]: Analyzing trace with hash -792671253, now seen corresponding path program 1 times [2023-11-29 02:30:02,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:02,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306491604] [2023-11-29 02:30:02,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:02,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:02,544 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-29 02:30:02,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:02,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306491604] [2023-11-29 02:30:02,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306491604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:02,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:02,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:30:02,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568609573] [2023-11-29 02:30:02,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:02,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:02,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:02,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:02,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 685 [2023-11-29 02:30:02,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 606 transitions, 1338 flow. Second operand has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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-29 02:30:02,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:02,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 685 [2023-11-29 02:30:02,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:03,320 INFO L124 PetriNetUnfolderBase]: 296/3864 cut-off events. [2023-11-29 02:30:03,320 INFO L125 PetriNetUnfolderBase]: For 64/107 co-relation queries the response was YES. [2023-11-29 02:30:03,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4477 conditions, 3864 events. 296/3864 cut-off events. For 64/107 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 34161 event pairs, 72 based on Foata normal form. 2/3362 useless extension candidates. Maximal degree in co-relation 4389. Up to 224 conditions per place. [2023-11-29 02:30:03,367 INFO L140 encePairwiseOnDemand]: 681/685 looper letters, 14 selfloop transitions, 3 changer transitions 0/609 dead transitions. [2023-11-29 02:30:03,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 609 transitions, 1380 flow [2023-11-29 02:30:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:03,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:03,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2023-11-29 02:30:03,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664233576642336 [2023-11-29 02:30:03,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2023-11-29 02:30:03,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2023-11-29 02:30:03,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:03,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2023-11-29 02:30:03,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:03,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:03,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:03,374 INFO L175 Difference]: Start difference. First operand has 608 places, 606 transitions, 1338 flow. Second operand 3 states and 1986 transitions. [2023-11-29 02:30:03,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 609 transitions, 1380 flow [2023-11-29 02:30:03,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 609 transitions, 1376 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:03,383 INFO L231 Difference]: Finished difference. Result has 610 places, 607 transitions, 1352 flow [2023-11-29 02:30:03,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1352, PETRI_PLACES=610, PETRI_TRANSITIONS=607} [2023-11-29 02:30:03,384 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -25 predicate places. [2023-11-29 02:30:03,384 INFO L495 AbstractCegarLoop]: Abstraction has has 610 places, 607 transitions, 1352 flow [2023-11-29 02:30:03,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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-29 02:30:03,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:03,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:03,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:30:03,385 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:03,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:03,385 INFO L85 PathProgramCache]: Analyzing trace with hash 558019508, now seen corresponding path program 1 times [2023-11-29 02:30:03,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:03,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073393535] [2023-11-29 02:30:03,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:03,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:03,447 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-29 02:30:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:03,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073393535] [2023-11-29 02:30:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073393535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:03,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:30:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389833718] [2023-11-29 02:30:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:03,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:03,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:03,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 685 [2023-11-29 02:30:03,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 607 transitions, 1352 flow. Second operand has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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-29 02:30:03,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:03,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 685 [2023-11-29 02:30:03,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:04,385 INFO L124 PetriNetUnfolderBase]: 258/3480 cut-off events. [2023-11-29 02:30:04,385 INFO L125 PetriNetUnfolderBase]: For 138/215 co-relation queries the response was YES. [2023-11-29 02:30:04,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4022 conditions, 3480 events. 258/3480 cut-off events. For 138/215 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 28462 event pairs, 66 based on Foata normal form. 6/3011 useless extension candidates. Maximal degree in co-relation 3933. Up to 236 conditions per place. [2023-11-29 02:30:04,429 INFO L140 encePairwiseOnDemand]: 681/685 looper letters, 14 selfloop transitions, 3 changer transitions 0/610 dead transitions. [2023-11-29 02:30:04,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 610 transitions, 1394 flow [2023-11-29 02:30:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:04,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2023-11-29 02:30:04,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664233576642336 [2023-11-29 02:30:04,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2023-11-29 02:30:04,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2023-11-29 02:30:04,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:04,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2023-11-29 02:30:04,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:30:04,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:04,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:04,439 INFO L175 Difference]: Start difference. First operand has 610 places, 607 transitions, 1352 flow. Second operand 3 states and 1986 transitions. [2023-11-29 02:30:04,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 610 transitions, 1394 flow [2023-11-29 02:30:04,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 610 transitions, 1388 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:04,449 INFO L231 Difference]: Finished difference. Result has 612 places, 608 transitions, 1364 flow [2023-11-29 02:30:04,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1364, PETRI_PLACES=612, PETRI_TRANSITIONS=608} [2023-11-29 02:30:04,450 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -23 predicate places. [2023-11-29 02:30:04,450 INFO L495 AbstractCegarLoop]: Abstraction has has 612 places, 608 transitions, 1364 flow [2023-11-29 02:30:04,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.3333333333334) internal successors, (1975), 3 states have internal predecessors, (1975), 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-29 02:30:04,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:04,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:04,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:30:04,451 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:04,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1556425016, now seen corresponding path program 1 times [2023-11-29 02:30:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156198809] [2023-11-29 02:30:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:04,506 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-29 02:30:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:04,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156198809] [2023-11-29 02:30:04,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156198809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:04,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:04,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:04,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72019584] [2023-11-29 02:30:04,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:04,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:04,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:04,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:04,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:04,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:30:04,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 608 transitions, 1364 flow. Second operand has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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-29 02:30:04,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:04,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:30:04,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:05,730 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1851] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][477], [Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 722#(= |#race~count1~0| 0), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 727#(= |#race~count2~0| 0), 714#(= |#race~n3~0| 0), 706#(= |#race~n2~0| 0), 747#(= |#race~get1~0| 0), Black: 745#true, 755#(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)), 536#L124-7true, Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 807#true, Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 720#true, Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 732#(= |#race~count3~0| 0), 801#true, Black: 725#true, 413#$Ultimate##0true, Black: 730#true]) [2023-11-29 02:30:05,730 INFO L294 olderBase$Statistics]: this new event has 297 ancestors and is cut-off event [2023-11-29 02:30:05,730 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-29 02:30:05,731 INFO L297 olderBase$Statistics]: existing Event has 288 ancestors and is cut-off event [2023-11-29 02:30:05,731 INFO L297 olderBase$Statistics]: existing Event has 319 ancestors and is cut-off event [2023-11-29 02:30:05,836 INFO L124 PetriNetUnfolderBase]: 307/5189 cut-off events. [2023-11-29 02:30:05,836 INFO L125 PetriNetUnfolderBase]: For 120/176 co-relation queries the response was YES. [2023-11-29 02:30:05,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5974 conditions, 5189 events. 307/5189 cut-off events. For 120/176 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 47258 event pairs, 29 based on Foata normal form. 5/4596 useless extension candidates. Maximal degree in co-relation 5884. Up to 131 conditions per place. [2023-11-29 02:30:05,896 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2023-11-29 02:30:05,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 609 transitions, 1400 flow [2023-11-29 02:30:05,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:05,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1982 transitions. [2023-11-29 02:30:05,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644768856447689 [2023-11-29 02:30:05,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1982 transitions. [2023-11-29 02:30:05,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1982 transitions. [2023-11-29 02:30:05,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:05,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1982 transitions. [2023-11-29 02:30:05,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.6666666666666) internal successors, (1982), 3 states have internal predecessors, (1982), 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-29 02:30:05,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:05,902 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:05,903 INFO L175 Difference]: Start difference. First operand has 612 places, 608 transitions, 1364 flow. Second operand 3 states and 1982 transitions. [2023-11-29 02:30:05,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 609 transitions, 1400 flow [2023-11-29 02:30:05,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 609 transitions, 1394 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:05,913 INFO L231 Difference]: Finished difference. Result has 611 places, 607 transitions, 1360 flow [2023-11-29 02:30:05,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1360, PETRI_PLACES=611, PETRI_TRANSITIONS=607} [2023-11-29 02:30:05,914 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -24 predicate places. [2023-11-29 02:30:05,914 INFO L495 AbstractCegarLoop]: Abstraction has has 611 places, 607 transitions, 1360 flow [2023-11-29 02:30:05,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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-29 02:30:05,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:05,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:05,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 02:30:05,915 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:05,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:05,915 INFO L85 PathProgramCache]: Analyzing trace with hash -494327217, now seen corresponding path program 1 times [2023-11-29 02:30:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715129246] [2023-11-29 02:30:05,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:06,134 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-29 02:30:06,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:06,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715129246] [2023-11-29 02:30:06,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715129246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:06,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:06,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:30:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862658345] [2023-11-29 02:30:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:06,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:30:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:06,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:30:06,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:30:06,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 685 [2023-11-29 02:30:06,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 607 transitions, 1360 flow. Second operand has 8 states, 8 states have (on average 628.25) internal successors, (5026), 8 states have internal predecessors, (5026), 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-29 02:30:06,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:06,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 685 [2023-11-29 02:30:06,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:07,460 INFO L124 PetriNetUnfolderBase]: 279/3675 cut-off events. [2023-11-29 02:30:07,461 INFO L125 PetriNetUnfolderBase]: For 71/138 co-relation queries the response was YES. [2023-11-29 02:30:07,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4459 conditions, 3675 events. 279/3675 cut-off events. For 71/138 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 31748 event pairs, 60 based on Foata normal form. 7/3268 useless extension candidates. Maximal degree in co-relation 4374. Up to 199 conditions per place. [2023-11-29 02:30:07,504 INFO L140 encePairwiseOnDemand]: 668/685 looper letters, 69 selfloop transitions, 19 changer transitions 0/643 dead transitions. [2023-11-29 02:30:07,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 643 transitions, 1626 flow [2023-11-29 02:30:07,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:30:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 02:30:07,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7577 transitions. [2023-11-29 02:30:07,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9217761557177615 [2023-11-29 02:30:07,509 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 7577 transitions. [2023-11-29 02:30:07,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 7577 transitions. [2023-11-29 02:30:07,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:07,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 7577 transitions. [2023-11-29 02:30:07,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 631.4166666666666) internal successors, (7577), 12 states have internal predecessors, (7577), 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-29 02:30:07,524 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 685.0) internal successors, (8905), 13 states have internal predecessors, (8905), 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-29 02:30:07,525 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 685.0) internal successors, (8905), 13 states have internal predecessors, (8905), 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-29 02:30:07,525 INFO L175 Difference]: Start difference. First operand has 611 places, 607 transitions, 1360 flow. Second operand 12 states and 7577 transitions. [2023-11-29 02:30:07,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 643 transitions, 1626 flow [2023-11-29 02:30:07,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 643 transitions, 1622 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:07,538 INFO L231 Difference]: Finished difference. Result has 624 places, 612 transitions, 1436 flow [2023-11-29 02:30:07,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1356, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1436, PETRI_PLACES=624, PETRI_TRANSITIONS=612} [2023-11-29 02:30:07,539 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -11 predicate places. [2023-11-29 02:30:07,539 INFO L495 AbstractCegarLoop]: Abstraction has has 624 places, 612 transitions, 1436 flow [2023-11-29 02:30:07,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 628.25) internal successors, (5026), 8 states have internal predecessors, (5026), 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-29 02:30:07,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:07,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:07,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 02:30:07,541 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:07,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1138959317, now seen corresponding path program 1 times [2023-11-29 02:30:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424377003] [2023-11-29 02:30:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:07,602 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-29 02:30:07,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:07,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424377003] [2023-11-29 02:30:07,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424377003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:07,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:07,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:07,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916276918] [2023-11-29 02:30:07,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:07,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:07,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:07,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:07,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:07,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 685 [2023-11-29 02:30:07,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 612 transitions, 1436 flow. Second operand has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-29 02:30:07,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:07,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 685 [2023-11-29 02:30:07,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:08,785 INFO L124 PetriNetUnfolderBase]: 312/4572 cut-off events. [2023-11-29 02:30:08,785 INFO L125 PetriNetUnfolderBase]: For 117/125 co-relation queries the response was YES. [2023-11-29 02:30:08,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5425 conditions, 4572 events. 312/4572 cut-off events. For 117/125 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 38401 event pairs, 36 based on Foata normal form. 1/4089 useless extension candidates. Maximal degree in co-relation 5328. Up to 250 conditions per place. [2023-11-29 02:30:08,846 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 20 selfloop transitions, 2 changer transitions 0/615 dead transitions. [2023-11-29 02:30:08,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 615 transitions, 1491 flow [2023-11-29 02:30:08,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:08,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1979 transitions. [2023-11-29 02:30:08,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9630170316301703 [2023-11-29 02:30:08,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1979 transitions. [2023-11-29 02:30:08,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1979 transitions. [2023-11-29 02:30:08,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:08,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1979 transitions. [2023-11-29 02:30:08,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 659.6666666666666) internal successors, (1979), 3 states have internal predecessors, (1979), 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-29 02:30:08,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:08,853 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:08,853 INFO L175 Difference]: Start difference. First operand has 624 places, 612 transitions, 1436 flow. Second operand 3 states and 1979 transitions. [2023-11-29 02:30:08,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 615 transitions, 1491 flow [2023-11-29 02:30:08,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 616 places, 615 transitions, 1474 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 02:30:08,864 INFO L231 Difference]: Finished difference. Result has 617 places, 610 transitions, 1425 flow [2023-11-29 02:30:08,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1411, PETRI_DIFFERENCE_MINUEND_PLACES=614, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=617, PETRI_TRANSITIONS=610} [2023-11-29 02:30:08,865 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -18 predicate places. [2023-11-29 02:30:08,866 INFO L495 AbstractCegarLoop]: Abstraction has has 617 places, 610 transitions, 1425 flow [2023-11-29 02:30:08,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 653.0) internal successors, (1959), 3 states have internal predecessors, (1959), 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-29 02:30:08,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:08,866 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:08,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 02:30:08,866 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:08,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:08,867 INFO L85 PathProgramCache]: Analyzing trace with hash 250343719, now seen corresponding path program 1 times [2023-11-29 02:30:08,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:08,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967820722] [2023-11-29 02:30:08,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:08,943 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-29 02:30:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967820722] [2023-11-29 02:30:08,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967820722] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:08,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:08,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:08,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742125811] [2023-11-29 02:30:08,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:08,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:08,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:08,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:08,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:08,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:30:08,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 610 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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-29 02:30:08,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:08,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:30:08,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:09,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][575], [Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 836#true, 714#(= |#race~n3~0| 0), 706#(= |#race~n2~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 725#true, Black: 730#true, Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 841#true, Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), Black: 745#true, 755#(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)), 811#true, 732#(= |#race~count3~0| 0)]) [2023-11-29 02:30:09,844 INFO L294 olderBase$Statistics]: this new event has 314 ancestors and is not cut-off event [2023-11-29 02:30:09,844 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is not cut-off event [2023-11-29 02:30:09,844 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-29 02:30:09,844 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is not cut-off event [2023-11-29 02:30:09,885 INFO L124 PetriNetUnfolderBase]: 245/3279 cut-off events. [2023-11-29 02:30:09,885 INFO L125 PetriNetUnfolderBase]: For 154/182 co-relation queries the response was YES. [2023-11-29 02:30:09,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4033 conditions, 3279 events. 245/3279 cut-off events. For 154/182 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 25851 event pairs, 42 based on Foata normal form. 6/2937 useless extension candidates. Maximal degree in co-relation 3935. Up to 209 conditions per place. [2023-11-29 02:30:09,928 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/611 dead transitions. [2023-11-29 02:30:09,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 611 transitions, 1461 flow [2023-11-29 02:30:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1982 transitions. [2023-11-29 02:30:09,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644768856447689 [2023-11-29 02:30:09,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1982 transitions. [2023-11-29 02:30:09,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1982 transitions. [2023-11-29 02:30:09,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:09,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1982 transitions. [2023-11-29 02:30:09,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.6666666666666) internal successors, (1982), 3 states have internal predecessors, (1982), 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-29 02:30:09,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:09,935 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:09,935 INFO L175 Difference]: Start difference. First operand has 617 places, 610 transitions, 1425 flow. Second operand 3 states and 1982 transitions. [2023-11-29 02:30:09,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 611 transitions, 1461 flow [2023-11-29 02:30:09,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 611 transitions, 1461 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:30:09,945 INFO L231 Difference]: Finished difference. Result has 618 places, 609 transitions, 1427 flow [2023-11-29 02:30:09,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1427, PETRI_PLACES=618, PETRI_TRANSITIONS=609} [2023-11-29 02:30:09,946 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -17 predicate places. [2023-11-29 02:30:09,946 INFO L495 AbstractCegarLoop]: Abstraction has has 618 places, 609 transitions, 1427 flow [2023-11-29 02:30:09,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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-29 02:30:09,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:09,947 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:09,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 02:30:09,947 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:09,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1966825649, now seen corresponding path program 1 times [2023-11-29 02:30:09,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:09,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196004163] [2023-11-29 02:30:09,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:09,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:10,206 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-29 02:30:10,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:10,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196004163] [2023-11-29 02:30:10,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196004163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:30:10,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091617627] [2023-11-29 02:30:10,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:10,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:30:10,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:10,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:30:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:30:10,649 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 685 [2023-11-29 02:30:10,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 609 transitions, 1427 flow. Second operand has 8 states, 8 states have (on average 628.375) internal successors, (5027), 8 states have internal predecessors, (5027), 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-29 02:30:10,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:10,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 685 [2023-11-29 02:30:10,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:12,237 INFO L124 PetriNetUnfolderBase]: 534/5541 cut-off events. [2023-11-29 02:30:12,237 INFO L125 PetriNetUnfolderBase]: For 368/409 co-relation queries the response was YES. [2023-11-29 02:30:12,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7370 conditions, 5541 events. 534/5541 cut-off events. For 368/409 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 53043 event pairs, 175 based on Foata normal form. 20/5017 useless extension candidates. Maximal degree in co-relation 7269. Up to 679 conditions per place. [2023-11-29 02:30:12,314 INFO L140 encePairwiseOnDemand]: 670/685 looper letters, 66 selfloop transitions, 16 changer transitions 0/639 dead transitions. [2023-11-29 02:30:12,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 639 transitions, 1667 flow [2023-11-29 02:30:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:30:12,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:30:12,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6941 transitions. [2023-11-29 02:30:12,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9211678832116789 [2023-11-29 02:30:12,319 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6941 transitions. [2023-11-29 02:30:12,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6941 transitions. [2023-11-29 02:30:12,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:12,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6941 transitions. [2023-11-29 02:30:12,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 631.0) internal successors, (6941), 11 states have internal predecessors, (6941), 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-29 02:30:12,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:12,330 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:12,330 INFO L175 Difference]: Start difference. First operand has 618 places, 609 transitions, 1427 flow. Second operand 11 states and 6941 transitions. [2023-11-29 02:30:12,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 639 transitions, 1667 flow [2023-11-29 02:30:12,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 626 places, 639 transitions, 1663 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:12,341 INFO L231 Difference]: Finished difference. Result has 631 places, 618 transitions, 1507 flow [2023-11-29 02:30:12,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1507, PETRI_PLACES=631, PETRI_TRANSITIONS=618} [2023-11-29 02:30:12,342 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, -4 predicate places. [2023-11-29 02:30:12,342 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 618 transitions, 1507 flow [2023-11-29 02:30:12,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 628.375) internal successors, (5027), 8 states have internal predecessors, (5027), 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-29 02:30:12,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:12,343 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, 1, 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-29 02:30:12,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 02:30:12,343 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:12,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:12,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1055427029, now seen corresponding path program 1 times [2023-11-29 02:30:12,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:12,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341270667] [2023-11-29 02:30:12,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:12,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:30:12,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:12,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341270667] [2023-11-29 02:30:12,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341270667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:12,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:12,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:30:12,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938368985] [2023-11-29 02:30:12,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:12,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:30:12,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:12,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:30:12,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:30:13,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 685 [2023-11-29 02:30:13,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 618 transitions, 1507 flow. Second operand has 8 states, 8 states have (on average 628.25) internal successors, (5026), 8 states have internal predecessors, (5026), 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-29 02:30:13,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:13,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 685 [2023-11-29 02:30:13,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:14,632 INFO L124 PetriNetUnfolderBase]: 412/6105 cut-off events. [2023-11-29 02:30:14,632 INFO L125 PetriNetUnfolderBase]: For 250/282 co-relation queries the response was YES. [2023-11-29 02:30:14,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7950 conditions, 6105 events. 412/6105 cut-off events. For 250/282 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 57394 event pairs, 66 based on Foata normal form. 4/5587 useless extension candidates. Maximal degree in co-relation 7841. Up to 267 conditions per place. [2023-11-29 02:30:14,720 INFO L140 encePairwiseOnDemand]: 669/685 looper letters, 73 selfloop transitions, 20 changer transitions 0/650 dead transitions. [2023-11-29 02:30:14,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 650 transitions, 1803 flow [2023-11-29 02:30:14,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:30:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:30:14,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6943 transitions. [2023-11-29 02:30:14,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9214333112143331 [2023-11-29 02:30:14,727 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6943 transitions. [2023-11-29 02:30:14,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6943 transitions. [2023-11-29 02:30:14,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:14,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6943 transitions. [2023-11-29 02:30:14,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 631.1818181818181) internal successors, (6943), 11 states have internal predecessors, (6943), 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-29 02:30:14,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:14,743 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:14,743 INFO L175 Difference]: Start difference. First operand has 631 places, 618 transitions, 1507 flow. Second operand 11 states and 6943 transitions. [2023-11-29 02:30:14,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 650 transitions, 1803 flow [2023-11-29 02:30:14,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 650 transitions, 1799 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:30:14,758 INFO L231 Difference]: Finished difference. Result has 643 places, 626 transitions, 1620 flow [2023-11-29 02:30:14,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1503, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1620, PETRI_PLACES=643, PETRI_TRANSITIONS=626} [2023-11-29 02:30:14,759 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 8 predicate places. [2023-11-29 02:30:14,760 INFO L495 AbstractCegarLoop]: Abstraction has has 643 places, 626 transitions, 1620 flow [2023-11-29 02:30:14,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 628.25) internal successors, (5026), 8 states have internal predecessors, (5026), 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-29 02:30:14,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:14,761 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, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:14,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 02:30:14,761 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:14,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:14,761 INFO L85 PathProgramCache]: Analyzing trace with hash 185049720, now seen corresponding path program 1 times [2023-11-29 02:30:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912906409] [2023-11-29 02:30:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:30:15,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:15,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912906409] [2023-11-29 02:30:15,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912906409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:15,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:15,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:30:15,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527728966] [2023-11-29 02:30:15,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:15,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:30:15,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:15,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:30:15,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:30:15,540 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 685 [2023-11-29 02:30:15,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 626 transitions, 1620 flow. Second operand has 8 states, 8 states have (on average 628.375) internal successors, (5027), 8 states have internal predecessors, (5027), 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-29 02:30:15,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:15,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 685 [2023-11-29 02:30:15,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:18,644 INFO L124 PetriNetUnfolderBase]: 927/11916 cut-off events. [2023-11-29 02:30:18,644 INFO L125 PetriNetUnfolderBase]: For 850/1033 co-relation queries the response was YES. [2023-11-29 02:30:18,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15945 conditions, 11916 events. 927/11916 cut-off events. For 850/1033 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 136122 event pairs, 215 based on Foata normal form. 16/10867 useless extension candidates. Maximal degree in co-relation 15831. Up to 652 conditions per place. [2023-11-29 02:30:18,887 INFO L140 encePairwiseOnDemand]: 669/685 looper letters, 70 selfloop transitions, 21 changer transitions 0/655 dead transitions. [2023-11-29 02:30:18,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 655 transitions, 1917 flow [2023-11-29 02:30:18,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:30:18,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:30:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6934 transitions. [2023-11-29 02:30:18,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9202388852023888 [2023-11-29 02:30:18,892 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6934 transitions. [2023-11-29 02:30:18,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6934 transitions. [2023-11-29 02:30:18,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:18,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6934 transitions. [2023-11-29 02:30:18,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 630.3636363636364) internal successors, (6934), 11 states have internal predecessors, (6934), 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-29 02:30:18,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:18,901 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:18,902 INFO L175 Difference]: Start difference. First operand has 643 places, 626 transitions, 1620 flow. Second operand 11 states and 6934 transitions. [2023-11-29 02:30:18,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 655 transitions, 1917 flow [2023-11-29 02:30:18,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 655 transitions, 1896 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 02:30:18,921 INFO L231 Difference]: Finished difference. Result has 651 places, 640 transitions, 1753 flow [2023-11-29 02:30:18,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1599, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1753, PETRI_PLACES=651, PETRI_TRANSITIONS=640} [2023-11-29 02:30:18,923 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 16 predicate places. [2023-11-29 02:30:18,923 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 640 transitions, 1753 flow [2023-11-29 02:30:18,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 628.375) internal successors, (5027), 8 states have internal predecessors, (5027), 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-29 02:30:18,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:18,924 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, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:18,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 02:30:18,924 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:18,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1769074483, now seen corresponding path program 1 times [2023-11-29 02:30:18,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:18,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320774835] [2023-11-29 02:30:18,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:18,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:19,612 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-29 02:30:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320774835] [2023-11-29 02:30:19,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320774835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:19,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453703706] [2023-11-29 02:30:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:19,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:19,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:20,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 642 out of 685 [2023-11-29 02:30:20,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 640 transitions, 1753 flow. Second operand has 6 states, 6 states have (on average 643.8333333333334) internal successors, (3863), 6 states have internal predecessors, (3863), 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-29 02:30:20,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:20,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 642 of 685 [2023-11-29 02:30:20,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:21,966 INFO L124 PetriNetUnfolderBase]: 355/6760 cut-off events. [2023-11-29 02:30:21,966 INFO L125 PetriNetUnfolderBase]: For 521/539 co-relation queries the response was YES. [2023-11-29 02:30:22,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8745 conditions, 6760 events. 355/6760 cut-off events. For 521/539 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 63520 event pairs, 2 based on Foata normal form. 8/6206 useless extension candidates. Maximal degree in co-relation 8624. Up to 160 conditions per place. [2023-11-29 02:30:22,060 INFO L140 encePairwiseOnDemand]: 680/685 looper letters, 21 selfloop transitions, 4 changer transitions 0/639 dead transitions. [2023-11-29 02:30:22,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 639 transitions, 1801 flow [2023-11-29 02:30:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3878 transitions. [2023-11-29 02:30:22,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9435523114355231 [2023-11-29 02:30:22,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3878 transitions. [2023-11-29 02:30:22,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3878 transitions. [2023-11-29 02:30:22,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:22,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3878 transitions. [2023-11-29 02:30:22,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 646.3333333333334) internal successors, (3878), 6 states have internal predecessors, (3878), 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-29 02:30:22,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:22,072 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:22,073 INFO L175 Difference]: Start difference. First operand has 651 places, 640 transitions, 1753 flow. Second operand 6 states and 3878 transitions. [2023-11-29 02:30:22,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 639 transitions, 1801 flow [2023-11-29 02:30:22,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 639 transitions, 1797 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:30:22,093 INFO L231 Difference]: Finished difference. Result has 654 places, 639 transitions, 1755 flow [2023-11-29 02:30:22,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1755, PETRI_PLACES=654, PETRI_TRANSITIONS=639} [2023-11-29 02:30:22,095 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 19 predicate places. [2023-11-29 02:30:22,095 INFO L495 AbstractCegarLoop]: Abstraction has has 654 places, 639 transitions, 1755 flow [2023-11-29 02:30:22,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 643.8333333333334) internal successors, (3863), 6 states have internal predecessors, (3863), 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-29 02:30:22,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:22,096 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:22,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 02:30:22,097 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:22,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash 286537623, now seen corresponding path program 1 times [2023-11-29 02:30:22,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:22,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977944180] [2023-11-29 02:30:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:22,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:22,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 02:30:22,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:22,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977944180] [2023-11-29 02:30:22,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977944180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:22,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:22,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:30:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843219047] [2023-11-29 02:30:22,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:30:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:22,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:30:22,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:30:22,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 685 [2023-11-29 02:30:22,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 639 transitions, 1755 flow. Second operand has 8 states, 8 states have (on average 628.5) internal successors, (5028), 8 states have internal predecessors, (5028), 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-29 02:30:22,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:22,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 685 [2023-11-29 02:30:22,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:24,750 INFO L124 PetriNetUnfolderBase]: 740/7373 cut-off events. [2023-11-29 02:30:24,750 INFO L125 PetriNetUnfolderBase]: For 1180/1221 co-relation queries the response was YES. [2023-11-29 02:30:24,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10707 conditions, 7373 events. 740/7373 cut-off events. For 1180/1221 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 75392 event pairs, 221 based on Foata normal form. 0/6751 useless extension candidates. Maximal degree in co-relation 10587. Up to 856 conditions per place. [2023-11-29 02:30:24,854 INFO L140 encePairwiseOnDemand]: 669/685 looper letters, 69 selfloop transitions, 20 changer transitions 0/662 dead transitions. [2023-11-29 02:30:24,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 662 transitions, 2025 flow [2023-11-29 02:30:24,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:30:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 02:30:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6934 transitions. [2023-11-29 02:30:24,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9202388852023888 [2023-11-29 02:30:24,859 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6934 transitions. [2023-11-29 02:30:24,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6934 transitions. [2023-11-29 02:30:24,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:24,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6934 transitions. [2023-11-29 02:30:24,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 630.3636363636364) internal successors, (6934), 11 states have internal predecessors, (6934), 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-29 02:30:24,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:24,868 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 685.0) internal successors, (8220), 12 states have internal predecessors, (8220), 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-29 02:30:24,868 INFO L175 Difference]: Start difference. First operand has 654 places, 639 transitions, 1755 flow. Second operand 11 states and 6934 transitions. [2023-11-29 02:30:24,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 662 transitions, 2025 flow [2023-11-29 02:30:24,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 662 transitions, 2018 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:30:24,885 INFO L231 Difference]: Finished difference. Result has 663 places, 647 transitions, 1865 flow [2023-11-29 02:30:24,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1865, PETRI_PLACES=663, PETRI_TRANSITIONS=647} [2023-11-29 02:30:24,886 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 28 predicate places. [2023-11-29 02:30:24,886 INFO L495 AbstractCegarLoop]: Abstraction has has 663 places, 647 transitions, 1865 flow [2023-11-29 02:30:24,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 628.5) internal successors, (5028), 8 states have internal predecessors, (5028), 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-29 02:30:24,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:24,887 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:24,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 02:30:24,887 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:24,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:24,888 INFO L85 PathProgramCache]: Analyzing trace with hash -513240801, now seen corresponding path program 1 times [2023-11-29 02:30:24,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:24,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136579085] [2023-11-29 02:30:24,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:24,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:25,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:25,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:25,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136579085] [2023-11-29 02:30:25,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136579085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:25,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:25,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:25,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374151104] [2023-11-29 02:30:25,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:25,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:25,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:25,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:25,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:26,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 635 out of 685 [2023-11-29 02:30:26,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 647 transitions, 1865 flow. Second operand has 6 states, 6 states have (on average 637.8333333333334) internal successors, (3827), 6 states have internal predecessors, (3827), 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-29 02:30:26,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:26,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 635 of 685 [2023-11-29 02:30:26,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:28,573 INFO L124 PetriNetUnfolderBase]: 655/10093 cut-off events. [2023-11-29 02:30:28,573 INFO L125 PetriNetUnfolderBase]: For 1969/2013 co-relation queries the response was YES. [2023-11-29 02:30:28,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14238 conditions, 10093 events. 655/10093 cut-off events. For 1969/2013 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 106717 event pairs, 42 based on Foata normal form. 10/9386 useless extension candidates. Maximal degree in co-relation 14113. Up to 282 conditions per place. [2023-11-29 02:30:28,727 INFO L140 encePairwiseOnDemand]: 677/685 looper letters, 42 selfloop transitions, 6 changer transitions 0/654 dead transitions. [2023-11-29 02:30:28,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 654 transitions, 1987 flow [2023-11-29 02:30:28,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:28,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3854 transitions. [2023-11-29 02:30:28,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.937712895377129 [2023-11-29 02:30:28,730 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3854 transitions. [2023-11-29 02:30:28,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3854 transitions. [2023-11-29 02:30:28,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:28,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3854 transitions. [2023-11-29 02:30:28,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 642.3333333333334) internal successors, (3854), 6 states have internal predecessors, (3854), 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-29 02:30:28,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:28,735 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:28,735 INFO L175 Difference]: Start difference. First operand has 663 places, 647 transitions, 1865 flow. Second operand 6 states and 3854 transitions. [2023-11-29 02:30:28,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 654 transitions, 1987 flow [2023-11-29 02:30:28,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 654 transitions, 1966 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-29 02:30:28,760 INFO L231 Difference]: Finished difference. Result has 660 places, 646 transitions, 1863 flow [2023-11-29 02:30:28,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1840, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1863, PETRI_PLACES=660, PETRI_TRANSITIONS=646} [2023-11-29 02:30:28,761 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 25 predicate places. [2023-11-29 02:30:28,762 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 646 transitions, 1863 flow [2023-11-29 02:30:28,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 637.8333333333334) internal successors, (3827), 6 states have internal predecessors, (3827), 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-29 02:30:28,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:28,762 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:28,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 02:30:28,762 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:28,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:28,763 INFO L85 PathProgramCache]: Analyzing trace with hash 667731516, now seen corresponding path program 1 times [2023-11-29 02:30:28,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:28,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78860633] [2023-11-29 02:30:28,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:28,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:29,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:29,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78860633] [2023-11-29 02:30:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78860633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:29,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982312301] [2023-11-29 02:30:29,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:29,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:29,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:29,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:30,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 635 out of 685 [2023-11-29 02:30:30,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 646 transitions, 1863 flow. Second operand has 6 states, 6 states have (on average 638.0) internal successors, (3828), 6 states have internal predecessors, (3828), 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-29 02:30:30,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:30,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 635 of 685 [2023-11-29 02:30:30,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:32,885 INFO L124 PetriNetUnfolderBase]: 744/11258 cut-off events. [2023-11-29 02:30:32,886 INFO L125 PetriNetUnfolderBase]: For 2112/2219 co-relation queries the response was YES. [2023-11-29 02:30:33,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15796 conditions, 11258 events. 744/11258 cut-off events. For 2112/2219 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 122164 event pairs, 70 based on Foata normal form. 15/10463 useless extension candidates. Maximal degree in co-relation 15671. Up to 378 conditions per place. [2023-11-29 02:30:33,096 INFO L140 encePairwiseOnDemand]: 677/685 looper letters, 42 selfloop transitions, 6 changer transitions 0/653 dead transitions. [2023-11-29 02:30:33,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 653 transitions, 1985 flow [2023-11-29 02:30:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:33,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3854 transitions. [2023-11-29 02:30:33,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.937712895377129 [2023-11-29 02:30:33,101 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3854 transitions. [2023-11-29 02:30:33,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3854 transitions. [2023-11-29 02:30:33,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:33,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3854 transitions. [2023-11-29 02:30:33,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 642.3333333333334) internal successors, (3854), 6 states have internal predecessors, (3854), 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-29 02:30:33,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:33,110 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:33,110 INFO L175 Difference]: Start difference. First operand has 660 places, 646 transitions, 1863 flow. Second operand 6 states and 3854 transitions. [2023-11-29 02:30:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 653 transitions, 1985 flow [2023-11-29 02:30:33,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 653 transitions, 1972 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 02:30:33,152 INFO L231 Difference]: Finished difference. Result has 660 places, 645 transitions, 1869 flow [2023-11-29 02:30:33,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1869, PETRI_PLACES=660, PETRI_TRANSITIONS=645} [2023-11-29 02:30:33,153 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 25 predicate places. [2023-11-29 02:30:33,154 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 645 transitions, 1869 flow [2023-11-29 02:30:33,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 638.0) internal successors, (3828), 6 states have internal predecessors, (3828), 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-29 02:30:33,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:33,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:33,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 02:30:33,155 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:33,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:33,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1739914590, now seen corresponding path program 1 times [2023-11-29 02:30:33,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:33,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589636463] [2023-11-29 02:30:33,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:33,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:33,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:33,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589636463] [2023-11-29 02:30:33,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589636463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:33,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:33,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:33,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353978011] [2023-11-29 02:30:33,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:33,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:33,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:33,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:33,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:33,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 685 [2023-11-29 02:30:33,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 645 transitions, 1869 flow. Second operand has 3 states, 3 states have (on average 652.6666666666666) internal successors, (1958), 3 states have internal predecessors, (1958), 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-29 02:30:33,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:33,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 685 [2023-11-29 02:30:33,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:35,795 INFO L124 PetriNetUnfolderBase]: 742/9931 cut-off events. [2023-11-29 02:30:35,795 INFO L125 PetriNetUnfolderBase]: For 1406/1410 co-relation queries the response was YES. [2023-11-29 02:30:35,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13548 conditions, 9931 events. 742/9931 cut-off events. For 1406/1410 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 100966 event pairs, 79 based on Foata normal form. 0/9192 useless extension candidates. Maximal degree in co-relation 13423. Up to 558 conditions per place. [2023-11-29 02:30:35,962 INFO L140 encePairwiseOnDemand]: 679/685 looper letters, 19 selfloop transitions, 2 changer transitions 0/647 dead transitions. [2023-11-29 02:30:35,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 647 transitions, 1919 flow [2023-11-29 02:30:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1978 transitions. [2023-11-29 02:30:35,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625304136253041 [2023-11-29 02:30:35,964 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1978 transitions. [2023-11-29 02:30:35,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1978 transitions. [2023-11-29 02:30:35,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:35,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1978 transitions. [2023-11-29 02:30:35,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 659.3333333333334) internal successors, (1978), 3 states have internal predecessors, (1978), 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-29 02:30:35,967 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:35,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:35,967 INFO L175 Difference]: Start difference. First operand has 660 places, 645 transitions, 1869 flow. Second operand 3 states and 1978 transitions. [2023-11-29 02:30:35,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 647 transitions, 1919 flow [2023-11-29 02:30:35,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 647 transitions, 1906 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 02:30:35,986 INFO L231 Difference]: Finished difference. Result has 655 places, 643 transitions, 1862 flow [2023-11-29 02:30:35,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1862, PETRI_PLACES=655, PETRI_TRANSITIONS=643} [2023-11-29 02:30:35,987 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 20 predicate places. [2023-11-29 02:30:35,988 INFO L495 AbstractCegarLoop]: Abstraction has has 655 places, 643 transitions, 1862 flow [2023-11-29 02:30:35,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 652.6666666666666) internal successors, (1958), 3 states have internal predecessors, (1958), 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-29 02:30:35,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:35,988 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:35,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 02:30:35,988 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:35,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash 55434693, now seen corresponding path program 1 times [2023-11-29 02:30:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:35,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412262310] [2023-11-29 02:30:35,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:36,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:36,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412262310] [2023-11-29 02:30:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412262310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:36,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257333392] [2023-11-29 02:30:36,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:36,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:36,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:36,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:37,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 635 out of 685 [2023-11-29 02:30:37,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 643 transitions, 1862 flow. Second operand has 6 states, 6 states have (on average 637.8333333333334) internal successors, (3827), 6 states have internal predecessors, (3827), 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-29 02:30:37,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:37,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 635 of 685 [2023-11-29 02:30:37,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:39,772 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1570] L50-8-->L50-9: Formula: (= |v_#race~get2~0_1| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_1|} AuxVars[] AssignedVars[#race~get2~0][577], [714#(= |#race~n3~0| 0), 970#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 606#L70-1true, 727#(= |#race~count2~0| 0), 108#L50-9true, 747#(= |#race~get1~0| 0), 973#true, 811#true, 141#L90-1true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 645#L122-4true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:39,772 INFO L294 olderBase$Statistics]: this new event has 389 ancestors and is cut-off event [2023-11-29 02:30:39,772 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2023-11-29 02:30:39,772 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2023-11-29 02:30:39,772 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2023-11-29 02:30:39,781 INFO L124 PetriNetUnfolderBase]: 730/11274 cut-off events. [2023-11-29 02:30:39,781 INFO L125 PetriNetUnfolderBase]: For 2142/2190 co-relation queries the response was YES. [2023-11-29 02:30:39,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15844 conditions, 11274 events. 730/11274 cut-off events. For 2142/2190 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 119794 event pairs, 45 based on Foata normal form. 10/10576 useless extension candidates. Maximal degree in co-relation 15718. Up to 306 conditions per place. [2023-11-29 02:30:39,901 INFO L140 encePairwiseOnDemand]: 677/685 looper letters, 42 selfloop transitions, 6 changer transitions 0/649 dead transitions. [2023-11-29 02:30:39,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 649 transitions, 1978 flow [2023-11-29 02:30:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:39,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3854 transitions. [2023-11-29 02:30:39,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.937712895377129 [2023-11-29 02:30:39,903 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3854 transitions. [2023-11-29 02:30:39,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3854 transitions. [2023-11-29 02:30:39,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:39,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3854 transitions. [2023-11-29 02:30:39,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 642.3333333333334) internal successors, (3854), 6 states have internal predecessors, (3854), 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-29 02:30:39,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:39,910 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:39,910 INFO L175 Difference]: Start difference. First operand has 655 places, 643 transitions, 1862 flow. Second operand 6 states and 3854 transitions. [2023-11-29 02:30:39,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 649 transitions, 1978 flow [2023-11-29 02:30:39,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 649 transitions, 1978 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-29 02:30:39,933 INFO L231 Difference]: Finished difference. Result has 658 places, 641 transitions, 1870 flow [2023-11-29 02:30:39,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=641, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1870, PETRI_PLACES=658, PETRI_TRANSITIONS=641} [2023-11-29 02:30:39,934 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 23 predicate places. [2023-11-29 02:30:39,934 INFO L495 AbstractCegarLoop]: Abstraction has has 658 places, 641 transitions, 1870 flow [2023-11-29 02:30:39,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 637.8333333333334) internal successors, (3827), 6 states have internal predecessors, (3827), 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-29 02:30:39,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:39,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:39,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 02:30:39,935 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:39,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1077285951, now seen corresponding path program 1 times [2023-11-29 02:30:39,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:39,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179937284] [2023-11-29 02:30:39,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:39,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:40,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179937284] [2023-11-29 02:30:40,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179937284] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:40,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:40,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879232751] [2023-11-29 02:30:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:40,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:40,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:40,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:40,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:41,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 635 out of 685 [2023-11-29 02:30:41,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 641 transitions, 1870 flow. Second operand has 6 states, 6 states have (on average 638.1666666666666) internal successors, (3829), 6 states have internal predecessors, (3829), 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-29 02:30:41,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:41,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 635 of 685 [2023-11-29 02:30:41,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:43,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1851] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][617], [714#(= |#race~n3~0| 0), 970#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 973#true, 755#(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)), 982#(= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), 332#L90-4true, Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 536#L124-7true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:43,203 INFO L294 olderBase$Statistics]: this new event has 370 ancestors and is cut-off event [2023-11-29 02:30:43,204 INFO L297 olderBase$Statistics]: existing Event has 370 ancestors and is cut-off event [2023-11-29 02:30:43,204 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2023-11-29 02:30:43,204 INFO L297 olderBase$Statistics]: existing Event has 370 ancestors and is cut-off event [2023-11-29 02:30:43,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1851] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][621], [983#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0)), 714#(= |#race~n3~0| 0), 970#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 973#true, 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 143#L90-5true, 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 536#L124-7true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:43,207 INFO L294 olderBase$Statistics]: this new event has 371 ancestors and is cut-off event [2023-11-29 02:30:43,207 INFO L297 olderBase$Statistics]: existing Event has 371 ancestors and is cut-off event [2023-11-29 02:30:43,207 INFO L297 olderBase$Statistics]: existing Event has 371 ancestors and is cut-off event [2023-11-29 02:30:43,207 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2023-11-29 02:30:43,211 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1851] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][624], [714#(= |#race~n3~0| 0), 970#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 984#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0)), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 973#true, 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 436#L90-6true, Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 536#L124-7true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:43,211 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-29 02:30:43,211 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 02:30:43,211 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 02:30:43,211 INFO L297 olderBase$Statistics]: existing Event has 341 ancestors and is cut-off event [2023-11-29 02:30:43,215 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1851] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][628], [714#(= |#race~n3~0| 0), 970#(= |#race~get3~0| 0), 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 973#true, 755#(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)), 811#true, 112#L90-7true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 536#L124-7true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:43,215 INFO L294 olderBase$Statistics]: this new event has 373 ancestors and is cut-off event [2023-11-29 02:30:43,215 INFO L297 olderBase$Statistics]: existing Event has 373 ancestors and is cut-off event [2023-11-29 02:30:43,215 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2023-11-29 02:30:43,215 INFO L297 olderBase$Statistics]: existing Event has 373 ancestors and is cut-off event [2023-11-29 02:30:43,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1851] thread2EXIT-->L124-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_6|} AuxVars[] AssignedVars[][628], [714#(= |#race~n3~0| 0), 970#(= |#race~get3~0| 0), 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), 642#L90-8true, Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 973#true, 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 536#L124-7true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:43,218 INFO L294 olderBase$Statistics]: this new event has 374 ancestors and is cut-off event [2023-11-29 02:30:43,218 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-29 02:30:43,218 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2023-11-29 02:30:43,219 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2023-11-29 02:30:43,245 INFO L124 PetriNetUnfolderBase]: 694/8027 cut-off events. [2023-11-29 02:30:43,245 INFO L125 PetriNetUnfolderBase]: For 2077/2103 co-relation queries the response was YES. [2023-11-29 02:30:43,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11978 conditions, 8027 events. 694/8027 cut-off events. For 2077/2103 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 81276 event pairs, 87 based on Foata normal form. 4/7574 useless extension candidates. Maximal degree in co-relation 11851. Up to 440 conditions per place. [2023-11-29 02:30:43,331 INFO L140 encePairwiseOnDemand]: 677/685 looper letters, 42 selfloop transitions, 6 changer transitions 0/648 dead transitions. [2023-11-29 02:30:43,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 648 transitions, 1992 flow [2023-11-29 02:30:43,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3854 transitions. [2023-11-29 02:30:43,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.937712895377129 [2023-11-29 02:30:43,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3854 transitions. [2023-11-29 02:30:43,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3854 transitions. [2023-11-29 02:30:43,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:43,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3854 transitions. [2023-11-29 02:30:43,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 642.3333333333334) internal successors, (3854), 6 states have internal predecessors, (3854), 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-29 02:30:43,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:43,340 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:43,340 INFO L175 Difference]: Start difference. First operand has 658 places, 641 transitions, 1870 flow. Second operand 6 states and 3854 transitions. [2023-11-29 02:30:43,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 648 transitions, 1992 flow [2023-11-29 02:30:43,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 648 transitions, 1980 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:30:43,359 INFO L231 Difference]: Finished difference. Result has 657 places, 640 transitions, 1877 flow [2023-11-29 02:30:43,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=639, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1877, PETRI_PLACES=657, PETRI_TRANSITIONS=640} [2023-11-29 02:30:43,360 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 22 predicate places. [2023-11-29 02:30:43,360 INFO L495 AbstractCegarLoop]: Abstraction has has 657 places, 640 transitions, 1877 flow [2023-11-29 02:30:43,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 638.1666666666666) internal successors, (3829), 6 states have internal predecessors, (3829), 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-29 02:30:43,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:43,361 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:43,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 02:30:43,361 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:43,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:43,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1749832094, now seen corresponding path program 1 times [2023-11-29 02:30:43,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:43,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127103556] [2023-11-29 02:30:43,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:43,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:43,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:43,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127103556] [2023-11-29 02:30:43,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127103556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:43,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:43,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310487813] [2023-11-29 02:30:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:44,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 635 out of 685 [2023-11-29 02:30:44,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 640 transitions, 1877 flow. Second operand has 6 states, 6 states have (on average 638.0) internal successors, (3828), 6 states have internal predecessors, (3828), 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-29 02:30:44,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:44,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 635 of 685 [2023-11-29 02:30:44,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:47,615 INFO L124 PetriNetUnfolderBase]: 785/11740 cut-off events. [2023-11-29 02:30:47,615 INFO L125 PetriNetUnfolderBase]: For 2460/2558 co-relation queries the response was YES. [2023-11-29 02:30:47,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17092 conditions, 11740 events. 785/11740 cut-off events. For 2460/2558 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 128321 event pairs, 72 based on Foata normal form. 17/11119 useless extension candidates. Maximal degree in co-relation 16964. Up to 417 conditions per place. [2023-11-29 02:30:47,746 INFO L140 encePairwiseOnDemand]: 677/685 looper letters, 42 selfloop transitions, 6 changer transitions 0/646 dead transitions. [2023-11-29 02:30:47,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 646 transitions, 1993 flow [2023-11-29 02:30:47,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3854 transitions. [2023-11-29 02:30:47,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.937712895377129 [2023-11-29 02:30:47,749 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3854 transitions. [2023-11-29 02:30:47,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3854 transitions. [2023-11-29 02:30:47,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:47,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3854 transitions. [2023-11-29 02:30:47,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 642.3333333333334) internal successors, (3854), 6 states have internal predecessors, (3854), 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-29 02:30:47,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:47,754 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:47,754 INFO L175 Difference]: Start difference. First operand has 657 places, 640 transitions, 1877 flow. Second operand 6 states and 3854 transitions. [2023-11-29 02:30:47,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 646 transitions, 1993 flow [2023-11-29 02:30:47,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 646 transitions, 1980 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 02:30:47,782 INFO L231 Difference]: Finished difference. Result has 656 places, 638 transitions, 1872 flow [2023-11-29 02:30:47,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1872, PETRI_PLACES=656, PETRI_TRANSITIONS=638} [2023-11-29 02:30:47,783 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 21 predicate places. [2023-11-29 02:30:47,783 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 638 transitions, 1872 flow [2023-11-29 02:30:47,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 638.0) internal successors, (3828), 6 states have internal predecessors, (3828), 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-29 02:30:47,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:47,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:47,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 02:30:47,784 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:47,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:47,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1481157669, now seen corresponding path program 1 times [2023-11-29 02:30:47,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:47,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672654545] [2023-11-29 02:30:47,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:47,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:47,912 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-29 02:30:47,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:47,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672654545] [2023-11-29 02:30:47,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672654545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:47,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:47,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:30:47,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835457356] [2023-11-29 02:30:47,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:47,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:47,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:47,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:47,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:47,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 685 [2023-11-29 02:30:47,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 638 transitions, 1872 flow. Second operand has 3 states, 3 states have (on average 663.3333333333334) internal successors, (1990), 3 states have internal predecessors, (1990), 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-29 02:30:47,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:47,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 685 [2023-11-29 02:30:47,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:50,307 INFO L124 PetriNetUnfolderBase]: 484/8922 cut-off events. [2023-11-29 02:30:50,307 INFO L125 PetriNetUnfolderBase]: For 1694/1707 co-relation queries the response was YES. [2023-11-29 02:30:50,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12603 conditions, 8922 events. 484/8922 cut-off events. For 1694/1707 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 88916 event pairs, 22 based on Foata normal form. 58/8583 useless extension candidates. Maximal degree in co-relation 12476. Up to 192 conditions per place. [2023-11-29 02:30:50,391 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 11 selfloop transitions, 2 changer transitions 0/642 dead transitions. [2023-11-29 02:30:50,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 642 transitions, 1910 flow [2023-11-29 02:30:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:50,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1997 transitions. [2023-11-29 02:30:50,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9717761557177615 [2023-11-29 02:30:50,393 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1997 transitions. [2023-11-29 02:30:50,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1997 transitions. [2023-11-29 02:30:50,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:50,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1997 transitions. [2023-11-29 02:30:50,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 665.6666666666666) internal successors, (1997), 3 states have internal predecessors, (1997), 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-29 02:30:50,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:50,398 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:50,398 INFO L175 Difference]: Start difference. First operand has 656 places, 638 transitions, 1872 flow. Second operand 3 states and 1997 transitions. [2023-11-29 02:30:50,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 642 transitions, 1910 flow [2023-11-29 02:30:50,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 642 transitions, 1898 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:30:50,424 INFO L231 Difference]: Finished difference. Result has 654 places, 638 transitions, 1868 flow [2023-11-29 02:30:50,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1860, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1868, PETRI_PLACES=654, PETRI_TRANSITIONS=638} [2023-11-29 02:30:50,424 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 19 predicate places. [2023-11-29 02:30:50,425 INFO L495 AbstractCegarLoop]: Abstraction has has 654 places, 638 transitions, 1868 flow [2023-11-29 02:30:50,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.3333333333334) internal successors, (1990), 3 states have internal predecessors, (1990), 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-29 02:30:50,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:50,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:50,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 02:30:50,425 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:50,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash 446746054, now seen corresponding path program 1 times [2023-11-29 02:30:50,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:50,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128564279] [2023-11-29 02:30:50,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:50,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:50,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:50,911 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-29 02:30:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:50,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128564279] [2023-11-29 02:30:50,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128564279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:50,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:50,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:50,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267743887] [2023-11-29 02:30:50,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:50,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:50,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:51,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 642 out of 685 [2023-11-29 02:30:51,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 638 transitions, 1868 flow. Second operand has 6 states, 6 states have (on average 644.0) internal successors, (3864), 6 states have internal predecessors, (3864), 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-29 02:30:51,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:51,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 642 of 685 [2023-11-29 02:30:51,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:53,296 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 714#(= |#race~n3~0| 0), 970#(= |#race~get3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 484#L125-7true, 997#(= thread2Thread1of1ForFork0_~stop~1 0), 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:53,296 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 02:30:53,296 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:30:53,296 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is not cut-off event [2023-11-29 02:30:53,296 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:30:53,304 INFO L124 PetriNetUnfolderBase]: 315/6219 cut-off events. [2023-11-29 02:30:53,304 INFO L125 PetriNetUnfolderBase]: For 1010/1026 co-relation queries the response was YES. [2023-11-29 02:30:53,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8684 conditions, 6219 events. 315/6219 cut-off events. For 1010/1026 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 55796 event pairs, 2 based on Foata normal form. 0/5907 useless extension candidates. Maximal degree in co-relation 8554. Up to 154 conditions per place. [2023-11-29 02:30:53,357 INFO L140 encePairwiseOnDemand]: 680/685 looper letters, 21 selfloop transitions, 4 changer transitions 0/637 dead transitions. [2023-11-29 02:30:53,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 637 transitions, 1916 flow [2023-11-29 02:30:53,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3878 transitions. [2023-11-29 02:30:53,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9435523114355231 [2023-11-29 02:30:53,360 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3878 transitions. [2023-11-29 02:30:53,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3878 transitions. [2023-11-29 02:30:53,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:53,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3878 transitions. [2023-11-29 02:30:53,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 646.3333333333334) internal successors, (3878), 6 states have internal predecessors, (3878), 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-29 02:30:53,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:53,366 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:53,366 INFO L175 Difference]: Start difference. First operand has 654 places, 638 transitions, 1868 flow. Second operand 6 states and 3878 transitions. [2023-11-29 02:30:53,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 637 transitions, 1916 flow [2023-11-29 02:30:53,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 637 transitions, 1912 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:30:53,381 INFO L231 Difference]: Finished difference. Result has 656 places, 637 transitions, 1870 flow [2023-11-29 02:30:53,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1862, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=637, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1870, PETRI_PLACES=656, PETRI_TRANSITIONS=637} [2023-11-29 02:30:53,382 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 21 predicate places. [2023-11-29 02:30:53,382 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 637 transitions, 1870 flow [2023-11-29 02:30:53,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 644.0) internal successors, (3864), 6 states have internal predecessors, (3864), 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-29 02:30:53,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:53,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:53,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 02:30:53,383 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:53,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash -913340569, now seen corresponding path program 1 times [2023-11-29 02:30:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711991791] [2023-11-29 02:30:53,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:53,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:53,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711991791] [2023-11-29 02:30:53,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711991791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:53,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:53,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:30:53,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871037590] [2023-11-29 02:30:53,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:53,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:53,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:53,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:53,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:54,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 635 out of 685 [2023-11-29 02:30:54,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 637 transitions, 1870 flow. Second operand has 6 states, 6 states have (on average 638.1666666666666) internal successors, (3829), 6 states have internal predecessors, (3829), 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-29 02:30:54,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:54,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 635 of 685 [2023-11-29 02:30:54,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:56,669 INFO L124 PetriNetUnfolderBase]: 643/8192 cut-off events. [2023-11-29 02:30:56,669 INFO L125 PetriNetUnfolderBase]: For 2196/2242 co-relation queries the response was YES. [2023-11-29 02:30:56,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12238 conditions, 8192 events. 643/8192 cut-off events. For 2196/2242 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 83039 event pairs, 93 based on Foata normal form. 8/7820 useless extension candidates. Maximal degree in co-relation 12109. Up to 466 conditions per place. [2023-11-29 02:30:56,737 INFO L140 encePairwiseOnDemand]: 677/685 looper letters, 42 selfloop transitions, 6 changer transitions 0/643 dead transitions. [2023-11-29 02:30:56,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 643 transitions, 1986 flow [2023-11-29 02:30:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:30:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:30:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3854 transitions. [2023-11-29 02:30:56,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.937712895377129 [2023-11-29 02:30:56,740 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3854 transitions. [2023-11-29 02:30:56,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3854 transitions. [2023-11-29 02:30:56,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:56,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3854 transitions. [2023-11-29 02:30:56,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 642.3333333333334) internal successors, (3854), 6 states have internal predecessors, (3854), 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-29 02:30:56,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:56,745 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 685.0) internal successors, (4795), 7 states have internal predecessors, (4795), 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-29 02:30:56,745 INFO L175 Difference]: Start difference. First operand has 656 places, 637 transitions, 1870 flow. Second operand 6 states and 3854 transitions. [2023-11-29 02:30:56,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 643 transitions, 1986 flow [2023-11-29 02:30:56,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 643 transitions, 1979 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:30:56,765 INFO L231 Difference]: Finished difference. Result has 655 places, 635 transitions, 1871 flow [2023-11-29 02:30:56,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1871, PETRI_PLACES=655, PETRI_TRANSITIONS=635} [2023-11-29 02:30:56,765 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 20 predicate places. [2023-11-29 02:30:56,765 INFO L495 AbstractCegarLoop]: Abstraction has has 655 places, 635 transitions, 1871 flow [2023-11-29 02:30:56,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 638.1666666666666) internal successors, (3829), 6 states have internal predecessors, (3829), 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-29 02:30:56,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:56,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:56,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 02:30:56,766 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:56,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2039856184, now seen corresponding path program 1 times [2023-11-29 02:30:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078582004] [2023-11-29 02:30:56,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:56,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:56,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078582004] [2023-11-29 02:30:56,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078582004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:56,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:56,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:56,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53654584] [2023-11-29 02:30:56,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:56,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:56,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:56,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:56,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:56,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 656 out of 685 [2023-11-29 02:30:56,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 635 transitions, 1871 flow. Second operand has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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-29 02:30:56,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:56,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 656 of 685 [2023-11-29 02:30:56,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:30:59,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 1014#true, 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 933#(<= ~n3~0 0), 732#(= |#race~count3~0| 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 1007#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:30:59,464 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 02:30:59,464 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:30:59,464 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:30:59,464 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is not cut-off event [2023-11-29 02:30:59,473 INFO L124 PetriNetUnfolderBase]: 615/10908 cut-off events. [2023-11-29 02:30:59,473 INFO L125 PetriNetUnfolderBase]: For 1975/1995 co-relation queries the response was YES. [2023-11-29 02:30:59,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15476 conditions, 10908 events. 615/10908 cut-off events. For 1975/1995 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 114996 event pairs, 46 based on Foata normal form. 0/10431 useless extension candidates. Maximal degree in co-relation 15348. Up to 304 conditions per place. [2023-11-29 02:30:59,612 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 13 selfloop transitions, 2 changer transitions 0/636 dead transitions. [2023-11-29 02:30:59,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 636 transitions, 1905 flow [2023-11-29 02:30:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:30:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1984 transitions. [2023-11-29 02:30:59,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9654501216545012 [2023-11-29 02:30:59,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1984 transitions. [2023-11-29 02:30:59,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1984 transitions. [2023-11-29 02:30:59,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:30:59,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1984 transitions. [2023-11-29 02:30:59,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 661.3333333333334) internal successors, (1984), 3 states have internal predecessors, (1984), 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-29 02:30:59,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:59,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:30:59,617 INFO L175 Difference]: Start difference. First operand has 655 places, 635 transitions, 1871 flow. Second operand 3 states and 1984 transitions. [2023-11-29 02:30:59,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 636 transitions, 1905 flow [2023-11-29 02:30:59,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 636 transitions, 1893 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:30:59,643 INFO L231 Difference]: Finished difference. Result has 651 places, 634 transitions, 1861 flow [2023-11-29 02:30:59,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1857, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1861, PETRI_PLACES=651, PETRI_TRANSITIONS=634} [2023-11-29 02:30:59,644 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 16 predicate places. [2023-11-29 02:30:59,644 INFO L495 AbstractCegarLoop]: Abstraction has has 651 places, 634 transitions, 1861 flow [2023-11-29 02:30:59,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.3333333333334) internal successors, (1972), 3 states have internal predecessors, (1972), 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-29 02:30:59,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:30:59,644 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:30:59,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 02:30:59,645 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:30:59,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1095439372, now seen corresponding path program 1 times [2023-11-29 02:30:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850194812] [2023-11-29 02:30:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:30:59,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:59,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850194812] [2023-11-29 02:30:59,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850194812] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:59,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:59,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:30:59,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933012156] [2023-11-29 02:30:59,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:59,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:59,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:59,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:59,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:30:59,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:30:59,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 634 transitions, 1861 flow. Second operand has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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-29 02:30:59,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:30:59,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:30:59,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:02,462 INFO L124 PetriNetUnfolderBase]: 711/11577 cut-off events. [2023-11-29 02:31:02,462 INFO L125 PetriNetUnfolderBase]: For 1840/1892 co-relation queries the response was YES. [2023-11-29 02:31:02,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16177 conditions, 11577 events. 711/11577 cut-off events. For 1840/1892 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 124280 event pairs, 90 based on Foata normal form. 1/11058 useless extension candidates. Maximal degree in co-relation 16116. Up to 388 conditions per place. [2023-11-29 02:31:02,581 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/635 dead transitions. [2023-11-29 02:31:02,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 635 transitions, 1897 flow [2023-11-29 02:31:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:31:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:31:02,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1982 transitions. [2023-11-29 02:31:02,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644768856447689 [2023-11-29 02:31:02,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1982 transitions. [2023-11-29 02:31:02,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1982 transitions. [2023-11-29 02:31:02,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:02,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1982 transitions. [2023-11-29 02:31:02,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.6666666666666) internal successors, (1982), 3 states have internal predecessors, (1982), 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-29 02:31:02,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:02,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:02,585 INFO L175 Difference]: Start difference. First operand has 651 places, 634 transitions, 1861 flow. Second operand 3 states and 1982 transitions. [2023-11-29 02:31:02,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 635 transitions, 1897 flow [2023-11-29 02:31:02,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 635 transitions, 1893 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:31:02,611 INFO L231 Difference]: Finished difference. Result has 650 places, 633 transitions, 1859 flow [2023-11-29 02:31:02,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1855, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1859, PETRI_PLACES=650, PETRI_TRANSITIONS=633} [2023-11-29 02:31:02,612 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 15 predicate places. [2023-11-29 02:31:02,612 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 633 transitions, 1859 flow [2023-11-29 02:31:02,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 656.6666666666666) internal successors, (1970), 3 states have internal predecessors, (1970), 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-29 02:31:02,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:02,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:31:02,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2023-11-29 02:31:02,612 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:31:02,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -250152823, now seen corresponding path program 1 times [2023-11-29 02:31:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349530432] [2023-11-29 02:31:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:02,664 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-29 02:31:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349530432] [2023-11-29 02:31:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349530432] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:02,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:02,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:31:02,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614535899] [2023-11-29 02:31:02,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:31:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:31:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:31:02,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 685 [2023-11-29 02:31:02,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 633 transitions, 1859 flow. Second operand has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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-29 02:31:02,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:31:02,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 685 [2023-11-29 02:31:02,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:05,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1018#true, 1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 933#(<= ~n3~0 0), 732#(= |#race~count3~0| 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 1022#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:05,241 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 02:31:05,241 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:31:05,241 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:31:05,241 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is not cut-off event [2023-11-29 02:31:05,250 INFO L124 PetriNetUnfolderBase]: 597/10792 cut-off events. [2023-11-29 02:31:05,251 INFO L125 PetriNetUnfolderBase]: For 1909/1929 co-relation queries the response was YES. [2023-11-29 02:31:05,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15134 conditions, 10792 events. 597/10792 cut-off events. For 1909/1929 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 113539 event pairs, 42 based on Foata normal form. 0/10351 useless extension candidates. Maximal degree in co-relation 15006. Up to 304 conditions per place. [2023-11-29 02:31:05,388 INFO L140 encePairwiseOnDemand]: 683/685 looper letters, 10 selfloop transitions, 1 changer transitions 0/632 dead transitions. [2023-11-29 02:31:05,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 632 transitions, 1879 flow [2023-11-29 02:31:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:31:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:31:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1986 transitions. [2023-11-29 02:31:05,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9664233576642336 [2023-11-29 02:31:05,389 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1986 transitions. [2023-11-29 02:31:05,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1986 transitions. [2023-11-29 02:31:05,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:05,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1986 transitions. [2023-11-29 02:31:05,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 662.0) internal successors, (1986), 3 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:31:05,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:05,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:05,392 INFO L175 Difference]: Start difference. First operand has 650 places, 633 transitions, 1859 flow. Second operand 3 states and 1986 transitions. [2023-11-29 02:31:05,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 632 transitions, 1879 flow [2023-11-29 02:31:05,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 632 transitions, 1875 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:31:05,417 INFO L231 Difference]: Finished difference. Result has 649 places, 632 transitions, 1855 flow [2023-11-29 02:31:05,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1853, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=631, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1855, PETRI_PLACES=649, PETRI_TRANSITIONS=632} [2023-11-29 02:31:05,418 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 14 predicate places. [2023-11-29 02:31:05,418 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 632 transitions, 1855 flow [2023-11-29 02:31:05,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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-29 02:31:05,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:05,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:31:05,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2023-11-29 02:31:05,419 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:31:05,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash 333672056, now seen corresponding path program 1 times [2023-11-29 02:31:05,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:05,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776222334] [2023-11-29 02:31:05,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:31:05,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:05,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776222334] [2023-11-29 02:31:05,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776222334] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:05,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:05,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:31:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909005143] [2023-11-29 02:31:05,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:05,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:31:05,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:05,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:31:05,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:31:05,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:31:05,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 632 transitions, 1855 flow. Second operand has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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-29 02:31:05,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:31:05,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:31:05,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:07,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1786] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][398], [970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 521#L97-7true, Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 1026#true, Black: 745#true, 536#L124-7true, 1022#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:07,168 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-29 02:31:07,168 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 02:31:07,168 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 02:31:07,168 INFO L297 olderBase$Statistics]: existing Event has 412 ancestors and is cut-off event [2023-11-29 02:31:07,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 1026#true, Black: 745#true, 1022#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:07,196 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 02:31:07,196 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:31:07,196 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is not cut-off event [2023-11-29 02:31:07,196 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:31:07,197 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 1026#true, Black: 745#true, 1022#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:07,197 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 02:31:07,197 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 02:31:07,197 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is cut-off event [2023-11-29 02:31:07,197 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2023-11-29 02:31:07,197 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 02:31:07,205 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1786] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][398], [970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), 926#(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: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 521#L97-7true, Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 1026#true, Black: 745#true, 536#L124-7true, 1022#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:07,205 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2023-11-29 02:31:07,205 INFO L297 olderBase$Statistics]: existing Event has 372 ancestors and is cut-off event [2023-11-29 02:31:07,205 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 02:31:07,205 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 02:31:07,205 INFO L297 olderBase$Statistics]: existing Event has 412 ancestors and is cut-off event [2023-11-29 02:31:07,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 997#(= thread2Thread1of1ForFork0_~stop~1 0), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 1026#true, Black: 745#true, 1022#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:07,210 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is not cut-off event [2023-11-29 02:31:07,210 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2023-11-29 02:31:07,210 INFO L297 olderBase$Statistics]: existing Event has 421 ancestors and is not cut-off event [2023-11-29 02:31:07,210 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2023-11-29 02:31:07,218 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1786] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][398], [970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 521#L97-7true, Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 997#(= thread2Thread1of1ForFork0_~stop~1 0), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), 1026#true, Black: 745#true, 536#L124-7true, 1022#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:07,218 INFO L294 olderBase$Statistics]: this new event has 402 ancestors and is cut-off event [2023-11-29 02:31:07,218 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2023-11-29 02:31:07,218 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2023-11-29 02:31:07,218 INFO L297 olderBase$Statistics]: existing Event has 418 ancestors and is cut-off event [2023-11-29 02:31:07,220 INFO L124 PetriNetUnfolderBase]: 487/7171 cut-off events. [2023-11-29 02:31:07,220 INFO L125 PetriNetUnfolderBase]: For 1168/1244 co-relation queries the response was YES. [2023-11-29 02:31:07,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10085 conditions, 7171 events. 487/7171 cut-off events. For 1168/1244 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 69697 event pairs, 105 based on Foata normal form. 0/6838 useless extension candidates. Maximal degree in co-relation 9957. Up to 482 conditions per place. [2023-11-29 02:31:07,323 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 14 selfloop transitions, 2 changer transitions 0/633 dead transitions. [2023-11-29 02:31:07,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 633 transitions, 1891 flow [2023-11-29 02:31:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:31:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:31:07,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1982 transitions. [2023-11-29 02:31:07,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9644768856447689 [2023-11-29 02:31:07,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1982 transitions. [2023-11-29 02:31:07,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1982 transitions. [2023-11-29 02:31:07,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:07,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1982 transitions. [2023-11-29 02:31:07,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.6666666666666) internal successors, (1982), 3 states have internal predecessors, (1982), 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-29 02:31:07,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:07,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:07,328 INFO L175 Difference]: Start difference. First operand has 649 places, 632 transitions, 1855 flow. Second operand 3 states and 1982 transitions. [2023-11-29 02:31:07,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 633 transitions, 1891 flow [2023-11-29 02:31:07,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 633 transitions, 1890 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:31:07,346 INFO L231 Difference]: Finished difference. Result has 649 places, 631 transitions, 1856 flow [2023-11-29 02:31:07,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1852, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1856, PETRI_PLACES=649, PETRI_TRANSITIONS=631} [2023-11-29 02:31:07,347 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 14 predicate places. [2023-11-29 02:31:07,347 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 631 transitions, 1856 flow [2023-11-29 02:31:07,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 657.0) internal successors, (1971), 3 states have internal predecessors, (1971), 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-29 02:31:07,347 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:07,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:31:07,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 02:31:07,347 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:31:07,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 47054181, now seen corresponding path program 1 times [2023-11-29 02:31:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360552161] [2023-11-29 02:31:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:07,401 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-29 02:31:07,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:07,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360552161] [2023-11-29 02:31:07,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360552161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:07,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:07,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:31:07,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815814077] [2023-11-29 02:31:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:07,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:31:07,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:07,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:31:07,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:31:07,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:31:07,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 631 transitions, 1856 flow. Second operand has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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-29 02:31:07,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:31:07,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:31:07,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:10,208 INFO L124 PetriNetUnfolderBase]: 718/12055 cut-off events. [2023-11-29 02:31:10,208 INFO L125 PetriNetUnfolderBase]: For 1917/1961 co-relation queries the response was YES. [2023-11-29 02:31:10,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16934 conditions, 12055 events. 718/12055 cut-off events. For 1917/1961 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 128792 event pairs, 81 based on Foata normal form. 0/11604 useless extension candidates. Maximal degree in co-relation 16806. Up to 420 conditions per place. [2023-11-29 02:31:10,388 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 12 selfloop transitions, 1 changer transitions 0/629 dead transitions. [2023-11-29 02:31:10,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 629 transitions, 1878 flow [2023-11-29 02:31:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:31:10,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:31:10,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1980 transitions. [2023-11-29 02:31:10,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9635036496350365 [2023-11-29 02:31:10,390 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1980 transitions. [2023-11-29 02:31:10,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1980 transitions. [2023-11-29 02:31:10,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:10,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1980 transitions. [2023-11-29 02:31:10,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 660.0) internal successors, (1980), 3 states have internal predecessors, (1980), 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-29 02:31:10,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:10,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:10,393 INFO L175 Difference]: Start difference. First operand has 649 places, 631 transitions, 1856 flow. Second operand 3 states and 1980 transitions. [2023-11-29 02:31:10,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 629 transitions, 1878 flow [2023-11-29 02:31:10,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 629 transitions, 1874 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:31:10,425 INFO L231 Difference]: Finished difference. Result has 647 places, 629 transitions, 1850 flow [2023-11-29 02:31:10,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=629, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1850, PETRI_PLACES=647, PETRI_TRANSITIONS=629} [2023-11-29 02:31:10,426 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 12 predicate places. [2023-11-29 02:31:10,426 INFO L495 AbstractCegarLoop]: Abstraction has has 647 places, 629 transitions, 1850 flow [2023-11-29 02:31:10,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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-29 02:31:10,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:31:10,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-29 02:31:10,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2023-11-29 02:31:10,426 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 136 more)] === [2023-11-29 02:31:10,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:10,427 INFO L85 PathProgramCache]: Analyzing trace with hash 51061963, now seen corresponding path program 1 times [2023-11-29 02:31:10,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:10,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968649881] [2023-11-29 02:31:10,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:10,481 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-29 02:31:10,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:10,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968649881] [2023-11-29 02:31:10,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968649881] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:10,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:10,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:31:10,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127579170] [2023-11-29 02:31:10,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:10,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:31:10,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:10,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:31:10,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:31:10,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 655 out of 685 [2023-11-29 02:31:10,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 629 transitions, 1850 flow. Second operand has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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-29 02:31:10,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:31:10,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 655 of 685 [2023-11-29 02:31:10,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:31:12,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1786] L97-6-->L97-7: Formula: (= |v_thread3Thread1of1ForFork1_#t~nondet26_3| |v_#race~res3~0_4|) InVars {thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork1_#t~nondet26=|v_thread3Thread1of1ForFork1_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_4|} AuxVars[] AssignedVars[#race~res3~0][398], [970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), 1030#true, Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 521#L97-7true, Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, 1034#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, 536#L124-7true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:12,122 INFO L294 olderBase$Statistics]: this new event has 372 ancestors and is cut-off event [2023-11-29 02:31:12,122 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 02:31:12,122 INFO L297 olderBase$Statistics]: existing Event has 412 ancestors and is cut-off event [2023-11-29 02:31:12,122 INFO L297 olderBase$Statistics]: existing Event has 381 ancestors and is cut-off event [2023-11-29 02:31:12,142 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), 1030#true, Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 770#(<= ~n1~0 0), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), 722#(= |#race~count1~0| 0), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, 1034#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:12,142 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is not cut-off event [2023-11-29 02:31:12,142 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:31:12,142 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is not cut-off event [2023-11-29 02:31:12,142 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is not cut-off event [2023-11-29 02:31:12,143 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), 1030#true, Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, 1034#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:12,143 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2023-11-29 02:31:12,143 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 02:31:12,144 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2023-11-29 02:31:12,144 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2023-11-29 02:31:12,144 INFO L297 olderBase$Statistics]: existing Event has 415 ancestors and is cut-off event [2023-11-29 02:31:12,151 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1852] thread3EXIT-->L125-7: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem54#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_#t~mem54#1=|v_ULTIMATE.start_main_#t~mem54#1_6|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][522], [1005#(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)), 970#(= |#race~get3~0| 0), 714#(= |#race~n3~0| 0), 1030#true, Black: 778#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 776#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 784#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork2_#t~short2|) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 908#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 770#(<= ~n1~0 0), Black: 901#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 771#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 906#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 900#(<= ~n3~0 0), Black: 914#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 797#(not |thread2Thread1of1ForFork0_#t~short11|), 691#(= |#race~n1~0| 0), Black: 803#(not |thread3Thread1of1ForFork1_#t~short20|), 926#(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|)))), 727#(= |#race~count2~0| 0), 484#L125-7true, 747#(= |#race~get1~0| 0), 755#(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)), 811#true, Black: 934#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 732#(= |#race~count3~0| 0), Black: 933#(<= ~n3~0 0), Black: 947#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 957#(and (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 2 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread1Thread1of1ForFork2_~i~0 4) 3 ~get1~0.offset)) 0)), Black: 830#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short11|)), Black: 817#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 816#(<= ~n1~0 0), 722#(= |#race~count1~0| 0), Black: 965#(and (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get1~0.offset)) 0) (= 0 (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset 1))) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get1~0.offset)) 0)), Black: 836#true, Black: 968#true, 706#(= |#race~n2~0| 0), Black: 720#true, 838#(= |#race~get2~0| 0), Black: 725#true, Black: 985#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 730#true, 1034#true, Black: 850#(<= ~n2~0 0), Black: 851#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 856#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 864#(and (not |thread3Thread1of1ForFork1_#t~short20|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 858#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 997#(= thread2Thread1of1ForFork0_~stop~1 0), Black: 741#(not |thread1Thread1of1ForFork2_#t~short2|), Black: 745#true, Black: 890#(and (not |thread1Thread1of1ForFork2_#t~short2|) (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 876#(<= ~n2~0 0), Black: 877#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork2_~i~0 0))]) [2023-11-29 02:31:12,151 INFO L294 olderBase$Statistics]: this new event has 390 ancestors and is not cut-off event [2023-11-29 02:31:12,151 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2023-11-29 02:31:12,151 INFO L297 olderBase$Statistics]: existing Event has 421 ancestors and is not cut-off event [2023-11-29 02:31:12,151 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is not cut-off event [2023-11-29 02:31:12,157 INFO L124 PetriNetUnfolderBase]: 433/6864 cut-off events. [2023-11-29 02:31:12,157 INFO L125 PetriNetUnfolderBase]: For 1127/1203 co-relation queries the response was YES. [2023-11-29 02:31:12,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9667 conditions, 6864 events. 433/6864 cut-off events. For 1127/1203 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 66078 event pairs, 94 based on Foata normal form. 18/6625 useless extension candidates. Maximal degree in co-relation 9539. Up to 392 conditions per place. [2023-11-29 02:31:12,228 INFO L140 encePairwiseOnDemand]: 682/685 looper letters, 0 selfloop transitions, 0 changer transitions 627/627 dead transitions. [2023-11-29 02:31:12,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 627 transitions, 1870 flow [2023-11-29 02:31:12,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:31:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:31:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1979 transitions. [2023-11-29 02:31:12,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9630170316301703 [2023-11-29 02:31:12,230 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1979 transitions. [2023-11-29 02:31:12,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1979 transitions. [2023-11-29 02:31:12,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:31:12,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1979 transitions. [2023-11-29 02:31:12,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 659.6666666666666) internal successors, (1979), 3 states have internal predecessors, (1979), 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-29 02:31:12,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:12,233 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 685.0) internal successors, (2740), 4 states have internal predecessors, (2740), 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-29 02:31:12,233 INFO L175 Difference]: Start difference. First operand has 647 places, 629 transitions, 1850 flow. Second operand 3 states and 1979 transitions. [2023-11-29 02:31:12,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 627 transitions, 1870 flow [2023-11-29 02:31:12,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 646 places, 627 transitions, 1869 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:31:12,248 INFO L231 Difference]: Finished difference. Result has 646 places, 0 transitions, 0 flow [2023-11-29 02:31:12,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=685, PETRI_DIFFERENCE_MINUEND_FLOW=1845, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=646, PETRI_TRANSITIONS=0} [2023-11-29 02:31:12,249 INFO L281 CegarLoopForPetriNet]: 635 programPoint places, 11 predicate places. [2023-11-29 02:31:12,249 INFO L495 AbstractCegarLoop]: Abstraction has has 646 places, 0 transitions, 0 flow [2023-11-29 02:31:12,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 658.0) internal successors, (1974), 3 states have internal predecessors, (1974), 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-29 02:31:12,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (139 of 140 remaining) [2023-11-29 02:31:12,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (138 of 140 remaining) [2023-11-29 02:31:12,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (137 of 140 remaining) [2023-11-29 02:31:12,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (136 of 140 remaining) [2023-11-29 02:31:12,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (135 of 140 remaining) [2023-11-29 02:31:12,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (134 of 140 remaining) [2023-11-29 02:31:12,252 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (133 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (132 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (131 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (130 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (129 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (128 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (127 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (126 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (125 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (124 of 140 remaining) [2023-11-29 02:31:12,253 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (123 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (122 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (121 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (120 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (119 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (118 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (117 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (116 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (115 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (114 of 140 remaining) [2023-11-29 02:31:12,254 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (113 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (112 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (111 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (110 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (109 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (108 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (107 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (106 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (105 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (103 of 140 remaining) [2023-11-29 02:31:12,255 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (102 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (101 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (100 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (99 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (98 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (97 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (96 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (95 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (94 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (93 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (92 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (91 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (90 of 140 remaining) [2023-11-29 02:31:12,256 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (89 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (88 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (87 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (86 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (84 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (83 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (82 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (81 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (80 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (79 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (78 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (77 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (76 of 140 remaining) [2023-11-29 02:31:12,257 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (75 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (74 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (73 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (72 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (71 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (70 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (69 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (68 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (67 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (66 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (65 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (64 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (63 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (62 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (61 of 140 remaining) [2023-11-29 02:31:12,258 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (60 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (56 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (55 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (52 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (51 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (49 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (48 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 140 remaining) [2023-11-29 02:31:12,259 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (46 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (42 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (41 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (40 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (38 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (33 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (32 of 140 remaining) [2023-11-29 02:31:12,260 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (30 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (29 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (28 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (27 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (26 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (24 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (23 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (22 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (20 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (19 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (18 of 140 remaining) [2023-11-29 02:31:12,261 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (17 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (14 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (11 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (10 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (9 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (8 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (7 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (5 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (3 of 140 remaining) [2023-11-29 02:31:12,262 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (2 of 140 remaining) [2023-11-29 02:31:12,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (1 of 140 remaining) [2023-11-29 02:31:12,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (0 of 140 remaining) [2023-11-29 02:31:12,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2023-11-29 02:31:12,263 INFO L445 BasicCegarLoop]: Path program 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] [2023-11-29 02:31:12,268 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:31:12,268 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:31:12,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:31:12 BasicIcfg [2023-11-29 02:31:12,274 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:31:12,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:31:12,275 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:31:12,275 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:31:12,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:55" (3/4) ... [2023-11-29 02:31:12,276 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 02:31:12,279 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-29 02:31:12,279 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-29 02:31:12,279 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-29 02:31:12,288 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2023-11-29 02:31:12,289 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-29 02:31:12,290 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 02:31:12,290 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 02:31:12,385 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 02:31:12,386 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 02:31:12,386 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:31:12,387 INFO L158 Benchmark]: Toolchain (without parser) took 138574.01ms. Allocated memory was 148.9MB in the beginning and 12.9GB in the end (delta: 12.8GB). Free memory was 116.0MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 5.5GB. Max. memory is 16.1GB. [2023-11-29 02:31:12,387 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 148.9MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:31:12,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.44ms. Allocated memory is still 148.9MB. Free memory was 115.6MB in the beginning and 101.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.40ms. Allocated memory is still 148.9MB. Free memory was 101.5MB in the beginning and 98.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,388 INFO L158 Benchmark]: Boogie Preprocessor took 66.61ms. Allocated memory is still 148.9MB. Free memory was 98.7MB in the beginning and 94.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,389 INFO L158 Benchmark]: RCFGBuilder took 1041.61ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 94.9MB in the beginning and 147.5MB in the end (delta: -52.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,389 INFO L158 Benchmark]: TraceAbstraction took 136954.02ms. Allocated memory was 192.9MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 147.5MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. [2023-11-29 02:31:12,390 INFO L158 Benchmark]: Witness Printer took 111.89ms. Allocated memory is still 12.9GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-29 02:31:12,391 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 148.9MB. Free memory is still 121.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.44ms. Allocated memory is still 148.9MB. Free memory was 115.6MB in the beginning and 101.5MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.40ms. Allocated memory is still 148.9MB. Free memory was 101.5MB in the beginning and 98.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.61ms. Allocated memory is still 148.9MB. Free memory was 98.7MB in the beginning and 94.9MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1041.61ms. Allocated memory was 148.9MB in the beginning and 192.9MB in the end (delta: 44.0MB). Free memory was 94.9MB in the beginning and 147.5MB in the end (delta: -52.6MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * TraceAbstraction took 136954.02ms. Allocated memory was 192.9MB in the beginning and 12.9GB in the end (delta: 12.7GB). Free memory was 147.5MB in the beginning and 7.4GB in the end (delta: -7.3GB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. * Witness Printer took 111.89ms. Allocated memory is still 12.9GB. Free memory was 7.4GB in the beginning and 7.4GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 980 locations, 140 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 136.7s, OverallIterations: 50, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 127.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8606 SdHoareTripleChecker+Valid, 11.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5096 mSDsluCounter, 6898 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6379 mSDsCounter, 2320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13806 IncrementalHoareTripleChecker+Invalid, 16126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2320 mSolverCounterUnsat, 519 mSDtfsCounter, 13806 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1877occurred in iteration=40, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 9445 NumberOfCodeBlocks, 9445 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 9395 ConstructedInterpolants, 0 QuantifiedInterpolants, 11766 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 50 InterpolantComputations, 50 PerfectInterpolantSequences, 23/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 80 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 02:31:12,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1792267b-b252-4388-8d7d-66b93a567d9e/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE