./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-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_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme --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 d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:45:37,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:45:37,914 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 10:45:37,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:45:37,926 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:45:37,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:45:37,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:45:37,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:45:37,970 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:45:37,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:45:37,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:45:37,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:45:37,977 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:45:37,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:45:37,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 10:45:37,979 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:45:37,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:45:37,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:45:37,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:45:37,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 10:45:37,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:45:37,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 10:45:37,982 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 10:45:37,983 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:45:37,983 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:45:37,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 10:45:37,984 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:45:37,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:45:37,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:45:37,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:45:37,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:37,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:45:37,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:45:37,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 10:45:37,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:45:37,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:45:37,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:45:37,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:45:37,989 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 10:45:37,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:45:37,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:45:37,990 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_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/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_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme 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 -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2023-11-26 10:45:38,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:45:38,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:45:38,302 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:45:38,303 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:45:38,304 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:45:38,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2023-11-26 10:45:41,490 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:45:41,718 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:45:41,718 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2023-11-26 10:45:41,727 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/data/9ae292ab0/a3f187740b6545868f501c2a73b6d2db/FLAG2e9e72b22 [2023-11-26 10:45:41,743 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/data/9ae292ab0/a3f187740b6545868f501c2a73b6d2db [2023-11-26 10:45:41,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:45:41,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:45:41,749 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:41,749 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:45:41,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:45:41,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:41" (1/1) ... [2023-11-26 10:45:41,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23ef0139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:41, skipping insertion in model container [2023-11-26 10:45:41,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:45:41" (1/1) ... [2023-11-26 10:45:41,786 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:45:41,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:42,006 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:45:42,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:45:42,062 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:45:42,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42 WrapperNode [2023-11-26 10:45:42,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:45:42,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:42,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:45:42,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:45:42,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,129 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 335 [2023-11-26 10:45:42,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:45:42,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:45:42,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:45:42,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:45:42,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,161 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:45:42,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:45:42,177 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:45:42,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:45:42,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (1/1) ... [2023-11-26 10:45:42,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:45:42,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:45:42,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:45:42,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:45:42,287 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 10:45:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 10:45:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 10:45:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 10:45:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-26 10:45:42,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-26 10:45:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 10:45:42,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:45:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 10:45:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:45:42,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:45:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 10:45:42,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:45:42,291 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:45:42,421 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:45:42,423 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:45:43,112 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:45:43,136 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:45:43,137 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:45:43,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:43 BoogieIcfgContainer [2023-11-26 10:45:43,139 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:45:43,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:45:43,142 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:45:43,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:45:43,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:45:41" (1/3) ... [2023-11-26 10:45:43,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a567e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:43, skipping insertion in model container [2023-11-26 10:45:43,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:45:42" (2/3) ... [2023-11-26 10:45:43,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a567e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:45:43, skipping insertion in model container [2023-11-26 10:45:43,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:43" (3/3) ... [2023-11-26 10:45:43,149 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2023-11-26 10:45:43,156 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 10:45:43,168 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:45:43,169 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-26 10:45:43,169 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:45:43,320 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-26 10:45:43,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 436 transitions, 893 flow [2023-11-26 10:45:43,655 INFO L124 PetriNetUnfolderBase]: 21/433 cut-off events. [2023-11-26 10:45:43,656 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 10:45:43,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 433 events. 21/433 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1122 event pairs, 0 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 277. Up to 2 conditions per place. [2023-11-26 10:45:43,676 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 436 transitions, 893 flow [2023-11-26 10:45:43,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 398 places, 407 transitions, 832 flow [2023-11-26 10:45:43,717 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:45:43,726 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;@4545fda4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:45:43,726 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2023-11-26 10:45:43,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:45:43,737 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2023-11-26 10:45:43,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:45:43,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:43,738 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-26 10:45:43,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:43,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1470829248, now seen corresponding path program 1 times [2023-11-26 10:45:43,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98011898] [2023-11-26 10:45:43,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:43,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:44,103 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-26 10:45:44,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:44,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98011898] [2023-11-26 10:45:44,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98011898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:44,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:44,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661276483] [2023-11-26 10:45:44,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:44,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:44,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:44,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:44,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-26 10:45:44,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 407 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:44,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:44,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-26 10:45:44,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:44,526 INFO L124 PetriNetUnfolderBase]: 35/763 cut-off events. [2023-11-26 10:45:44,526 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-26 10:45:44,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 763 events. 35/763 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3613 event pairs, 7 based on Foata normal form. 25/659 useless extension candidates. Maximal degree in co-relation 636. Up to 25 conditions per place. [2023-11-26 10:45:44,542 INFO L140 encePairwiseOnDemand]: 426/436 looper letters, 11 selfloop transitions, 2 changer transitions 1/399 dead transitions. [2023-11-26 10:45:44,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 399 transitions, 842 flow [2023-11-26 10:45:44,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-26 10:45:44,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-26 10:45:44,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-26 10:45:44,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-26 10:45:44,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:44,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-26 10:45:44,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:44,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:44,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:44,602 INFO L175 Difference]: Start difference. First operand has 398 places, 407 transitions, 832 flow. Second operand 3 states and 1257 transitions. [2023-11-26 10:45:44,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 399 transitions, 842 flow [2023-11-26 10:45:44,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 399 transitions, 830 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-26 10:45:44,628 INFO L231 Difference]: Finished difference. Result has 393 places, 398 transitions, 806 flow [2023-11-26 10:45:44,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=393, PETRI_TRANSITIONS=398} [2023-11-26 10:45:44,636 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -5 predicate places. [2023-11-26 10:45:44,637 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 398 transitions, 806 flow [2023-11-26 10:45:44,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:44,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:44,639 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-26 10:45:44,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:45:44,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:44,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:44,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1786652556, now seen corresponding path program 1 times [2023-11-26 10:45:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983382236] [2023-11-26 10:45:44,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:44,748 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-26 10:45:44,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:44,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983382236] [2023-11-26 10:45:44,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983382236] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:44,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:44,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:44,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299924117] [2023-11-26 10:45:44,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:44,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:44,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-26 10:45:44,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:44,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:44,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-26 10:45:44,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:45,021 INFO L124 PetriNetUnfolderBase]: 25/592 cut-off events. [2023-11-26 10:45:45,021 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-26 10:45:45,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 592 events. 25/592 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2355 event pairs, 5 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 588. Up to 22 conditions per place. [2023-11-26 10:45:45,031 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2023-11-26 10:45:45,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 397 transitions, 830 flow [2023-11-26 10:45:45,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-26 10:45:45,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-26 10:45:45,038 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:45,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,050 INFO L175 Difference]: Start difference. First operand has 393 places, 398 transitions, 806 flow. Second operand 3 states and 1250 transitions. [2023-11-26 10:45:45,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 397 transitions, 830 flow [2023-11-26 10:45:45,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 397 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:45,061 INFO L231 Difference]: Finished difference. Result has 391 places, 397 transitions, 804 flow [2023-11-26 10:45:45,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=391, PETRI_TRANSITIONS=397} [2023-11-26 10:45:45,063 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -7 predicate places. [2023-11-26 10:45:45,064 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 397 transitions, 804 flow [2023-11-26 10:45:45,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:45,066 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-26 10:45:45,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:45:45,070 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:45,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1132949206, now seen corresponding path program 1 times [2023-11-26 10:45:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75577312] [2023-11-26 10:45:45,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:45,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:45:45,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:45,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75577312] [2023-11-26 10:45:45,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75577312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:45,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:45,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:45,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33071722] [2023-11-26 10:45:45,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:45,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:45,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:45,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:45,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:45,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-26 10:45:45,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:45,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-26 10:45:45,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:45,403 INFO L124 PetriNetUnfolderBase]: 23/527 cut-off events. [2023-11-26 10:45:45,403 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 10:45:45,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 562 conditions, 527 events. 23/527 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1903 event pairs, 7 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 517. Up to 25 conditions per place. [2023-11-26 10:45:45,436 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2023-11-26 10:45:45,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 396 transitions, 828 flow [2023-11-26 10:45:45,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-26 10:45:45,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-26 10:45:45,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:45,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,454 INFO L175 Difference]: Start difference. First operand has 391 places, 397 transitions, 804 flow. Second operand 3 states and 1250 transitions. [2023-11-26 10:45:45,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 396 transitions, 828 flow [2023-11-26 10:45:45,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 396 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:45,464 INFO L231 Difference]: Finished difference. Result has 390 places, 396 transitions, 802 flow [2023-11-26 10:45:45,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=390, PETRI_TRANSITIONS=396} [2023-11-26 10:45:45,467 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -8 predicate places. [2023-11-26 10:45:45,468 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 396 transitions, 802 flow [2023-11-26 10:45:45,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,469 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:45,469 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] [2023-11-26 10:45:45,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:45:45,470 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:45,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash 761874010, now seen corresponding path program 1 times [2023-11-26 10:45:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:45,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220693458] [2023-11-26 10:45:45,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:45,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:45,538 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-26 10:45:45,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:45,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220693458] [2023-11-26 10:45:45,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220693458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:45,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:45,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:45,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762721238] [2023-11-26 10:45:45,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:45,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:45,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:45,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:45,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:45,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-26 10:45:45,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 396 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:45,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-26 10:45:45,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:45,791 INFO L124 PetriNetUnfolderBase]: 43/864 cut-off events. [2023-11-26 10:45:45,791 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:45:45,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 864 events. 43/864 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4652 event pairs, 7 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 849. Up to 25 conditions per place. [2023-11-26 10:45:45,808 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2023-11-26 10:45:45,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 395 transitions, 826 flow [2023-11-26 10:45:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-26 10:45:45,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-26 10:45:45,814 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:45,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-26 10:45:45,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,827 INFO L175 Difference]: Start difference. First operand has 390 places, 396 transitions, 802 flow. Second operand 3 states and 1250 transitions. [2023-11-26 10:45:45,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 395 transitions, 826 flow [2023-11-26 10:45:45,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 395 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:45,838 INFO L231 Difference]: Finished difference. Result has 389 places, 395 transitions, 800 flow [2023-11-26 10:45:45,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=389, PETRI_TRANSITIONS=395} [2023-11-26 10:45:45,841 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -9 predicate places. [2023-11-26 10:45:45,841 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 395 transitions, 800 flow [2023-11-26 10:45:45,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:45,843 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] [2023-11-26 10:45:45,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:45:45,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:45,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2062037054, now seen corresponding path program 1 times [2023-11-26 10:45:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:45,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550491643] [2023-11-26 10:45:45,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:45,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:45,951 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-26 10:45:45,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550491643] [2023-11-26 10:45:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550491643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:45,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:45,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:45,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814927883] [2023-11-26 10:45:45,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:45,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:45,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:45,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-26 10:45:45,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:45,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:45,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-26 10:45:45,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:46,208 INFO L124 PetriNetUnfolderBase]: 32/636 cut-off events. [2023-11-26 10:45:46,209 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-26 10:45:46,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 636 events. 32/636 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2890 event pairs, 8 based on Foata normal form. 0/535 useless extension candidates. Maximal degree in co-relation 618. Up to 29 conditions per place. [2023-11-26 10:45:46,220 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2023-11-26 10:45:46,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 394 transitions, 826 flow [2023-11-26 10:45:46,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2023-11-26 10:45:46,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9541284403669725 [2023-11-26 10:45:46,226 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1248 transitions. [2023-11-26 10:45:46,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1248 transitions. [2023-11-26 10:45:46,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:46,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1248 transitions. [2023-11-26 10:45:46,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,237 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,237 INFO L175 Difference]: Start difference. First operand has 389 places, 395 transitions, 800 flow. Second operand 3 states and 1248 transitions. [2023-11-26 10:45:46,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 394 transitions, 826 flow [2023-11-26 10:45:46,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 394 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:46,247 INFO L231 Difference]: Finished difference. Result has 388 places, 394 transitions, 798 flow [2023-11-26 10:45:46,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=388, PETRI_TRANSITIONS=394} [2023-11-26 10:45:46,249 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -10 predicate places. [2023-11-26 10:45:46,249 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 394 transitions, 798 flow [2023-11-26 10:45:46,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,251 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:46,251 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] [2023-11-26 10:45:46,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:45:46,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:46,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:46,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1379835437, now seen corresponding path program 1 times [2023-11-26 10:45:46,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:46,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896292124] [2023-11-26 10:45:46,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:46,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:46,316 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-26 10:45:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:46,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896292124] [2023-11-26 10:45:46,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896292124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:46,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:46,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029969654] [2023-11-26 10:45:46,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:46,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:46,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:46,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:46,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:46,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 436 [2023-11-26 10:45:46,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:46,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 436 [2023-11-26 10:45:46,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:46,595 INFO L124 PetriNetUnfolderBase]: 64/989 cut-off events. [2023-11-26 10:45:46,595 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-26 10:45:46,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1050 conditions, 989 events. 64/989 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5224 event pairs, 20 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 983. Up to 50 conditions per place. [2023-11-26 10:45:46,611 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 13 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2023-11-26 10:45:46,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 393 transitions, 826 flow [2023-11-26 10:45:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:46,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2023-11-26 10:45:46,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9525993883792049 [2023-11-26 10:45:46,616 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1246 transitions. [2023-11-26 10:45:46,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1246 transitions. [2023-11-26 10:45:46,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:46,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1246 transitions. [2023-11-26 10:45:46,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,628 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,628 INFO L175 Difference]: Start difference. First operand has 388 places, 394 transitions, 798 flow. Second operand 3 states and 1246 transitions. [2023-11-26 10:45:46,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 393 transitions, 826 flow [2023-11-26 10:45:46,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 393 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:46,638 INFO L231 Difference]: Finished difference. Result has 387 places, 393 transitions, 796 flow [2023-11-26 10:45:46,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=387, PETRI_TRANSITIONS=393} [2023-11-26 10:45:46,640 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -11 predicate places. [2023-11-26 10:45:46,640 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 393 transitions, 796 flow [2023-11-26 10:45:46,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:46,642 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-26 10:45:46,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:45:46,643 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:46,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash 32381843, now seen corresponding path program 1 times [2023-11-26 10:45:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:46,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428021285] [2023-11-26 10:45:46,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:46,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:46,693 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-26 10:45:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:46,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428021285] [2023-11-26 10:45:46,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428021285] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:46,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:46,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405074356] [2023-11-26 10:45:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:46,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:46,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:46,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:46,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:46,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-26 10:45:46,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:46,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-26 10:45:46,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:46,891 INFO L124 PetriNetUnfolderBase]: 35/756 cut-off events. [2023-11-26 10:45:46,892 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 10:45:46,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 756 events. 35/756 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3847 event pairs, 7 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 720. Up to 25 conditions per place. [2023-11-26 10:45:46,906 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2023-11-26 10:45:46,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 392 transitions, 820 flow [2023-11-26 10:45:46,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-26 10:45:46,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-26 10:45:46,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-26 10:45:46,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-26 10:45:46,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:46,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-26 10:45:46,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,921 INFO L175 Difference]: Start difference. First operand has 387 places, 393 transitions, 796 flow. Second operand 3 states and 1250 transitions. [2023-11-26 10:45:46,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 392 transitions, 820 flow [2023-11-26 10:45:46,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 392 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:46,932 INFO L231 Difference]: Finished difference. Result has 386 places, 392 transitions, 794 flow [2023-11-26 10:45:46,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=386, PETRI_TRANSITIONS=392} [2023-11-26 10:45:46,934 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-26 10:45:46,934 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 392 transitions, 794 flow [2023-11-26 10:45:46,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:46,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:46,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] [2023-11-26 10:45:46,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:45:46,936 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:46,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:46,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1143706390, now seen corresponding path program 1 times [2023-11-26 10:45:46,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:46,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402682679] [2023-11-26 10:45:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:46,990 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-26 10:45:46,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:46,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402682679] [2023-11-26 10:45:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402682679] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:46,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876577726] [2023-11-26 10:45:46,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:46,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:46,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:46,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:46,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:47,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-26 10:45:47,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 392 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:47,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-26 10:45:47,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:47,216 INFO L124 PetriNetUnfolderBase]: 41/868 cut-off events. [2023-11-26 10:45:47,216 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:45:47,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 868 events. 41/868 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4421 event pairs, 8 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 830. Up to 30 conditions per place. [2023-11-26 10:45:47,230 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2023-11-26 10:45:47,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 391 transitions, 820 flow [2023-11-26 10:45:47,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2023-11-26 10:45:47,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9541284403669725 [2023-11-26 10:45:47,235 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1248 transitions. [2023-11-26 10:45:47,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1248 transitions. [2023-11-26 10:45:47,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:47,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1248 transitions. [2023-11-26 10:45:47,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,244 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,245 INFO L175 Difference]: Start difference. First operand has 386 places, 392 transitions, 794 flow. Second operand 3 states and 1248 transitions. [2023-11-26 10:45:47,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 391 transitions, 820 flow [2023-11-26 10:45:47,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 391 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:47,255 INFO L231 Difference]: Finished difference. Result has 385 places, 391 transitions, 792 flow [2023-11-26 10:45:47,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=385, PETRI_TRANSITIONS=391} [2023-11-26 10:45:47,257 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -13 predicate places. [2023-11-26 10:45:47,257 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 391 transitions, 792 flow [2023-11-26 10:45:47,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:47,259 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] [2023-11-26 10:45:47,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:45:47,259 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:47,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash -542716821, now seen corresponding path program 1 times [2023-11-26 10:45:47,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:47,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800991039] [2023-11-26 10:45:47,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:47,307 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-26 10:45:47,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:47,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800991039] [2023-11-26 10:45:47,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800991039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:47,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:47,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:47,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525185002] [2023-11-26 10:45:47,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:47,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:47,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:47,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:47,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:47,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 436 [2023-11-26 10:45:47,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 391 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:47,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 436 [2023-11-26 10:45:47,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:47,516 INFO L124 PetriNetUnfolderBase]: 40/676 cut-off events. [2023-11-26 10:45:47,517 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-26 10:45:47,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 676 events. 40/676 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3232 event pairs, 20 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 649. Up to 50 conditions per place. [2023-11-26 10:45:47,529 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 13 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2023-11-26 10:45:47,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 390 transitions, 820 flow [2023-11-26 10:45:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2023-11-26 10:45:47,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9525993883792049 [2023-11-26 10:45:47,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1246 transitions. [2023-11-26 10:45:47,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1246 transitions. [2023-11-26 10:45:47,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:47,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1246 transitions. [2023-11-26 10:45:47,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,544 INFO L175 Difference]: Start difference. First operand has 385 places, 391 transitions, 792 flow. Second operand 3 states and 1246 transitions. [2023-11-26 10:45:47,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 390 transitions, 820 flow [2023-11-26 10:45:47,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 390 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:47,582 INFO L231 Difference]: Finished difference. Result has 384 places, 390 transitions, 790 flow [2023-11-26 10:45:47,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=384, PETRI_TRANSITIONS=390} [2023-11-26 10:45:47,584 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-26 10:45:47,584 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 390 transitions, 790 flow [2023-11-26 10:45:47,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:47,586 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] [2023-11-26 10:45:47,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:45:47,586 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:47,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 531324994, now seen corresponding path program 1 times [2023-11-26 10:45:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:47,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658335235] [2023-11-26 10:45:47,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:47,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:47,632 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-26 10:45:47,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:47,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658335235] [2023-11-26 10:45:47,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658335235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:47,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:47,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356663716] [2023-11-26 10:45:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:47,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:47,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:47,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:47,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:45:47,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 390 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:47,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:45:47,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:47,892 INFO L124 PetriNetUnfolderBase]: 76/1270 cut-off events. [2023-11-26 10:45:47,893 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-26 10:45:47,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1335 conditions, 1270 events. 76/1270 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 8853 event pairs, 13 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1240. Up to 43 conditions per place. [2023-11-26 10:45:47,911 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 13 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2023-11-26 10:45:47,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 392 transitions, 826 flow [2023-11-26 10:45:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:47,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2023-11-26 10:45:47,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625382262996942 [2023-11-26 10:45:47,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1259 transitions. [2023-11-26 10:45:47,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1259 transitions. [2023-11-26 10:45:47,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:47,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1259 transitions. [2023-11-26 10:45:47,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,925 INFO L175 Difference]: Start difference. First operand has 384 places, 390 transitions, 790 flow. Second operand 3 states and 1259 transitions. [2023-11-26 10:45:47,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 392 transitions, 826 flow [2023-11-26 10:45:47,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 392 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:47,936 INFO L231 Difference]: Finished difference. Result has 383 places, 390 transitions, 796 flow [2023-11-26 10:45:47,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=383, PETRI_TRANSITIONS=390} [2023-11-26 10:45:47,938 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-26 10:45:47,938 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 390 transitions, 796 flow [2023-11-26 10:45:47,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:47,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:47,939 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] [2023-11-26 10:45:47,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:45:47,939 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:47,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:47,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1749393631, now seen corresponding path program 1 times [2023-11-26 10:45:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:47,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196674060] [2023-11-26 10:45:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:47,987 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-26 10:45:47,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:47,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196674060] [2023-11-26 10:45:47,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196674060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:47,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:47,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:47,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828207575] [2023-11-26 10:45:47,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:47,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:47,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:47,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:47,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:48,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-26 10:45:48,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 390 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:48,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-26 10:45:48,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:48,336 INFO L124 PetriNetUnfolderBase]: 77/1314 cut-off events. [2023-11-26 10:45:48,337 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 10:45:48,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1314 events. 77/1314 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 8877 event pairs, 12 based on Foata normal form. 0/1104 useless extension candidates. Maximal degree in co-relation 1208. Up to 49 conditions per place. [2023-11-26 10:45:48,359 INFO L140 encePairwiseOnDemand]: 430/436 looper letters, 15 selfloop transitions, 3 changer transitions 0/392 dead transitions. [2023-11-26 10:45:48,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 392 transitions, 838 flow [2023-11-26 10:45:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2023-11-26 10:45:48,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9587155963302753 [2023-11-26 10:45:48,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2023-11-26 10:45:48,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2023-11-26 10:45:48,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:48,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2023-11-26 10:45:48,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,373 INFO L175 Difference]: Start difference. First operand has 383 places, 390 transitions, 796 flow. Second operand 3 states and 1254 transitions. [2023-11-26 10:45:48,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 392 transitions, 838 flow [2023-11-26 10:45:48,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 392 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:48,383 INFO L231 Difference]: Finished difference. Result has 383 places, 390 transitions, 811 flow [2023-11-26 10:45:48,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=383, PETRI_TRANSITIONS=390} [2023-11-26 10:45:48,385 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-26 10:45:48,385 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 390 transitions, 811 flow [2023-11-26 10:45:48,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:48,386 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] [2023-11-26 10:45:48,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:45:48,387 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:48,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1083096811, now seen corresponding path program 1 times [2023-11-26 10:45:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:48,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440905310] [2023-11-26 10:45:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:48,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:48,433 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-26 10:45:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440905310] [2023-11-26 10:45:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440905310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:48,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:48,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:48,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239565883] [2023-11-26 10:45:48,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:48,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:48,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:48,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:48,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:45:48,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 390 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:48,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:45:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:48,758 INFO L124 PetriNetUnfolderBase]: 70/1331 cut-off events. [2023-11-26 10:45:48,758 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2023-11-26 10:45:48,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1331 events. 70/1331 cut-off events. For 11/13 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 9456 event pairs, 4 based on Foata normal form. 1/1140 useless extension candidates. Maximal degree in co-relation 1158. Up to 53 conditions per place. [2023-11-26 10:45:48,777 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 16 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2023-11-26 10:45:48,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 395 transitions, 862 flow [2023-11-26 10:45:48,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2023-11-26 10:45:48,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9648318042813455 [2023-11-26 10:45:48,783 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1262 transitions. [2023-11-26 10:45:48,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1262 transitions. [2023-11-26 10:45:48,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:48,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1262 transitions. [2023-11-26 10:45:48,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,792 INFO L175 Difference]: Start difference. First operand has 383 places, 390 transitions, 811 flow. Second operand 3 states and 1262 transitions. [2023-11-26 10:45:48,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 395 transitions, 862 flow [2023-11-26 10:45:48,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 395 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:48,803 INFO L231 Difference]: Finished difference. Result has 384 places, 390 transitions, 821 flow [2023-11-26 10:45:48,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=384, PETRI_TRANSITIONS=390} [2023-11-26 10:45:48,807 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-26 10:45:48,807 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 390 transitions, 821 flow [2023-11-26 10:45:48,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:48,808 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] [2023-11-26 10:45:48,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:45:48,809 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:48,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1215499826, now seen corresponding path program 1 times [2023-11-26 10:45:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760878738] [2023-11-26 10:45:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:48,866 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-26 10:45:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760878738] [2023-11-26 10:45:48,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760878738] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:48,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:48,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:48,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281774780] [2023-11-26 10:45:48,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:48,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:48,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:48,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:48,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 436 [2023-11-26 10:45:48,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 390 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:48,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:48,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 436 [2023-11-26 10:45:48,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:49,147 INFO L124 PetriNetUnfolderBase]: 57/1105 cut-off events. [2023-11-26 10:45:49,147 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 10:45:49,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1211 conditions, 1105 events. 57/1105 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7200 event pairs, 8 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1012. Up to 32 conditions per place. [2023-11-26 10:45:49,192 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2023-11-26 10:45:49,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 391 transitions, 851 flow [2023-11-26 10:45:49,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2023-11-26 10:45:49,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625382262996942 [2023-11-26 10:45:49,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1259 transitions. [2023-11-26 10:45:49,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1259 transitions. [2023-11-26 10:45:49,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:49,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1259 transitions. [2023-11-26 10:45:49,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 419.6666666666667) internal successors, (1259), 3 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,208 INFO L175 Difference]: Start difference. First operand has 384 places, 390 transitions, 821 flow. Second operand 3 states and 1259 transitions. [2023-11-26 10:45:49,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 391 transitions, 851 flow [2023-11-26 10:45:49,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 391 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:49,218 INFO L231 Difference]: Finished difference. Result has 385 places, 389 transitions, 823 flow [2023-11-26 10:45:49,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=823, PETRI_PLACES=385, PETRI_TRANSITIONS=389} [2023-11-26 10:45:49,220 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -13 predicate places. [2023-11-26 10:45:49,220 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 389 transitions, 823 flow [2023-11-26 10:45:49,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:49,221 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] [2023-11-26 10:45:49,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:45:49,222 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:49,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1551195284, now seen corresponding path program 1 times [2023-11-26 10:45:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:49,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833901939] [2023-11-26 10:45:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:49,281 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-26 10:45:49,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:49,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833901939] [2023-11-26 10:45:49,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833901939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:49,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:49,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085962352] [2023-11-26 10:45:49,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:49,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:49,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:49,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:49,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:49,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-26 10:45:49,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 389 transitions, 823 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:49,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-26 10:45:49,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:49,724 INFO L124 PetriNetUnfolderBase]: 77/1536 cut-off events. [2023-11-26 10:45:49,725 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-26 10:45:49,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 1536 events. 77/1536 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 10491 event pairs, 6 based on Foata normal form. 0/1325 useless extension candidates. Maximal degree in co-relation 1464. Up to 69 conditions per place. [2023-11-26 10:45:49,747 INFO L140 encePairwiseOnDemand]: 430/436 looper letters, 18 selfloop transitions, 3 changer transitions 0/394 dead transitions. [2023-11-26 10:45:49,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 394 transitions, 880 flow [2023-11-26 10:45:49,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:49,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-26 10:45:49,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-26 10:45:49,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-26 10:45:49,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-26 10:45:49,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:49,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-26 10:45:49,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,761 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,761 INFO L175 Difference]: Start difference. First operand has 385 places, 389 transitions, 823 flow. Second operand 3 states and 1257 transitions. [2023-11-26 10:45:49,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 394 transitions, 880 flow [2023-11-26 10:45:49,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:49,771 INFO L231 Difference]: Finished difference. Result has 383 places, 389 transitions, 834 flow [2023-11-26 10:45:49,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=383, PETRI_TRANSITIONS=389} [2023-11-26 10:45:49,772 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-26 10:45:49,773 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 389 transitions, 834 flow [2023-11-26 10:45:49,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:49,774 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] [2023-11-26 10:45:49,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:45:49,774 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:49,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:49,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2142347228, now seen corresponding path program 1 times [2023-11-26 10:45:49,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:49,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822091979] [2023-11-26 10:45:49,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:49,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:49,824 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-26 10:45:49,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:49,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822091979] [2023-11-26 10:45:49,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822091979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:49,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:49,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:49,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710510367] [2023-11-26 10:45:49,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:49,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:49,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:49,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:49,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:49,844 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 436 [2023-11-26 10:45:49,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 389 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:49,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:49,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 436 [2023-11-26 10:45:49,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:50,829 INFO L124 PetriNetUnfolderBase]: 356/5024 cut-off events. [2023-11-26 10:45:50,829 INFO L125 PetriNetUnfolderBase]: For 69/83 co-relation queries the response was YES. [2023-11-26 10:45:50,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5505 conditions, 5024 events. 356/5024 cut-off events. For 69/83 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 55626 event pairs, 60 based on Foata normal form. 0/4318 useless extension candidates. Maximal degree in co-relation 4651. Up to 323 conditions per place. [2023-11-26 10:45:50,887 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 17 selfloop transitions, 4 changer transitions 0/391 dead transitions. [2023-11-26 10:45:50,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 391 transitions, 882 flow [2023-11-26 10:45:50,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2023-11-26 10:45:50,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9548929663608563 [2023-11-26 10:45:50,893 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1249 transitions. [2023-11-26 10:45:50,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1249 transitions. [2023-11-26 10:45:50,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:50,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1249 transitions. [2023-11-26 10:45:50,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 416.3333333333333) internal successors, (1249), 3 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:50,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:50,903 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:50,903 INFO L175 Difference]: Start difference. First operand has 383 places, 389 transitions, 834 flow. Second operand 3 states and 1249 transitions. [2023-11-26 10:45:50,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 391 transitions, 882 flow [2023-11-26 10:45:50,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 391 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:50,914 INFO L231 Difference]: Finished difference. Result has 382 places, 389 transitions, 854 flow [2023-11-26 10:45:50,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=382, PETRI_TRANSITIONS=389} [2023-11-26 10:45:50,916 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -16 predicate places. [2023-11-26 10:45:50,916 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 389 transitions, 854 flow [2023-11-26 10:45:50,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:50,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:50,917 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] [2023-11-26 10:45:50,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 10:45:50,918 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:50,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash -2104552009, now seen corresponding path program 1 times [2023-11-26 10:45:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130436975] [2023-11-26 10:45:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:50,978 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-26 10:45:50,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:50,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130436975] [2023-11-26 10:45:50,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130436975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:50,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:50,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795446451] [2023-11-26 10:45:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:50,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:50,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:50,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:50,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:51,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:45:51,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 389 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:51,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:51,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:45:51,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:51,733 INFO L124 PetriNetUnfolderBase]: 114/2653 cut-off events. [2023-11-26 10:45:51,733 INFO L125 PetriNetUnfolderBase]: For 27/29 co-relation queries the response was YES. [2023-11-26 10:45:51,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 2653 events. 114/2653 cut-off events. For 27/29 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 23414 event pairs, 4 based on Foata normal form. 0/2320 useless extension candidates. Maximal degree in co-relation 2418. Up to 68 conditions per place. [2023-11-26 10:45:51,770 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 16 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2023-11-26 10:45:51,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 394 transitions, 905 flow [2023-11-26 10:45:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2023-11-26 10:45:51,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9648318042813455 [2023-11-26 10:45:51,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1262 transitions. [2023-11-26 10:45:51,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1262 transitions. [2023-11-26 10:45:51,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:51,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1262 transitions. [2023-11-26 10:45:51,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:51,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:51,784 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:51,785 INFO L175 Difference]: Start difference. First operand has 382 places, 389 transitions, 854 flow. Second operand 3 states and 1262 transitions. [2023-11-26 10:45:51,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 394 transitions, 905 flow [2023-11-26 10:45:51,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 905 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:51,796 INFO L231 Difference]: Finished difference. Result has 383 places, 389 transitions, 864 flow [2023-11-26 10:45:51,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=850, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=864, PETRI_PLACES=383, PETRI_TRANSITIONS=389} [2023-11-26 10:45:51,799 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-26 10:45:51,799 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 389 transitions, 864 flow [2023-11-26 10:45:51,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:51,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:51,800 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] [2023-11-26 10:45:51,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 10:45:51,801 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:51,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:51,801 INFO L85 PathProgramCache]: Analyzing trace with hash 455148826, now seen corresponding path program 1 times [2023-11-26 10:45:51,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:51,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462311659] [2023-11-26 10:45:51,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:51,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:51,860 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-26 10:45:51,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:51,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462311659] [2023-11-26 10:45:51,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462311659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:51,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:51,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000656003] [2023-11-26 10:45:51,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:51,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:51,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:51,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:51,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:45:51,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 389 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:51,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:51,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:45:51,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:52,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][360], [397#L56-26true, 485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:45:52,679 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-11-26 10:45:52,679 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-26 10:45:52,679 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-26 10:45:52,679 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-26 10:45:52,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 179#L56-25true, 495#(= |#race~filename_1~0| 0), 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:45:52,680 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-11-26 10:45:52,680 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-26 10:45:52,680 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-26 10:45:52,680 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-26 10:45:52,683 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 179#L56-25true, 495#(= |#race~filename_1~0| 0), 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:45:52,684 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2023-11-26 10:45:52,684 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-26 10:45:52,684 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-26 10:45:52,684 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-26 10:45:52,684 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-26 10:45:52,722 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 397#L56-26true, Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:45:52,722 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2023-11-26 10:45:52,722 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-26 10:45:52,723 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-26 10:45:52,723 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-26 10:45:52,723 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-26 10:45:52,773 INFO L124 PetriNetUnfolderBase]: 126/3529 cut-off events. [2023-11-26 10:45:52,774 INFO L125 PetriNetUnfolderBase]: For 63/81 co-relation queries the response was YES. [2023-11-26 10:45:52,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 3529 events. 126/3529 cut-off events. For 63/81 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31771 event pairs, 12 based on Foata normal form. 0/3129 useless extension candidates. Maximal degree in co-relation 3392. Up to 140 conditions per place. [2023-11-26 10:45:52,829 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 16 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2023-11-26 10:45:52,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 394 transitions, 915 flow [2023-11-26 10:45:52,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:52,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2023-11-26 10:45:52,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9648318042813455 [2023-11-26 10:45:52,834 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1262 transitions. [2023-11-26 10:45:52,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1262 transitions. [2023-11-26 10:45:52,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:52,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1262 transitions. [2023-11-26 10:45:52,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:52,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:52,843 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:52,843 INFO L175 Difference]: Start difference. First operand has 383 places, 389 transitions, 864 flow. Second operand 3 states and 1262 transitions. [2023-11-26 10:45:52,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 394 transitions, 915 flow [2023-11-26 10:45:52,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 394 transitions, 915 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:52,853 INFO L231 Difference]: Finished difference. Result has 384 places, 389 transitions, 874 flow [2023-11-26 10:45:52,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=384, PETRI_TRANSITIONS=389} [2023-11-26 10:45:52,854 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-26 10:45:52,854 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 389 transitions, 874 flow [2023-11-26 10:45:52,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.3333333333333) internal successors, (1246), 3 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:52,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:52,855 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] [2023-11-26 10:45:52,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 10:45:52,856 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:52,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1372146367, now seen corresponding path program 1 times [2023-11-26 10:45:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520205198] [2023-11-26 10:45:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:52,916 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-26 10:45:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520205198] [2023-11-26 10:45:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520205198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:52,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:52,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341297400] [2023-11-26 10:45:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:52,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:52,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:52,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:52,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:45:52,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 389 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 415.6666666666667) internal successors, (1247), 3 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:52,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:52,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:45:52,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:54,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][366], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 503#true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 471#(= |#race~is_null_3~0| 0), Black: 469#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:45:54,077 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:45:54,077 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 10:45:54,077 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:54,078 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:54,079 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][366], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, Black: 493#true, 503#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 333#L80-7true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:45:54,080 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is not cut-off event [2023-11-26 10:45:54,080 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is not cut-off event [2023-11-26 10:45:54,080 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:45:54,080 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:45:54,081 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:45:54,104 INFO L124 PetriNetUnfolderBase]: 201/4811 cut-off events. [2023-11-26 10:45:54,104 INFO L125 PetriNetUnfolderBase]: For 63/160 co-relation queries the response was YES. [2023-11-26 10:45:54,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5384 conditions, 4811 events. 201/4811 cut-off events. For 63/160 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 48909 event pairs, 30 based on Foata normal form. 6/4250 useless extension candidates. Maximal degree in co-relation 4496. Up to 136 conditions per place. [2023-11-26 10:45:54,173 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2023-11-26 10:45:54,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 390 transitions, 906 flow [2023-11-26 10:45:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-26 10:45:54,179 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-26 10:45:54,179 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-26 10:45:54,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-26 10:45:54,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:54,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-26 10:45:54,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:54,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:54,189 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:54,190 INFO L175 Difference]: Start difference. First operand has 384 places, 389 transitions, 874 flow. Second operand 3 states and 1257 transitions. [2023-11-26 10:45:54,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 390 transitions, 906 flow [2023-11-26 10:45:54,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 390 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:54,201 INFO L231 Difference]: Finished difference. Result has 385 places, 388 transitions, 876 flow [2023-11-26 10:45:54,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=872, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=385, PETRI_TRANSITIONS=388} [2023-11-26 10:45:54,203 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -13 predicate places. [2023-11-26 10:45:54,203 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 388 transitions, 876 flow [2023-11-26 10:45:54,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.6666666666667) internal successors, (1247), 3 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:54,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:54,204 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] [2023-11-26 10:45:54,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 10:45:54,204 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:54,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash -2112270679, now seen corresponding path program 1 times [2023-11-26 10:45:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:54,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732597716] [2023-11-26 10:45:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:54,261 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-26 10:45:54,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:54,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732597716] [2023-11-26 10:45:54,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732597716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:54,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:54,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793942104] [2023-11-26 10:45:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:54,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:54,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:54,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 436 [2023-11-26 10:45:54,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 388 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:54,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:54,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 436 [2023-11-26 10:45:54,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:56,117 INFO L124 PetriNetUnfolderBase]: 454/7742 cut-off events. [2023-11-26 10:45:56,117 INFO L125 PetriNetUnfolderBase]: For 145/157 co-relation queries the response was YES. [2023-11-26 10:45:56,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8807 conditions, 7742 events. 454/7742 cut-off events. For 145/157 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 91395 event pairs, 80 based on Foata normal form. 1/6985 useless extension candidates. Maximal degree in co-relation 7792. Up to 616 conditions per place. [2023-11-26 10:45:56,178 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 19 selfloop transitions, 4 changer transitions 0/392 dead transitions. [2023-11-26 10:45:56,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 392 transitions, 934 flow [2023-11-26 10:45:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:56,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2023-11-26 10:45:56,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9564220183486238 [2023-11-26 10:45:56,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1251 transitions. [2023-11-26 10:45:56,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1251 transitions. [2023-11-26 10:45:56,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:56,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1251 transitions. [2023-11-26 10:45:56,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:56,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:56,199 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:56,199 INFO L175 Difference]: Start difference. First operand has 385 places, 388 transitions, 876 flow. Second operand 3 states and 1251 transitions. [2023-11-26 10:45:56,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 392 transitions, 934 flow [2023-11-26 10:45:56,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 392 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:45:56,216 INFO L231 Difference]: Finished difference. Result has 382 places, 388 transitions, 892 flow [2023-11-26 10:45:56,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=382, PETRI_TRANSITIONS=388} [2023-11-26 10:45:56,218 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -16 predicate places. [2023-11-26 10:45:56,218 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 388 transitions, 892 flow [2023-11-26 10:45:56,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:56,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:56,219 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] [2023-11-26 10:45:56,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 10:45:56,219 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:56,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:56,220 INFO L85 PathProgramCache]: Analyzing trace with hash 655770181, now seen corresponding path program 1 times [2023-11-26 10:45:56,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:56,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502771395] [2023-11-26 10:45:56,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:56,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:56,877 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-26 10:45:56,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:56,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502771395] [2023-11-26 10:45:56,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502771395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:45:56,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028310376] [2023-11-26 10:45:56,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:56,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:45:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:56,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:45:56,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:45:57,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-26 10:45:57,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 388 transitions, 892 flow. Second operand has 6 states, 6 states have (on average 412.6666666666667) internal successors, (2476), 6 states have internal predecessors, (2476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:57,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:57,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-26 10:45:57,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:58,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [493#true, 485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 498#true, 517#(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)), 466#(= |#race~is_null_0~0| 0), Black: 464#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:45:58,053 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:45:58,053 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:45:58,054 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:45:58,054 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:45:58,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:45:58,071 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2023-11-26 10:45:58,071 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:58,071 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:58,071 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:45:58,072 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:45:58,072 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2023-11-26 10:45:58,072 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:58,072 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:58,072 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:45:58,072 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-26 10:45:58,074 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), Black: 498#true, 495#(= |#race~filename_1~0| 0), 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:45:58,074 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:45:58,075 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-26 10:45:58,075 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:58,075 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:45:58,075 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:45:58,075 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-26 10:45:58,084 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][363], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 333#L80-7true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:45:58,085 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is not cut-off event [2023-11-26 10:45:58,085 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is not cut-off event [2023-11-26 10:45:58,085 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:45:58,085 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:45:58,085 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:45:58,085 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:45:58,086 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2023-11-26 10:45:58,104 INFO L124 PetriNetUnfolderBase]: 123/3682 cut-off events. [2023-11-26 10:45:58,104 INFO L125 PetriNetUnfolderBase]: For 35/84 co-relation queries the response was YES. [2023-11-26 10:45:58,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 3682 events. 123/3682 cut-off events. For 35/84 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 34999 event pairs, 0 based on Foata normal form. 28/3324 useless extension candidates. Maximal degree in co-relation 3529. Up to 98 conditions per place. [2023-11-26 10:45:58,153 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 9 selfloop transitions, 4 changer transitions 0/387 dead transitions. [2023-11-26 10:45:58,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 387 transitions, 916 flow [2023-11-26 10:45:58,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:45:58,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:45:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2023-11-26 10:45:58,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9480122324159022 [2023-11-26 10:45:58,162 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2480 transitions. [2023-11-26 10:45:58,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2480 transitions. [2023-11-26 10:45:58,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:58,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2480 transitions. [2023-11-26 10:45:58,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 413.3333333333333) internal successors, (2480), 6 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:58,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:58,179 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:58,179 INFO L175 Difference]: Start difference. First operand has 382 places, 388 transitions, 892 flow. Second operand 6 states and 2480 transitions. [2023-11-26 10:45:58,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 387 transitions, 916 flow [2023-11-26 10:45:58,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 387 transitions, 916 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:45:58,189 INFO L231 Difference]: Finished difference. Result has 386 places, 387 transitions, 898 flow [2023-11-26 10:45:58,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=386, PETRI_TRANSITIONS=387} [2023-11-26 10:45:58,191 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-26 10:45:58,191 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 387 transitions, 898 flow [2023-11-26 10:45:58,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 412.6666666666667) internal successors, (2476), 6 states have internal predecessors, (2476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:58,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:58,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] [2023-11-26 10:45:58,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 10:45:58,193 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:58,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:58,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1588184141, now seen corresponding path program 1 times [2023-11-26 10:45:58,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:58,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645580174] [2023-11-26 10:45:58,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:58,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:58,244 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-26 10:45:58,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645580174] [2023-11-26 10:45:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645580174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:58,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:58,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:58,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398123781] [2023-11-26 10:45:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:58,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:58,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:58,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:45:58,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 387 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 415.6666666666667) internal successors, (1247), 3 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:58,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:58,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:45:58,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:45:59,554 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][366], [493#true, 485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 498#true, 517#(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)), 519#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 333#L80-7true, Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:45:59,554 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:45:59,554 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:45:59,555 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:45:59,555 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:45:59,753 INFO L124 PetriNetUnfolderBase]: 240/6042 cut-off events. [2023-11-26 10:45:59,753 INFO L125 PetriNetUnfolderBase]: For 93/99 co-relation queries the response was YES. [2023-11-26 10:45:59,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6727 conditions, 6042 events. 240/6042 cut-off events. For 93/99 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 64723 event pairs, 22 based on Foata normal form. 0/5515 useless extension candidates. Maximal degree in co-relation 6393. Up to 300 conditions per place. [2023-11-26 10:45:59,828 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 15 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2023-11-26 10:45:59,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 391 transitions, 944 flow [2023-11-26 10:45:59,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:45:59,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:45:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2023-11-26 10:45:59,847 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640672782874617 [2023-11-26 10:45:59,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1261 transitions. [2023-11-26 10:45:59,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1261 transitions. [2023-11-26 10:45:59,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:45:59,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1261 transitions. [2023-11-26 10:45:59,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:59,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:59,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:59,858 INFO L175 Difference]: Start difference. First operand has 386 places, 387 transitions, 898 flow. Second operand 3 states and 1261 transitions. [2023-11-26 10:45:59,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 391 transitions, 944 flow [2023-11-26 10:45:59,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 391 transitions, 937 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:45:59,870 INFO L231 Difference]: Finished difference. Result has 383 places, 387 transitions, 901 flow [2023-11-26 10:45:59,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=901, PETRI_PLACES=383, PETRI_TRANSITIONS=387} [2023-11-26 10:45:59,872 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-26 10:45:59,872 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 387 transitions, 901 flow [2023-11-26 10:45:59,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 415.6666666666667) internal successors, (1247), 3 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:59,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:45:59,873 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] [2023-11-26 10:45:59,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 10:45:59,874 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:45:59,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:45:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash 638616018, now seen corresponding path program 1 times [2023-11-26 10:45:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:45:59,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536247232] [2023-11-26 10:45:59,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:45:59,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:45:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:45:59,934 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-26 10:45:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:45:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536247232] [2023-11-26 10:45:59,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536247232] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:45:59,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:45:59,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:45:59,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140028811] [2023-11-26 10:45:59,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:45:59,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:45:59,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:45:59,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:45:59,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:45:59,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:45:59,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 387 transitions, 901 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:45:59,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:45:59,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:45:59,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:00,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1134] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [493#true, 485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), 498#true, Black: 488#true, 517#(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)), 211#L79-7true, 519#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 524#true, 92#L56-40true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:00,886 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2023-11-26 10:46:00,886 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-26 10:46:00,886 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-26 10:46:00,886 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-26 10:46:01,000 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1134] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), Black: 498#true, 495#(= |#race~filename_1~0| 0), 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, 92#L56-40true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,000 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,000 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,000 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,000 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 213#L56-41true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 526#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,066 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:46:01,066 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 526#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 221#L56-42true, 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,067 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, 92#L56-40true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,067 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,067 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,068 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,068 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,069 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1134] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, Black: 474#true, 92#L56-40true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,069 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,069 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,069 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,069 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,069 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,069 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1134] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, Black: 474#true, 92#L56-40true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,069 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1134] L56-39-->L56-40: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet18#1][226], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, Black: 474#true, 92#L56-40true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,070 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,070 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,071 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-26 10:46:01,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 160#L58true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:01,073 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2023-11-26 10:46:01,074 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,074 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,074 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 10:46:01,087 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, 92#L56-40true, Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:01,088 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is not cut-off event [2023-11-26 10:46:01,088 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is not cut-off event [2023-11-26 10:46:01,088 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is not cut-off event [2023-11-26 10:46:01,088 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is not cut-off event [2023-11-26 10:46:01,088 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is not cut-off event [2023-11-26 10:46:01,089 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 213#L56-41true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 526#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:01,089 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2023-11-26 10:46:01,089 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:01,089 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:01,089 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:01,089 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:01,091 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][355], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 526#(= |#race~result_11~0| |thread3Thread1of1ForFork2_#t~nondet18#1|), 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), 221#L56-42true, Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:01,092 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2023-11-26 10:46:01,092 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:46:01,092 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-26 10:46:01,092 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-26 10:46:01,092 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-26 10:46:01,099 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][349], [485#(= 0 |#race~filename_is_null_5~0|), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 160#L58true, 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:01,100 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,100 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,100 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-26 10:46:01,100 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 10:46:01,101 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-26 10:46:01,106 INFO L124 PetriNetUnfolderBase]: 395/4999 cut-off events. [2023-11-26 10:46:01,107 INFO L125 PetriNetUnfolderBase]: For 280/328 co-relation queries the response was YES. [2023-11-26 10:46:01,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6314 conditions, 4999 events. 395/4999 cut-off events. For 280/328 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 53888 event pairs, 96 based on Foata normal form. 0/4584 useless extension candidates. Maximal degree in co-relation 6184. Up to 471 conditions per place. [2023-11-26 10:46:01,157 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2023-11-26 10:46:01,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 388 transitions, 933 flow [2023-11-26 10:46:01,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:01,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-26 10:46:01,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-26 10:46:01,162 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-26 10:46:01,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-26 10:46:01,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:01,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-26 10:46:01,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:01,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:01,171 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:01,171 INFO L175 Difference]: Start difference. First operand has 383 places, 387 transitions, 901 flow. Second operand 3 states and 1257 transitions. [2023-11-26 10:46:01,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 388 transitions, 933 flow [2023-11-26 10:46:01,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 388 transitions, 933 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 10:46:01,181 INFO L231 Difference]: Finished difference. Result has 384 places, 386 transitions, 903 flow [2023-11-26 10:46:01,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=903, PETRI_PLACES=384, PETRI_TRANSITIONS=386} [2023-11-26 10:46:01,183 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-26 10:46:01,183 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 386 transitions, 903 flow [2023-11-26 10:46:01,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:01,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:01,184 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] [2023-11-26 10:46:01,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-26 10:46:01,184 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:46:01,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash -764087432, now seen corresponding path program 1 times [2023-11-26 10:46:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:01,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880258363] [2023-11-26 10:46:01,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:01,974 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-26 10:46:01,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:01,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880258363] [2023-11-26 10:46:01,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880258363] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:01,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:01,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:46:01,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246424132] [2023-11-26 10:46:01,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:01,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:01,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:01,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:01,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:02,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-26 10:46:02,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 386 transitions, 903 flow. Second operand has 6 states, 6 states have (on average 412.8333333333333) internal successors, (2477), 6 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:02,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:02,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-26 10:46:02,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:03,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [493#true, 485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 498#true, 517#(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)), 519#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 524#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:03,070 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:46:03,070 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:46:03,071 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:46:03,071 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:46:03,123 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, 333#L80-7true, Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:03,123 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-26 10:46:03,123 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:03,123 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:03,123 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:03,124 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:03,124 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-26 10:46:03,124 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-26 10:46:03,125 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:03,125 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:03,125 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:03,125 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, Black: 474#true, 333#L80-7true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:03,126 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:46:03,126 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-26 10:46:03,126 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:03,126 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:03,126 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:03,126 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:03,137 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][361], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 524#true, 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:03,138 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:46:03,138 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is not cut-off event [2023-11-26 10:46:03,138 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:03,138 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:03,138 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:03,139 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:03,139 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:03,143 INFO L124 PetriNetUnfolderBase]: 133/3982 cut-off events. [2023-11-26 10:46:03,144 INFO L125 PetriNetUnfolderBase]: For 32/71 co-relation queries the response was YES. [2023-11-26 10:46:03,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4663 conditions, 3982 events. 133/3982 cut-off events. For 32/71 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 38431 event pairs, 0 based on Foata normal form. 20/3710 useless extension candidates. Maximal degree in co-relation 4530. Up to 107 conditions per place. [2023-11-26 10:46:03,210 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 9 selfloop transitions, 4 changer transitions 0/385 dead transitions. [2023-11-26 10:46:03,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 385 transitions, 927 flow [2023-11-26 10:46:03,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:46:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:46:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2023-11-26 10:46:03,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9480122324159022 [2023-11-26 10:46:03,222 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2480 transitions. [2023-11-26 10:46:03,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2480 transitions. [2023-11-26 10:46:03,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:03,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2480 transitions. [2023-11-26 10:46:03,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 413.3333333333333) internal successors, (2480), 6 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,244 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,245 INFO L175 Difference]: Start difference. First operand has 384 places, 386 transitions, 903 flow. Second operand 6 states and 2480 transitions. [2023-11-26 10:46:03,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 385 transitions, 927 flow [2023-11-26 10:46:03,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 385 transitions, 923 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:03,259 INFO L231 Difference]: Finished difference. Result has 386 places, 385 transitions, 905 flow [2023-11-26 10:46:03,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=897, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=905, PETRI_PLACES=386, PETRI_TRANSITIONS=385} [2023-11-26 10:46:03,262 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-26 10:46:03,262 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 385 transitions, 905 flow [2023-11-26 10:46:03,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 412.8333333333333) internal successors, (2477), 6 states have internal predecessors, (2477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:03,264 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] [2023-11-26 10:46:03,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-26 10:46:03,264 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:46:03,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:03,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1077722887, now seen corresponding path program 1 times [2023-11-26 10:46:03,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:03,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784342056] [2023-11-26 10:46:03,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:03,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:03,999 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-26 10:46:03,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:04,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784342056] [2023-11-26 10:46:04,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784342056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:04,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:04,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:46:04,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16639997] [2023-11-26 10:46:04,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:04,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:04,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:04,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:04,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:04,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-26 10:46:04,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 385 transitions, 905 flow. Second operand has 6 states, 6 states have (on average 413.0) internal successors, (2478), 6 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:04,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-26 10:46:04,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:05,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [493#true, 485#(= 0 |#race~filename_is_null_5~0|), 533#(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|)))), 540#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 488#true, 498#true, 517#(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)), 519#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 333#L80-7true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:05,066 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-26 10:46:05,066 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-26 10:46:05,066 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:46:05,066 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-26 10:46:05,096 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 540#(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)), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:05,096 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-26 10:46:05,096 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,096 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:05,096 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,097 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 540#(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)), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:05,097 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,097 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,097 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:05,097 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,097 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-26 10:46:05,097 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 540#(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)), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:05,097 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-26 10:46:05,097 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,098 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,098 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:05,098 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:05,098 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-26 10:46:05,105 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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|)))), 540#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), Black: 498#true, 495#(= |#race~filename_1~0| 0), 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 333#L80-7true, Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:05,105 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:46:05,105 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:05,106 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:05,106 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:05,106 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:05,106 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:05,106 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is not cut-off event [2023-11-26 10:46:05,108 INFO L124 PetriNetUnfolderBase]: 133/3973 cut-off events. [2023-11-26 10:46:05,108 INFO L125 PetriNetUnfolderBase]: For 15/44 co-relation queries the response was YES. [2023-11-26 10:46:05,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4522 conditions, 3973 events. 133/3973 cut-off events. For 15/44 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 38360 event pairs, 0 based on Foata normal form. 12/3702 useless extension candidates. Maximal degree in co-relation 4389. Up to 107 conditions per place. [2023-11-26 10:46:05,143 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 9 selfloop transitions, 4 changer transitions 0/384 dead transitions. [2023-11-26 10:46:05,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 384 transitions, 929 flow [2023-11-26 10:46:05,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:46:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:46:05,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2023-11-26 10:46:05,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9480122324159022 [2023-11-26 10:46:05,151 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2480 transitions. [2023-11-26 10:46:05,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2480 transitions. [2023-11-26 10:46:05,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:05,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2480 transitions. [2023-11-26 10:46:05,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 413.3333333333333) internal successors, (2480), 6 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,164 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,164 INFO L175 Difference]: Start difference. First operand has 386 places, 385 transitions, 905 flow. Second operand 6 states and 2480 transitions. [2023-11-26 10:46:05,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 384 transitions, 929 flow [2023-11-26 10:46:05,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 384 transitions, 922 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:46:05,174 INFO L231 Difference]: Finished difference. Result has 386 places, 384 transitions, 904 flow [2023-11-26 10:46:05,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=904, PETRI_PLACES=386, PETRI_TRANSITIONS=384} [2023-11-26 10:46:05,176 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-26 10:46:05,176 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 384 transitions, 904 flow [2023-11-26 10:46:05,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 413.0) internal successors, (2478), 6 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:05,177 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] [2023-11-26 10:46:05,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-26 10:46:05,178 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:46:05,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1035990443, now seen corresponding path program 1 times [2023-11-26 10:46:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001593037] [2023-11-26 10:46:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:05,259 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-26 10:46:05,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:05,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001593037] [2023-11-26 10:46:05,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001593037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:05,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:05,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:05,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402456771] [2023-11-26 10:46:05,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:05,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:05,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:05,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:05,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:05,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 436 [2023-11-26 10:46:05,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 384 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:05,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 436 [2023-11-26 10:46:05,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:06,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 540#(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)), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 542#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 333#L80-7true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:06,253 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-26 10:46:06,254 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:06,254 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-26 10:46:06,254 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-26 10:46:06,260 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 540#(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)), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 542#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), 500#(= |#race~filename_4~0| 0), Black: 464#true, Black: 498#true, 495#(= |#race~filename_1~0| 0), 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 333#L80-7true, Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:06,260 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:46:06,260 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:06,261 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:06,261 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:06,261 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:06,264 INFO L124 PetriNetUnfolderBase]: 193/5482 cut-off events. [2023-11-26 10:46:06,265 INFO L125 PetriNetUnfolderBase]: For 34/50 co-relation queries the response was YES. [2023-11-26 10:46:06,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6258 conditions, 5482 events. 193/5482 cut-off events. For 34/50 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 57415 event pairs, 6 based on Foata normal form. 0/5122 useless extension candidates. Maximal degree in co-relation 5833. Up to 147 conditions per place. [2023-11-26 10:46:06,317 INFO L140 encePairwiseOnDemand]: 434/436 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2023-11-26 10:46:06,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 383 transitions, 920 flow [2023-11-26 10:46:06,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:06,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2023-11-26 10:46:06,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640672782874617 [2023-11-26 10:46:06,323 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1261 transitions. [2023-11-26 10:46:06,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1261 transitions. [2023-11-26 10:46:06,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:06,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1261 transitions. [2023-11-26 10:46:06,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 420.3333333333333) internal successors, (1261), 3 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,330 INFO L175 Difference]: Start difference. First operand has 386 places, 384 transitions, 904 flow. Second operand 3 states and 1261 transitions. [2023-11-26 10:46:06,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 383 transitions, 920 flow [2023-11-26 10:46:06,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 383 transitions, 913 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 10:46:06,340 INFO L231 Difference]: Finished difference. Result has 383 places, 383 transitions, 897 flow [2023-11-26 10:46:06,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=383, PETRI_TRANSITIONS=383} [2023-11-26 10:46:06,341 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-26 10:46:06,342 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 383 transitions, 897 flow [2023-11-26 10:46:06,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.0) internal successors, (1260), 3 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,342 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:06,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] [2023-11-26 10:46:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-26 10:46:06,343 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:46:06,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2132542680, now seen corresponding path program 1 times [2023-11-26 10:46:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596963499] [2023-11-26 10:46:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:06,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:06,426 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-26 10:46:06,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:06,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596963499] [2023-11-26 10:46:06,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596963499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:06,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:06,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:06,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922710280] [2023-11-26 10:46:06,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:06,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:06,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:06,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:06,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:06,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:46:06,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 383 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:06,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:46:06,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:07,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1204] thread3EXIT-->L80-7: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem45#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, ULTIMATE.start_main_#t~mem45#1=|v_ULTIMATE.start_main_#t~mem45#1_6|, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][360], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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|)))), 540#(and (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ |ULTIMATE.start_main_~#t3~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) |ULTIMATE.start_main_~#t3~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t3~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t3~0#1.offset|)) 0)), Black: 483#true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 542#true, 517#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 509#(= 0 |#race~filename_is_null_8~0|), 546#true, 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), 333#L80-7true, Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:07,607 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-26 10:46:07,607 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:07,607 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-26 10:46:07,607 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-26 10:46:07,610 INFO L124 PetriNetUnfolderBase]: 199/5895 cut-off events. [2023-11-26 10:46:07,611 INFO L125 PetriNetUnfolderBase]: For 42/74 co-relation queries the response was YES. [2023-11-26 10:46:07,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6750 conditions, 5895 events. 199/5895 cut-off events. For 42/74 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 63220 event pairs, 18 based on Foata normal form. 0/5526 useless extension candidates. Maximal degree in co-relation 6450. Up to 166 conditions per place. [2023-11-26 10:46:07,689 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 10 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2023-11-26 10:46:07,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 381 transitions, 915 flow [2023-11-26 10:46:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:07,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2023-11-26 10:46:07,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.959480122324159 [2023-11-26 10:46:07,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1255 transitions. [2023-11-26 10:46:07,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1255 transitions. [2023-11-26 10:46:07,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:07,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1255 transitions. [2023-11-26 10:46:07,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 418.3333333333333) internal successors, (1255), 3 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,703 INFO L175 Difference]: Start difference. First operand has 383 places, 383 transitions, 897 flow. Second operand 3 states and 1255 transitions. [2023-11-26 10:46:07,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 381 transitions, 915 flow [2023-11-26 10:46:07,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 381 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:07,715 INFO L231 Difference]: Finished difference. Result has 382 places, 381 transitions, 894 flow [2023-11-26 10:46:07,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=382, PETRI_TRANSITIONS=381} [2023-11-26 10:46:07,717 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -16 predicate places. [2023-11-26 10:46:07,717 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 381 transitions, 894 flow [2023-11-26 10:46:07,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:07,718 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] [2023-11-26 10:46:07,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-26 10:46:07,718 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 70 more)] === [2023-11-26 10:46:07,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:07,719 INFO L85 PathProgramCache]: Analyzing trace with hash -939309606, now seen corresponding path program 1 times [2023-11-26 10:46:07,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:07,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593450889] [2023-11-26 10:46:07,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:07,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:07,812 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-26 10:46:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593450889] [2023-11-26 10:46:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593450889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920805885] [2023-11-26 10:46:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:07,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:07,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:07,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-26 10:46:07,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 381 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:07,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-26 10:46:07,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:08,707 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [493#true, 485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 213#L56-41true, 490#(= |#race~is_null_6~0| 0), 498#true, Black: 488#true, 550#true, 517#(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)), 211#L79-7true, 519#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 546#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:08,707 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2023-11-26 10:46:08,708 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2023-11-26 10:46:08,708 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-26 10:46:08,708 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2023-11-26 10:46:08,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1138] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 213#L56-41true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 550#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), Black: 498#true, 495#(= |#race~filename_1~0| 0), 546#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:08,801 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,801 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,801 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,802 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,837 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1138] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), 213#L56-41true, Black: 519#true, Black: 488#true, 550#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 546#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:08,837 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,837 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,837 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,837 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,837 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,838 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([1138] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 213#L56-41true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 550#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 546#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, 476#(= 0 |#race~filename_is_null_2~0|), Black: 507#true]) [2023-11-26 10:46:08,838 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,838 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,838 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,838 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,838 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,838 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,838 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([1138] L56-40-->L56-41: Formula: (= |v_#race~result_11~0_1| |v_thread3Thread1of1ForFork2_#t~nondet18#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} OutVars{#race~result_11~0=|v_#race~result_11~0_1|, thread3Thread1of1ForFork2_#t~nondet18#1=|v_thread3Thread1of1ForFork2_#t~nondet18#1_3|} AuxVars[] AssignedVars[#race~result_11~0][232], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 213#L56-41true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 550#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), 495#(= |#race~filename_1~0| 0), Black: 498#true, 546#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:08,839 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-26 10:46:08,839 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,839 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,839 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,839 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,839 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,839 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][347], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 213#L56-41true, 490#(= |#race~is_null_6~0| 0), Black: 519#true, Black: 488#true, 550#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), Black: 464#true, 500#(= |#race~filename_4~0| 0), Black: 498#true, 495#(= |#race~filename_1~0| 0), 546#true, 509#(= 0 |#race~filename_is_null_8~0|), 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:08,841 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,841 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-26 10:46:08,841 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,842 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-26 10:46:08,852 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1203] thread2EXIT-->L79-7: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem44#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{ULTIMATE.start_main_#t~mem44#1=|v_ULTIMATE.start_main_#t~mem44#1_6|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][347], [485#(= 0 |#race~filename_is_null_5~0|), 533#(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: 483#true, 490#(= |#race~is_null_6~0| 0), 213#L56-41true, Black: 519#true, Black: 488#true, 550#true, 517#(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)), 211#L79-7true, Black: 493#true, 466#(= |#race~is_null_0~0| 0), 500#(= |#race~filename_4~0| 0), Black: 464#true, Black: 498#true, 495#(= |#race~filename_1~0| 0), 509#(= 0 |#race~filename_is_null_8~0|), 546#true, 471#(= |#race~is_null_3~0| 0), Black: 469#true, 521#(= |#race~filename_7~0| 0), Black: 474#true, Black: 507#true, 476#(= 0 |#race~filename_is_null_2~0|)]) [2023-11-26 10:46:08,853 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is not cut-off event [2023-11-26 10:46:08,853 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2023-11-26 10:46:08,853 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2023-11-26 10:46:08,853 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2023-11-26 10:46:08,853 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2023-11-26 10:46:08,860 INFO L124 PetriNetUnfolderBase]: 203/4395 cut-off events. [2023-11-26 10:46:08,860 INFO L125 PetriNetUnfolderBase]: For 88/116 co-relation queries the response was YES. [2023-11-26 10:46:08,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5196 conditions, 4395 events. 203/4395 cut-off events. For 88/116 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 44440 event pairs, 48 based on Foata normal form. 12/4118 useless extension candidates. Maximal degree in co-relation 5065. Up to 248 conditions per place. [2023-11-26 10:46:08,894 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 0 selfloop transitions, 0 changer transitions 379/379 dead transitions. [2023-11-26 10:46:08,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 379 transitions, 910 flow [2023-11-26 10:46:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:08,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2023-11-26 10:46:08,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9587155963302753 [2023-11-26 10:46:08,899 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2023-11-26 10:46:08,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2023-11-26 10:46:08,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:08,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2023-11-26 10:46:08,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 418.0) internal successors, (1254), 3 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,907 INFO L175 Difference]: Start difference. First operand has 382 places, 381 transitions, 894 flow. Second operand 3 states and 1254 transitions. [2023-11-26 10:46:08,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 379 transitions, 910 flow [2023-11-26 10:46:08,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 379 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:08,916 INFO L231 Difference]: Finished difference. Result has 381 places, 0 transitions, 0 flow [2023-11-26 10:46:08,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=381, PETRI_TRANSITIONS=0} [2023-11-26 10:46:08,917 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -17 predicate places. [2023-11-26 10:46:08,917 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 0 transitions, 0 flow [2023-11-26 10:46:08,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 417.0) internal successors, (1251), 3 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,920 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (73 of 74 remaining) [2023-11-26 10:46:08,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (72 of 74 remaining) [2023-11-26 10:46:08,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 74 remaining) [2023-11-26 10:46:08,921 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (70 of 74 remaining) [2023-11-26 10:46:08,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (69 of 74 remaining) [2023-11-26 10:46:08,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (68 of 74 remaining) [2023-11-26 10:46:08,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (67 of 74 remaining) [2023-11-26 10:46:08,922 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (66 of 74 remaining) [2023-11-26 10:46:08,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 74 remaining) [2023-11-26 10:46:08,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 74 remaining) [2023-11-26 10:46:08,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (63 of 74 remaining) [2023-11-26 10:46:08,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 74 remaining) [2023-11-26 10:46:08,923 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (61 of 74 remaining) [2023-11-26 10:46:08,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 74 remaining) [2023-11-26 10:46:08,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 74 remaining) [2023-11-26 10:46:08,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 74 remaining) [2023-11-26 10:46:08,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (57 of 74 remaining) [2023-11-26 10:46:08,924 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (56 of 74 remaining) [2023-11-26 10:46:08,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (55 of 74 remaining) [2023-11-26 10:46:08,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (54 of 74 remaining) [2023-11-26 10:46:08,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (53 of 74 remaining) [2023-11-26 10:46:08,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (52 of 74 remaining) [2023-11-26 10:46:08,925 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 74 remaining) [2023-11-26 10:46:08,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 74 remaining) [2023-11-26 10:46:08,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (49 of 74 remaining) [2023-11-26 10:46:08,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (48 of 74 remaining) [2023-11-26 10:46:08,926 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (47 of 74 remaining) [2023-11-26 10:46:08,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 74 remaining) [2023-11-26 10:46:08,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 74 remaining) [2023-11-26 10:46:08,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 74 remaining) [2023-11-26 10:46:08,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 74 remaining) [2023-11-26 10:46:08,927 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 74 remaining) [2023-11-26 10:46:08,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 74 remaining) [2023-11-26 10:46:08,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 74 remaining) [2023-11-26 10:46:08,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 74 remaining) [2023-11-26 10:46:08,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 74 remaining) [2023-11-26 10:46:08,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 74 remaining) [2023-11-26 10:46:08,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 74 remaining) [2023-11-26 10:46:08,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 74 remaining) [2023-11-26 10:46:08,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 74 remaining) [2023-11-26 10:46:08,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (33 of 74 remaining) [2023-11-26 10:46:08,929 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (32 of 74 remaining) [2023-11-26 10:46:08,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (31 of 74 remaining) [2023-11-26 10:46:08,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (30 of 74 remaining) [2023-11-26 10:46:08,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 74 remaining) [2023-11-26 10:46:08,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 74 remaining) [2023-11-26 10:46:08,930 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 74 remaining) [2023-11-26 10:46:08,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 74 remaining) [2023-11-26 10:46:08,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 74 remaining) [2023-11-26 10:46:08,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 74 remaining) [2023-11-26 10:46:08,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 74 remaining) [2023-11-26 10:46:08,931 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 74 remaining) [2023-11-26 10:46:08,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 74 remaining) [2023-11-26 10:46:08,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 74 remaining) [2023-11-26 10:46:08,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 74 remaining) [2023-11-26 10:46:08,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 74 remaining) [2023-11-26 10:46:08,932 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 74 remaining) [2023-11-26 10:46:08,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 74 remaining) [2023-11-26 10:46:08,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 74 remaining) [2023-11-26 10:46:08,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 74 remaining) [2023-11-26 10:46:08,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 74 remaining) [2023-11-26 10:46:08,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 74 remaining) [2023-11-26 10:46:08,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 74 remaining) [2023-11-26 10:46:08,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 74 remaining) [2023-11-26 10:46:08,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 74 remaining) [2023-11-26 10:46:08,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 74 remaining) [2023-11-26 10:46:08,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 74 remaining) [2023-11-26 10:46:08,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 74 remaining) [2023-11-26 10:46:08,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 74 remaining) [2023-11-26 10:46:08,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 74 remaining) [2023-11-26 10:46:08,935 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 74 remaining) [2023-11-26 10:46:08,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 74 remaining) [2023-11-26 10:46:08,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 74 remaining) [2023-11-26 10:46:08,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 74 remaining) [2023-11-26 10:46:08,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-26 10:46:08,937 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] [2023-11-26 10:46:08,943 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:46:08,943 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:46:08,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:46:08 BasicIcfg [2023-11-26 10:46:08,949 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:46:08,950 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:46:08,950 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:46:08,950 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:46:08,951 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:45:43" (3/4) ... [2023-11-26 10:46:08,952 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 10:46:08,956 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-26 10:46:08,957 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-26 10:46:08,957 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-26 10:46:08,964 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-26 10:46:08,965 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-26 10:46:08,965 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 10:46:08,966 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 10:46:09,066 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 10:46:09,067 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 10:46:09,067 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:46:09,068 INFO L158 Benchmark]: Toolchain (without parser) took 27320.32ms. Allocated memory was 146.8MB in the beginning and 5.8GB in the end (delta: 5.7GB). Free memory was 100.2MB in the beginning and 4.5GB in the end (delta: -4.4GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-26 10:46:09,068 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 146.8MB. Free memory was 120.7MB in the beginning and 120.5MB in the end (delta: 226.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:09,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 314.48ms. Allocated memory is still 146.8MB. Free memory was 99.9MB in the beginning and 87.6MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-26 10:46:09,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.15ms. Allocated memory is still 146.8MB. Free memory was 87.3MB in the beginning and 84.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:09,069 INFO L158 Benchmark]: Boogie Preprocessor took 46.15ms. Allocated memory is still 146.8MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:09,070 INFO L158 Benchmark]: RCFGBuilder took 961.81ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 82.4MB in the beginning and 138.9MB in the end (delta: -56.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-11-26 10:46:09,070 INFO L158 Benchmark]: TraceAbstraction took 25807.99ms. Allocated memory was 182.5MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 137.9MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-11-26 10:46:09,071 INFO L158 Benchmark]: Witness Printer took 117.12ms. Allocated memory is still 5.8GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-26 10:46:09,073 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.32ms. Allocated memory is still 146.8MB. Free memory was 120.7MB in the beginning and 120.5MB in the end (delta: 226.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 314.48ms. Allocated memory is still 146.8MB. Free memory was 99.9MB in the beginning and 87.6MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.15ms. Allocated memory is still 146.8MB. Free memory was 87.3MB in the beginning and 84.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.15ms. Allocated memory is still 146.8MB. Free memory was 84.5MB in the beginning and 82.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 961.81ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 82.4MB in the beginning and 138.9MB in the end (delta: -56.5MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25807.99ms. Allocated memory was 182.5MB in the beginning and 5.8GB in the end (delta: 5.6GB). Free memory was 137.9MB in the beginning and 4.5GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 117.12ms. Allocated memory is still 5.8GB. Free memory was 4.5GB in the beginning and 4.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: 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: 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: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 69]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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, 644 locations, 74 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: 25.6s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1163 IncrementalHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 152 mSDtfsCounter, 1163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=23, InterpolantAutomatonStates: 90, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2818 NumberOfCodeBlocks, 2818 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2791 ConstructedInterpolants, 0 QuantifiedInterpolants, 3082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 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 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-26 10:46:09,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0a24e662-ad35-4c2b-8747-ea68e04ea5d3/bin/uautomizer-verify-VRDe98Ueme/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