./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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/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_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 20:24:35,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 20:24:35,764 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-28 20:24:35,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 20:24:35,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 20:24:35,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 20:24:35,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 20:24:35,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 20:24:35,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 20:24:35,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 20:24:35,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 20:24:35,797 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 20:24:35,797 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 20:24:35,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 20:24:35,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-28 20:24:35,799 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 20:24:35,799 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 20:24:35,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 20:24:35,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 20:24:35,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-28 20:24:35,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 20:24:35,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-28 20:24:35,804 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-28 20:24:35,805 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 20:24:35,805 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 20:24:35,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-28 20:24:35,806 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 20:24:35,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 20:24:35,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 20:24:35,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 20:24:35,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:24:35,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 20:24:35,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 20:24:35,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-28 20:24:35,809 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 20:24:35,809 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 20:24:35,809 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 20:24:35,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 20:24:35,809 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-28 20:24:35,810 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 20:24:35,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 20:24:35,810 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_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d7ba2cbd8ed9f48aa977924dd556bad66f28ba8aaa41d75f8db9183096d20ba1 [2023-11-28 20:24:36,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 20:24:36,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 20:24:36,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 20:24:36,062 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 20:24:36,063 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 20:24:36,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2023-11-28 20:24:38,922 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 20:24:39,096 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 20:24:39,097 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/sv-benchmarks/c/weaver/chl-file-item-subst.wvr.c [2023-11-28 20:24:39,105 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/data/30fb87bed/10b9ece128064c20b933e53570eab512/FLAG8deada2bb [2023-11-28 20:24:39,118 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/data/30fb87bed/10b9ece128064c20b933e53570eab512 [2023-11-28 20:24:39,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 20:24:39,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 20:24:39,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 20:24:39,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 20:24:39,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 20:24:39,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c84c336 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39, skipping insertion in model container [2023-11-28 20:24:39,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,150 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 20:24:39,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:24:39,318 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 20:24:39,352 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 20:24:39,366 INFO L206 MainTranslator]: Completed translation [2023-11-28 20:24:39,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39 WrapperNode [2023-11-28 20:24:39,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 20:24:39,368 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 20:24:39,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 20:24:39,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 20:24:39,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,420 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 335 [2023-11-28 20:24:39,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 20:24:39,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 20:24:39,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 20:24:39,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 20:24:39,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,451 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 20:24:39,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 20:24:39,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 20:24:39,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 20:24:39,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (1/1) ... [2023-11-28 20:24:39,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 20:24:39,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 20:24:39,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 20:24:39,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 20:24:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 20:24:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-28 20:24:39,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-28 20:24:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-28 20:24:39,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-28 20:24:39,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-28 20:24:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-28 20:24:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-28 20:24:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 20:24:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-28 20:24:39,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 20:24:39,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 20:24:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-28 20:24:39,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 20:24:39,539 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 20:24:39,656 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 20:24:39,658 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 20:24:40,167 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 20:24:40,186 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 20:24:40,186 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 20:24:40,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:24:40 BoogieIcfgContainer [2023-11-28 20:24:40,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 20:24:40,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 20:24:40,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 20:24:40,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 20:24:40,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:24:39" (1/3) ... [2023-11-28 20:24:40,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6223a6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:24:40, skipping insertion in model container [2023-11-28 20:24:40,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:24:39" (2/3) ... [2023-11-28 20:24:40,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6223a6b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:24:40, skipping insertion in model container [2023-11-28 20:24:40,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:24:40" (3/3) ... [2023-11-28 20:24:40,198 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-subst.wvr.c [2023-11-28 20:24:40,206 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-28 20:24:40,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 20:24:40,217 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2023-11-28 20:24:40,218 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 20:24:40,349 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-28 20:24:40,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 436 transitions, 893 flow [2023-11-28 20:24:40,594 INFO L124 PetriNetUnfolderBase]: 21/433 cut-off events. [2023-11-28 20:24:40,595 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-28 20:24:40,609 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-28 20:24:40,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 436 transitions, 893 flow [2023-11-28 20:24:40,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 398 places, 407 transitions, 832 flow [2023-11-28 20:24:40,634 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 20:24:40,642 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;@34a4a93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 20:24:40,642 INFO L358 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2023-11-28 20:24:40,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 20:24:40,650 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2023-11-28 20:24:40,650 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 20:24:40,650 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:40,651 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-28 20:24:40,651 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-28 20:24:40,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:40,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1470829248, now seen corresponding path program 1 times [2023-11-28 20:24:40,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:40,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507581858] [2023-11-28 20:24:40,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:40,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:40,881 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-28 20:24:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507581858] [2023-11-28 20:24:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507581858] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:40,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472700411] [2023-11-28 20:24:40,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:40,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:40,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:40,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:40,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:40,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-28 20:24:40,965 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-28 20:24:40,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:40,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-28 20:24:40,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:41,236 INFO L124 PetriNetUnfolderBase]: 35/763 cut-off events. [2023-11-28 20:24:41,236 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-28 20:24:41,248 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-28 20:24:41,256 INFO L140 encePairwiseOnDemand]: 426/436 looper letters, 11 selfloop transitions, 2 changer transitions 1/399 dead transitions. [2023-11-28 20:24:41,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 399 transitions, 842 flow [2023-11-28 20:24:41,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-28 20:24:41,276 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-28 20:24:41,277 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-28 20:24:41,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-28 20:24:41,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:41,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-28 20:24:41,290 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-28 20:24:41,298 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-28 20:24:41,299 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-28 20:24:41,301 INFO L175 Difference]: Start difference. First operand has 398 places, 407 transitions, 832 flow. Second operand 3 states and 1257 transitions. [2023-11-28 20:24:41,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 399 transitions, 842 flow [2023-11-28 20:24:41,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 399 transitions, 830 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-28 20:24:41,318 INFO L231 Difference]: Finished difference. Result has 393 places, 398 transitions, 806 flow [2023-11-28 20:24:41,321 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-28 20:24:41,325 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -5 predicate places. [2023-11-28 20:24:41,325 INFO L495 AbstractCegarLoop]: Abstraction has has 393 places, 398 transitions, 806 flow [2023-11-28 20:24:41,326 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-28 20:24:41,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:41,327 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-28 20:24:41,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 20:24:41,327 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-28 20:24:41,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:41,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1786652556, now seen corresponding path program 1 times [2023-11-28 20:24:41,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:41,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806181743] [2023-11-28 20:24:41,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:41,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:41,393 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-28 20:24:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:41,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806181743] [2023-11-28 20:24:41,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806181743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:41,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:41,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:41,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899741600] [2023-11-28 20:24:41,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:41,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:41,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:41,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:41,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:41,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-28 20:24:41,423 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-28 20:24:41,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:41,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-28 20:24:41,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:41,573 INFO L124 PetriNetUnfolderBase]: 25/592 cut-off events. [2023-11-28 20:24:41,573 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-28 20:24:41,581 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-28 20:24:41,587 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2023-11-28 20:24:41,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 397 transitions, 830 flow [2023-11-28 20:24:41,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-28 20:24:41,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-28 20:24:41,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-28 20:24:41,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-28 20:24:41,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:41,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-28 20:24:41,600 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-28 20:24:41,605 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-28 20:24:41,607 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-28 20:24:41,607 INFO L175 Difference]: Start difference. First operand has 393 places, 398 transitions, 806 flow. Second operand 3 states and 1250 transitions. [2023-11-28 20:24:41,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 397 transitions, 830 flow [2023-11-28 20:24:41,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 397 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:41,620 INFO L231 Difference]: Finished difference. Result has 391 places, 397 transitions, 804 flow [2023-11-28 20:24:41,621 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-28 20:24:41,622 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -7 predicate places. [2023-11-28 20:24:41,622 INFO L495 AbstractCegarLoop]: Abstraction has has 391 places, 397 transitions, 804 flow [2023-11-28 20:24:41,623 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-28 20:24:41,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:41,624 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-28 20:24:41,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 20:24:41,624 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-28 20:24:41,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1132949206, now seen corresponding path program 1 times [2023-11-28 20:24:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:41,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138781706] [2023-11-28 20:24:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:41,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:41,683 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-28 20:24:41,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:41,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138781706] [2023-11-28 20:24:41,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138781706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:41,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:41,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:41,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432992747] [2023-11-28 20:24:41,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:41,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:41,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:41,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:41,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:41,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-28 20:24:41,712 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-28 20:24:41,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:41,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-28 20:24:41,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:41,849 INFO L124 PetriNetUnfolderBase]: 23/527 cut-off events. [2023-11-28 20:24:41,850 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-28 20:24:41,857 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-28 20:24:41,875 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2023-11-28 20:24:41,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 396 transitions, 828 flow [2023-11-28 20:24:41,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:41,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-28 20:24:41,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-28 20:24:41,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-28 20:24:41,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-28 20:24:41,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:41,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-28 20:24:41,886 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-28 20:24:41,890 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-28 20:24:41,891 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-28 20:24:41,892 INFO L175 Difference]: Start difference. First operand has 391 places, 397 transitions, 804 flow. Second operand 3 states and 1250 transitions. [2023-11-28 20:24:41,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 396 transitions, 828 flow [2023-11-28 20:24:41,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 396 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:41,901 INFO L231 Difference]: Finished difference. Result has 390 places, 396 transitions, 802 flow [2023-11-28 20:24:41,902 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-28 20:24:41,903 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -8 predicate places. [2023-11-28 20:24:41,903 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 396 transitions, 802 flow [2023-11-28 20:24:41,904 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-28 20:24:41,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:41,904 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-28 20:24:41,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 20:24:41,905 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-28 20:24:41,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:41,905 INFO L85 PathProgramCache]: Analyzing trace with hash 761874010, now seen corresponding path program 1 times [2023-11-28 20:24:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867105642] [2023-11-28 20:24:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:41,954 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-28 20:24:41,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:41,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867105642] [2023-11-28 20:24:41,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867105642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:41,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:41,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549181193] [2023-11-28 20:24:41,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:41,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:41,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:41,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-28 20:24:41,981 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-28 20:24:41,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:41,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-28 20:24:41,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:42,155 INFO L124 PetriNetUnfolderBase]: 43/864 cut-off events. [2023-11-28 20:24:42,156 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-28 20:24:42,167 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-28 20:24:42,175 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2023-11-28 20:24:42,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 395 transitions, 826 flow [2023-11-28 20:24:42,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-28 20:24:42,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-28 20:24:42,181 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-28 20:24:42,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-28 20:24:42,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:42,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-28 20:24:42,186 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-28 20:24:42,191 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-28 20:24:42,192 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-28 20:24:42,192 INFO L175 Difference]: Start difference. First operand has 390 places, 396 transitions, 802 flow. Second operand 3 states and 1250 transitions. [2023-11-28 20:24:42,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 395 transitions, 826 flow [2023-11-28 20:24:42,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 395 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:42,202 INFO L231 Difference]: Finished difference. Result has 389 places, 395 transitions, 800 flow [2023-11-28 20:24:42,203 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-28 20:24:42,204 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -9 predicate places. [2023-11-28 20:24:42,204 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 395 transitions, 800 flow [2023-11-28 20:24:42,206 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-28 20:24:42,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:42,206 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-28 20:24:42,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 20:24:42,207 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-28 20:24:42,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:42,207 INFO L85 PathProgramCache]: Analyzing trace with hash -2062037054, now seen corresponding path program 1 times [2023-11-28 20:24:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263130436] [2023-11-28 20:24:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:42,254 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-28 20:24:42,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263130436] [2023-11-28 20:24:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263130436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:42,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:42,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:42,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922175033] [2023-11-28 20:24:42,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:42,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:42,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:42,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:42,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:42,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-28 20:24:42,285 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-28 20:24:42,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:42,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-28 20:24:42,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:42,429 INFO L124 PetriNetUnfolderBase]: 32/636 cut-off events. [2023-11-28 20:24:42,429 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-28 20:24:42,439 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-28 20:24:42,445 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2023-11-28 20:24:42,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 394 transitions, 826 flow [2023-11-28 20:24:42,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2023-11-28 20:24:42,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9541284403669725 [2023-11-28 20:24:42,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1248 transitions. [2023-11-28 20:24:42,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1248 transitions. [2023-11-28 20:24:42,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:42,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1248 transitions. [2023-11-28 20:24:42,456 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-28 20:24:42,460 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-28 20:24:42,461 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-28 20:24:42,462 INFO L175 Difference]: Start difference. First operand has 389 places, 395 transitions, 800 flow. Second operand 3 states and 1248 transitions. [2023-11-28 20:24:42,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 394 transitions, 826 flow [2023-11-28 20:24:42,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 394 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:42,471 INFO L231 Difference]: Finished difference. Result has 388 places, 394 transitions, 798 flow [2023-11-28 20:24:42,472 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-28 20:24:42,473 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -10 predicate places. [2023-11-28 20:24:42,473 INFO L495 AbstractCegarLoop]: Abstraction has has 388 places, 394 transitions, 798 flow [2023-11-28 20:24:42,474 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-28 20:24:42,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:42,474 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-28 20:24:42,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 20:24:42,475 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-28 20:24:42,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1379835437, now seen corresponding path program 1 times [2023-11-28 20:24:42,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023773599] [2023-11-28 20:24:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:42,522 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-28 20:24:42,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:42,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023773599] [2023-11-28 20:24:42,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023773599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:42,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:42,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:42,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050575424] [2023-11-28 20:24:42,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:42,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:42,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:42,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:42,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:42,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 436 [2023-11-28 20:24:42,560 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-28 20:24:42,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:42,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 436 [2023-11-28 20:24:42,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:42,754 INFO L124 PetriNetUnfolderBase]: 64/989 cut-off events. [2023-11-28 20:24:42,755 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-28 20:24:42,767 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-28 20:24:42,776 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 13 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2023-11-28 20:24:42,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 393 transitions, 826 flow [2023-11-28 20:24:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:42,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2023-11-28 20:24:42,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9525993883792049 [2023-11-28 20:24:42,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1246 transitions. [2023-11-28 20:24:42,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1246 transitions. [2023-11-28 20:24:42,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:42,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1246 transitions. [2023-11-28 20:24:42,787 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-28 20:24:42,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-28 20:24:42,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-28 20:24:42,792 INFO L175 Difference]: Start difference. First operand has 388 places, 394 transitions, 798 flow. Second operand 3 states and 1246 transitions. [2023-11-28 20:24:42,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 393 transitions, 826 flow [2023-11-28 20:24:42,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 393 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:42,802 INFO L231 Difference]: Finished difference. Result has 387 places, 393 transitions, 796 flow [2023-11-28 20:24:42,802 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-28 20:24:42,803 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -11 predicate places. [2023-11-28 20:24:42,803 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 393 transitions, 796 flow [2023-11-28 20:24:42,805 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-28 20:24:42,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:42,805 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-28 20:24:42,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 20:24:42,805 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-28 20:24:42,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash 32381843, now seen corresponding path program 1 times [2023-11-28 20:24:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579971449] [2023-11-28 20:24:42,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:42,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:42,851 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-28 20:24:42,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:42,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579971449] [2023-11-28 20:24:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579971449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:42,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763727112] [2023-11-28 20:24:42,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:42,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:42,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:42,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:42,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:42,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 436 [2023-11-28 20:24:42,880 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-28 20:24:42,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:42,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 436 [2023-11-28 20:24:42,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:43,037 INFO L124 PetriNetUnfolderBase]: 35/756 cut-off events. [2023-11-28 20:24:43,037 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-28 20:24:43,048 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-28 20:24:43,055 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2023-11-28 20:24:43,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 392 transitions, 820 flow [2023-11-28 20:24:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2023-11-28 20:24:43,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9556574923547401 [2023-11-28 20:24:43,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1250 transitions. [2023-11-28 20:24:43,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1250 transitions. [2023-11-28 20:24:43,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:43,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1250 transitions. [2023-11-28 20:24:43,065 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-28 20:24:43,068 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-28 20:24:43,069 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-28 20:24:43,069 INFO L175 Difference]: Start difference. First operand has 387 places, 393 transitions, 796 flow. Second operand 3 states and 1250 transitions. [2023-11-28 20:24:43,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 392 transitions, 820 flow [2023-11-28 20:24:43,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 392 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:43,078 INFO L231 Difference]: Finished difference. Result has 386 places, 392 transitions, 794 flow [2023-11-28 20:24:43,079 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-28 20:24:43,080 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-28 20:24:43,080 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 392 transitions, 794 flow [2023-11-28 20:24:43,081 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-28 20:24:43,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:43,081 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-28 20:24:43,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 20:24:43,082 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-28 20:24:43,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1143706390, now seen corresponding path program 1 times [2023-11-28 20:24:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968556604] [2023-11-28 20:24:43,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:43,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:43,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:43,142 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-28 20:24:43,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:43,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968556604] [2023-11-28 20:24:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968556604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:43,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:43,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23504783] [2023-11-28 20:24:43,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:43,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:43,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:43,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:43,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-28 20:24:43,168 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-28 20:24:43,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:43,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-28 20:24:43,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:43,378 INFO L124 PetriNetUnfolderBase]: 41/868 cut-off events. [2023-11-28 20:24:43,378 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-28 20:24:43,390 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-28 20:24:43,397 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2023-11-28 20:24:43,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 391 transitions, 820 flow [2023-11-28 20:24:43,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:43,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1248 transitions. [2023-11-28 20:24:43,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9541284403669725 [2023-11-28 20:24:43,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1248 transitions. [2023-11-28 20:24:43,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1248 transitions. [2023-11-28 20:24:43,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:43,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1248 transitions. [2023-11-28 20:24:43,406 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-28 20:24:43,409 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-28 20:24:43,409 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-28 20:24:43,410 INFO L175 Difference]: Start difference. First operand has 386 places, 392 transitions, 794 flow. Second operand 3 states and 1248 transitions. [2023-11-28 20:24:43,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 391 transitions, 820 flow [2023-11-28 20:24:43,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 391 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:43,418 INFO L231 Difference]: Finished difference. Result has 385 places, 391 transitions, 792 flow [2023-11-28 20:24:43,419 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-28 20:24:43,420 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -13 predicate places. [2023-11-28 20:24:43,420 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 391 transitions, 792 flow [2023-11-28 20:24:43,421 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-28 20:24:43,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:43,421 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-28 20:24:43,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 20:24:43,421 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-28 20:24:43,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash -542716821, now seen corresponding path program 1 times [2023-11-28 20:24:43,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:43,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777709589] [2023-11-28 20:24:43,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:43,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:43,463 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-28 20:24:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777709589] [2023-11-28 20:24:43,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777709589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:43,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:43,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:43,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622921737] [2023-11-28 20:24:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:43,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:43,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:43,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 436 [2023-11-28 20:24:43,494 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-28 20:24:43,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:43,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 436 [2023-11-28 20:24:43,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:43,639 INFO L124 PetriNetUnfolderBase]: 40/676 cut-off events. [2023-11-28 20:24:43,640 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-28 20:24:43,649 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-28 20:24:43,653 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 13 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2023-11-28 20:24:43,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 390 transitions, 820 flow [2023-11-28 20:24:43,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:43,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1246 transitions. [2023-11-28 20:24:43,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9525993883792049 [2023-11-28 20:24:43,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1246 transitions. [2023-11-28 20:24:43,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1246 transitions. [2023-11-28 20:24:43,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:43,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1246 transitions. [2023-11-28 20:24:43,662 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-28 20:24:43,665 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-28 20:24:43,666 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-28 20:24:43,666 INFO L175 Difference]: Start difference. First operand has 385 places, 391 transitions, 792 flow. Second operand 3 states and 1246 transitions. [2023-11-28 20:24:43,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 390 transitions, 820 flow [2023-11-28 20:24:43,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 390 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:43,675 INFO L231 Difference]: Finished difference. Result has 384 places, 390 transitions, 790 flow [2023-11-28 20:24:43,676 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-28 20:24:43,677 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-28 20:24:43,677 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 390 transitions, 790 flow [2023-11-28 20:24:43,678 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-28 20:24:43,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:43,678 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-28 20:24:43,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 20:24:43,679 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-28 20:24:43,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:43,679 INFO L85 PathProgramCache]: Analyzing trace with hash 531324994, now seen corresponding path program 1 times [2023-11-28 20:24:43,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:43,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696542660] [2023-11-28 20:24:43,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:43,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:43,719 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-28 20:24:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696542660] [2023-11-28 20:24:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696542660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:43,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:43,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790078479] [2023-11-28 20:24:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:43,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:43,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:43,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:43,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:43,732 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:43,734 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-28 20:24:43,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:43,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:43,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:43,949 INFO L124 PetriNetUnfolderBase]: 76/1270 cut-off events. [2023-11-28 20:24:43,949 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-28 20:24:43,962 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-28 20:24:43,968 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 13 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2023-11-28 20:24:43,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 392 transitions, 826 flow [2023-11-28 20:24:43,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2023-11-28 20:24:43,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625382262996942 [2023-11-28 20:24:43,972 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1259 transitions. [2023-11-28 20:24:43,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1259 transitions. [2023-11-28 20:24:43,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:43,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1259 transitions. [2023-11-28 20:24:43,976 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-28 20:24:43,978 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-28 20:24:43,979 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-28 20:24:43,979 INFO L175 Difference]: Start difference. First operand has 384 places, 390 transitions, 790 flow. Second operand 3 states and 1259 transitions. [2023-11-28 20:24:43,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 392 transitions, 826 flow [2023-11-28 20:24:43,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 392 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:43,988 INFO L231 Difference]: Finished difference. Result has 383 places, 390 transitions, 796 flow [2023-11-28 20:24:43,989 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-28 20:24:43,990 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-28 20:24:43,990 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 390 transitions, 796 flow [2023-11-28 20:24:43,991 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-28 20:24:43,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:43,991 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:24:43,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 20:24:43,991 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-28 20:24:43,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:43,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1749393631, now seen corresponding path program 1 times [2023-11-28 20:24:43,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:43,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261463481] [2023-11-28 20:24:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:43,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:44,035 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-28 20:24:44,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:44,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261463481] [2023-11-28 20:24:44,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261463481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:44,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:44,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:44,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60497319] [2023-11-28 20:24:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:44,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:44,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:44,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:44,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-28 20:24:44,054 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-28 20:24:44,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:44,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-28 20:24:44,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:44,305 INFO L124 PetriNetUnfolderBase]: 77/1314 cut-off events. [2023-11-28 20:24:44,305 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-28 20:24:44,322 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-28 20:24:44,330 INFO L140 encePairwiseOnDemand]: 430/436 looper letters, 15 selfloop transitions, 3 changer transitions 0/392 dead transitions. [2023-11-28 20:24:44,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 392 transitions, 838 flow [2023-11-28 20:24:44,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2023-11-28 20:24:44,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9587155963302753 [2023-11-28 20:24:44,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2023-11-28 20:24:44,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2023-11-28 20:24:44,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:44,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2023-11-28 20:24:44,339 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-28 20:24:44,342 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-28 20:24:44,342 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-28 20:24:44,342 INFO L175 Difference]: Start difference. First operand has 383 places, 390 transitions, 796 flow. Second operand 3 states and 1254 transitions. [2023-11-28 20:24:44,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 392 transitions, 838 flow [2023-11-28 20:24:44,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 392 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:44,351 INFO L231 Difference]: Finished difference. Result has 383 places, 390 transitions, 811 flow [2023-11-28 20:24:44,352 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-28 20:24:44,353 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-28 20:24:44,353 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 390 transitions, 811 flow [2023-11-28 20:24:44,353 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-28 20:24:44,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:44,354 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-28 20:24:44,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 20:24:44,354 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-28 20:24:44,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1083096811, now seen corresponding path program 1 times [2023-11-28 20:24:44,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:44,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43041255] [2023-11-28 20:24:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:44,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:44,397 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-28 20:24:44,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:44,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43041255] [2023-11-28 20:24:44,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43041255] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:44,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:44,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657825430] [2023-11-28 20:24:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:44,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:44,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:44,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:44,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:44,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:44,412 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-28 20:24:44,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:44,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:44,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:44,689 INFO L124 PetriNetUnfolderBase]: 70/1331 cut-off events. [2023-11-28 20:24:44,690 INFO L125 PetriNetUnfolderBase]: For 11/13 co-relation queries the response was YES. [2023-11-28 20:24:44,708 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-28 20:24:44,716 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 16 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2023-11-28 20:24:44,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 395 transitions, 862 flow [2023-11-28 20:24:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:44,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2023-11-28 20:24:44,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9648318042813455 [2023-11-28 20:24:44,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1262 transitions. [2023-11-28 20:24:44,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1262 transitions. [2023-11-28 20:24:44,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:44,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1262 transitions. [2023-11-28 20:24:44,724 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-28 20:24:44,727 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-28 20:24:44,727 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-28 20:24:44,727 INFO L175 Difference]: Start difference. First operand has 383 places, 390 transitions, 811 flow. Second operand 3 states and 1262 transitions. [2023-11-28 20:24:44,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 395 transitions, 862 flow [2023-11-28 20:24:44,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 395 transitions, 862 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:44,736 INFO L231 Difference]: Finished difference. Result has 384 places, 390 transitions, 821 flow [2023-11-28 20:24:44,737 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-28 20:24:44,738 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-28 20:24:44,738 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 390 transitions, 821 flow [2023-11-28 20:24:44,738 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-28 20:24:44,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:44,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 20:24:44,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 20:24:44,739 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-28 20:24:44,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1215499826, now seen corresponding path program 1 times [2023-11-28 20:24:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542971537] [2023-11-28 20:24:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:44,784 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-28 20:24:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542971537] [2023-11-28 20:24:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542971537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:44,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:44,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:44,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815706608] [2023-11-28 20:24:44,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:44,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:44,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:44,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:44,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:44,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 436 [2023-11-28 20:24:44,798 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-28 20:24:44,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:44,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 436 [2023-11-28 20:24:44,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:45,030 INFO L124 PetriNetUnfolderBase]: 57/1105 cut-off events. [2023-11-28 20:24:45,030 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-28 20:24:45,048 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-28 20:24:45,055 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 11 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2023-11-28 20:24:45,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 391 transitions, 851 flow [2023-11-28 20:24:45,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1259 transitions. [2023-11-28 20:24:45,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9625382262996942 [2023-11-28 20:24:45,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1259 transitions. [2023-11-28 20:24:45,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1259 transitions. [2023-11-28 20:24:45,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:45,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1259 transitions. [2023-11-28 20:24:45,089 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-28 20:24:45,090 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-28 20:24:45,091 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-28 20:24:45,091 INFO L175 Difference]: Start difference. First operand has 384 places, 390 transitions, 821 flow. Second operand 3 states and 1259 transitions. [2023-11-28 20:24:45,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 391 transitions, 851 flow [2023-11-28 20:24:45,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 391 transitions, 851 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:45,097 INFO L231 Difference]: Finished difference. Result has 385 places, 389 transitions, 823 flow [2023-11-28 20:24:45,097 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-28 20:24:45,098 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -13 predicate places. [2023-11-28 20:24:45,098 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 389 transitions, 823 flow [2023-11-28 20:24:45,099 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-28 20:24:45,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:45,099 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-28 20:24:45,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 20:24:45,099 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-28 20:24:45,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1551195284, now seen corresponding path program 1 times [2023-11-28 20:24:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:45,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669946011] [2023-11-28 20:24:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:24:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669946011] [2023-11-28 20:24:45,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669946011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:45,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:45,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:45,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099112315] [2023-11-28 20:24:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:45,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:45,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:45,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-28 20:24:45,151 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-28 20:24:45,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:45,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-28 20:24:45,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:45,416 INFO L124 PetriNetUnfolderBase]: 77/1536 cut-off events. [2023-11-28 20:24:45,417 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-28 20:24:45,434 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-28 20:24:45,440 INFO L140 encePairwiseOnDemand]: 430/436 looper letters, 18 selfloop transitions, 3 changer transitions 0/394 dead transitions. [2023-11-28 20:24:45,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 394 transitions, 880 flow [2023-11-28 20:24:45,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-28 20:24:45,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-28 20:24:45,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-28 20:24:45,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-28 20:24:45,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:45,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-28 20:24:45,447 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-28 20:24:45,449 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-28 20:24:45,450 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-28 20:24:45,450 INFO L175 Difference]: Start difference. First operand has 385 places, 389 transitions, 823 flow. Second operand 3 states and 1257 transitions. [2023-11-28 20:24:45,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 394 transitions, 880 flow [2023-11-28 20:24:45,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 876 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:45,457 INFO L231 Difference]: Finished difference. Result has 383 places, 389 transitions, 834 flow [2023-11-28 20:24:45,457 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-28 20:24:45,458 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-28 20:24:45,458 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 389 transitions, 834 flow [2023-11-28 20:24:45,458 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-28 20:24:45,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:45,458 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-28 20:24:45,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 20:24:45,459 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-28 20:24:45,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:45,459 INFO L85 PathProgramCache]: Analyzing trace with hash 2142347228, now seen corresponding path program 1 times [2023-11-28 20:24:45,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:45,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281732037] [2023-11-28 20:24:45,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:45,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:45,491 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-28 20:24:45,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:45,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281732037] [2023-11-28 20:24:45,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281732037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:45,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:45,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669845452] [2023-11-28 20:24:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:45,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:45,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:45,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 436 [2023-11-28 20:24:45,515 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-28 20:24:45,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:45,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 436 [2023-11-28 20:24:45,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:46,171 INFO L124 PetriNetUnfolderBase]: 356/5024 cut-off events. [2023-11-28 20:24:46,171 INFO L125 PetriNetUnfolderBase]: For 69/83 co-relation queries the response was YES. [2023-11-28 20:24:46,200 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-28 20:24:46,211 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 17 selfloop transitions, 4 changer transitions 0/391 dead transitions. [2023-11-28 20:24:46,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 391 transitions, 882 flow [2023-11-28 20:24:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1249 transitions. [2023-11-28 20:24:46,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9548929663608563 [2023-11-28 20:24:46,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1249 transitions. [2023-11-28 20:24:46,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1249 transitions. [2023-11-28 20:24:46,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:46,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1249 transitions. [2023-11-28 20:24:46,218 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-28 20:24:46,220 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-28 20:24:46,220 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-28 20:24:46,220 INFO L175 Difference]: Start difference. First operand has 383 places, 389 transitions, 834 flow. Second operand 3 states and 1249 transitions. [2023-11-28 20:24:46,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 391 transitions, 882 flow [2023-11-28 20:24:46,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 391 transitions, 882 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:46,227 INFO L231 Difference]: Finished difference. Result has 382 places, 389 transitions, 854 flow [2023-11-28 20:24:46,228 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-28 20:24:46,228 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -16 predicate places. [2023-11-28 20:24:46,229 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 389 transitions, 854 flow [2023-11-28 20:24:46,229 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-28 20:24:46,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:46,229 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-28 20:24:46,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 20:24:46,229 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-28 20:24:46,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:46,230 INFO L85 PathProgramCache]: Analyzing trace with hash -2104552009, now seen corresponding path program 1 times [2023-11-28 20:24:46,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:46,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308284746] [2023-11-28 20:24:46,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:46,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:46,262 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-28 20:24:46,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308284746] [2023-11-28 20:24:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308284746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:46,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:46,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:46,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708438424] [2023-11-28 20:24:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:46,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:46,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:46,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:46,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:46,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:46,277 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-28 20:24:46,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:46,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:46,760 INFO L124 PetriNetUnfolderBase]: 114/2653 cut-off events. [2023-11-28 20:24:46,760 INFO L125 PetriNetUnfolderBase]: For 27/29 co-relation queries the response was YES. [2023-11-28 20:24:46,796 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-28 20:24:46,806 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 16 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2023-11-28 20:24:46,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 394 transitions, 905 flow [2023-11-28 20:24:46,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:46,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2023-11-28 20:24:46,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9648318042813455 [2023-11-28 20:24:46,810 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1262 transitions. [2023-11-28 20:24:46,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1262 transitions. [2023-11-28 20:24:46,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:46,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1262 transitions. [2023-11-28 20:24:46,814 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-28 20:24:46,816 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-28 20:24:46,817 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-28 20:24:46,817 INFO L175 Difference]: Start difference. First operand has 382 places, 389 transitions, 854 flow. Second operand 3 states and 1262 transitions. [2023-11-28 20:24:46,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 394 transitions, 905 flow [2023-11-28 20:24:46,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 905 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:46,826 INFO L231 Difference]: Finished difference. Result has 383 places, 389 transitions, 864 flow [2023-11-28 20:24:46,826 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-28 20:24:46,827 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-28 20:24:46,827 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 389 transitions, 864 flow [2023-11-28 20:24:46,827 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-28 20:24:46,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:46,828 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-28 20:24:46,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 20:24:46,828 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-28 20:24:46,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash 455148826, now seen corresponding path program 1 times [2023-11-28 20:24:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:46,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954325369] [2023-11-28 20:24:46,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:46,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:46,869 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-28 20:24:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954325369] [2023-11-28 20:24:46,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954325369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:46,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:46,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110292839] [2023-11-28 20:24:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:46,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:46,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:46,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:46,883 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-28 20:24:46,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:46,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:46,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:47,505 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-28 20:24:47,505 INFO L294 olderBase$Statistics]: this new event has 219 ancestors and is cut-off event [2023-11-28 20:24:47,505 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-28 20:24:47,505 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-28 20:24:47,505 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-28 20:24:47,506 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-28 20:24:47,506 INFO L294 olderBase$Statistics]: this new event has 218 ancestors and is cut-off event [2023-11-28 20:24:47,506 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-28 20:24:47,506 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-28 20:24:47,506 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-28 20:24:47,509 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-28 20:24:47,509 INFO L294 olderBase$Statistics]: this new event has 210 ancestors and is cut-off event [2023-11-28 20:24:47,509 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-28 20:24:47,509 INFO L297 olderBase$Statistics]: existing Event has 218 ancestors and is cut-off event [2023-11-28 20:24:47,509 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2023-11-28 20:24:47,509 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2023-11-28 20:24:47,539 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-28 20:24:47,540 INFO L294 olderBase$Statistics]: this new event has 211 ancestors and is cut-off event [2023-11-28 20:24:47,540 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-28 20:24:47,540 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is cut-off event [2023-11-28 20:24:47,540 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2023-11-28 20:24:47,540 INFO L297 olderBase$Statistics]: existing Event has 219 ancestors and is cut-off event [2023-11-28 20:24:47,584 INFO L124 PetriNetUnfolderBase]: 126/3529 cut-off events. [2023-11-28 20:24:47,585 INFO L125 PetriNetUnfolderBase]: For 63/81 co-relation queries the response was YES. [2023-11-28 20:24:47,635 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-28 20:24:47,648 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 16 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2023-11-28 20:24:47,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 394 transitions, 915 flow [2023-11-28 20:24:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:47,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1262 transitions. [2023-11-28 20:24:47,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9648318042813455 [2023-11-28 20:24:47,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1262 transitions. [2023-11-28 20:24:47,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1262 transitions. [2023-11-28 20:24:47,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:47,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1262 transitions. [2023-11-28 20:24:47,655 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-28 20:24:47,658 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-28 20:24:47,658 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-28 20:24:47,658 INFO L175 Difference]: Start difference. First operand has 383 places, 389 transitions, 864 flow. Second operand 3 states and 1262 transitions. [2023-11-28 20:24:47,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 394 transitions, 915 flow [2023-11-28 20:24:47,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 394 transitions, 915 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:47,667 INFO L231 Difference]: Finished difference. Result has 384 places, 389 transitions, 874 flow [2023-11-28 20:24:47,668 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-28 20:24:47,668 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-28 20:24:47,668 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 389 transitions, 874 flow [2023-11-28 20:24:47,669 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-28 20:24:47,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:47,669 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-28 20:24:47,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 20:24:47,669 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-28 20:24:47,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1372146367, now seen corresponding path program 1 times [2023-11-28 20:24:47,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:47,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90741119] [2023-11-28 20:24:47,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:47,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:47,711 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-28 20:24:47,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:47,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90741119] [2023-11-28 20:24:47,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90741119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:47,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:47,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:47,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846952922] [2023-11-28 20:24:47,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:47,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:47,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:47,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:47,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:47,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:47,734 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-28 20:24:47,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:47,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:47,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:48,533 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-28 20:24:48,533 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-28 20:24:48,533 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-28 20:24:48,533 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:48,533 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:48,534 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-28 20:24:48,534 INFO L294 olderBase$Statistics]: this new event has 223 ancestors and is not cut-off event [2023-11-28 20:24:48,534 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is not cut-off event [2023-11-28 20:24:48,534 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:48,534 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:48,534 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:48,546 INFO L124 PetriNetUnfolderBase]: 201/4811 cut-off events. [2023-11-28 20:24:48,546 INFO L125 PetriNetUnfolderBase]: For 63/160 co-relation queries the response was YES. [2023-11-28 20:24:48,590 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-28 20:24:48,602 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/390 dead transitions. [2023-11-28 20:24:48,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 390 transitions, 906 flow [2023-11-28 20:24:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-28 20:24:48,604 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-28 20:24:48,604 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-28 20:24:48,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-28 20:24:48,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:48,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-28 20:24:48,607 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-28 20:24:48,609 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-28 20:24:48,609 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-28 20:24:48,609 INFO L175 Difference]: Start difference. First operand has 384 places, 389 transitions, 874 flow. Second operand 3 states and 1257 transitions. [2023-11-28 20:24:48,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 390 transitions, 906 flow [2023-11-28 20:24:48,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 390 transitions, 906 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:48,616 INFO L231 Difference]: Finished difference. Result has 385 places, 388 transitions, 876 flow [2023-11-28 20:24:48,616 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-28 20:24:48,617 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -13 predicate places. [2023-11-28 20:24:48,617 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 388 transitions, 876 flow [2023-11-28 20:24:48,617 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-28 20:24:48,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:48,617 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-28 20:24:48,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 20:24:48,617 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-28 20:24:48,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:48,618 INFO L85 PathProgramCache]: Analyzing trace with hash -2112270679, now seen corresponding path program 1 times [2023-11-28 20:24:48,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:48,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625223531] [2023-11-28 20:24:48,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:48,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:48,660 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-28 20:24:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:48,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625223531] [2023-11-28 20:24:48,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625223531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:48,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:48,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:48,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339888378] [2023-11-28 20:24:48,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:48,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:48,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:48,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:48,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 436 [2023-11-28 20:24:48,679 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-28 20:24:48,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:48,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 436 [2023-11-28 20:24:48,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:49,754 INFO L124 PetriNetUnfolderBase]: 454/7742 cut-off events. [2023-11-28 20:24:49,754 INFO L125 PetriNetUnfolderBase]: For 145/157 co-relation queries the response was YES. [2023-11-28 20:24:49,800 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-28 20:24:49,814 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 19 selfloop transitions, 4 changer transitions 0/392 dead transitions. [2023-11-28 20:24:49,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 392 transitions, 934 flow [2023-11-28 20:24:49,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:49,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:49,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1251 transitions. [2023-11-28 20:24:49,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9564220183486238 [2023-11-28 20:24:49,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1251 transitions. [2023-11-28 20:24:49,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1251 transitions. [2023-11-28 20:24:49,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:49,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1251 transitions. [2023-11-28 20:24:49,821 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-28 20:24:49,823 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-28 20:24:49,823 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-28 20:24:49,823 INFO L175 Difference]: Start difference. First operand has 385 places, 388 transitions, 876 flow. Second operand 3 states and 1251 transitions. [2023-11-28 20:24:49,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 392 transitions, 934 flow [2023-11-28 20:24:49,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 392 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:49,830 INFO L231 Difference]: Finished difference. Result has 382 places, 388 transitions, 892 flow [2023-11-28 20:24:49,831 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-28 20:24:49,831 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -16 predicate places. [2023-11-28 20:24:49,831 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 388 transitions, 892 flow [2023-11-28 20:24:49,832 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-28 20:24:49,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:49,832 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-28 20:24:49,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 20:24:49,832 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-28 20:24:49,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 655770181, now seen corresponding path program 1 times [2023-11-28 20:24:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310240700] [2023-11-28 20:24:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:50,305 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-28 20:24:50,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:50,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310240700] [2023-11-28 20:24:50,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310240700] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:50,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:50,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:24:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057863671] [2023-11-28 20:24:50,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:50,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:24:50,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:50,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:24:50,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:24:50,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-28 20:24:50,455 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-28 20:24:50,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:50,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-28 20:24:50,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:50,961 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-28 20:24:50,961 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-28 20:24:50,961 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-28 20:24:50,961 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:50,961 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:50,971 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-28 20:24:50,971 INFO L294 olderBase$Statistics]: this new event has 239 ancestors and is cut-off event [2023-11-28 20:24:50,971 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:50,971 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:50,971 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:50,971 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-28 20:24:50,972 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is cut-off event [2023-11-28 20:24:50,972 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:50,972 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:50,972 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:50,972 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-28 20:24:50,973 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-28 20:24:50,973 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-28 20:24:50,973 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is cut-off event [2023-11-28 20:24:50,973 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:50,973 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:50,973 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:50,973 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is cut-off event [2023-11-28 20:24:50,979 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-28 20:24:50,979 INFO L294 olderBase$Statistics]: this new event has 231 ancestors and is not cut-off event [2023-11-28 20:24:50,979 INFO L297 olderBase$Statistics]: existing Event has 231 ancestors and is not cut-off event [2023-11-28 20:24:50,979 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:50,979 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:50,979 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:50,979 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:50,979 INFO L297 olderBase$Statistics]: existing Event has 239 ancestors and is not cut-off event [2023-11-28 20:24:50,991 INFO L124 PetriNetUnfolderBase]: 123/3682 cut-off events. [2023-11-28 20:24:50,992 INFO L125 PetriNetUnfolderBase]: For 35/84 co-relation queries the response was YES. [2023-11-28 20:24:51,026 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-28 20:24:51,034 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 9 selfloop transitions, 4 changer transitions 0/387 dead transitions. [2023-11-28 20:24:51,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 387 transitions, 916 flow [2023-11-28 20:24:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:24:51,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:24:51,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2023-11-28 20:24:51,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9480122324159022 [2023-11-28 20:24:51,039 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2480 transitions. [2023-11-28 20:24:51,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2480 transitions. [2023-11-28 20:24:51,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:51,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2480 transitions. [2023-11-28 20:24:51,044 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-28 20:24:51,049 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-28 20:24:51,050 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-28 20:24:51,050 INFO L175 Difference]: Start difference. First operand has 382 places, 388 transitions, 892 flow. Second operand 6 states and 2480 transitions. [2023-11-28 20:24:51,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 387 transitions, 916 flow [2023-11-28 20:24:51,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 387 transitions, 916 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:51,059 INFO L231 Difference]: Finished difference. Result has 386 places, 387 transitions, 898 flow [2023-11-28 20:24:51,060 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-28 20:24:51,060 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-28 20:24:51,060 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 387 transitions, 898 flow [2023-11-28 20:24:51,061 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-28 20:24:51,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:51,062 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-28 20:24:51,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 20:24:51,062 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-28 20:24:51,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1588184141, now seen corresponding path program 1 times [2023-11-28 20:24:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538368597] [2023-11-28 20:24:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:51,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:51,106 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-28 20:24:51,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:51,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538368597] [2023-11-28 20:24:51,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538368597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685360862] [2023-11-28 20:24:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:51,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:51,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:51,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:51,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:51,120 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-28 20:24:51,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:51,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:51,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:52,041 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-28 20:24:52,041 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-28 20:24:52,041 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:52,042 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-28 20:24:52,042 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:52,129 INFO L124 PetriNetUnfolderBase]: 240/6042 cut-off events. [2023-11-28 20:24:52,129 INFO L125 PetriNetUnfolderBase]: For 93/99 co-relation queries the response was YES. [2023-11-28 20:24:52,234 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-28 20:24:52,242 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 15 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2023-11-28 20:24:52,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 391 transitions, 944 flow [2023-11-28 20:24:52,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2023-11-28 20:24:52,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640672782874617 [2023-11-28 20:24:52,246 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1261 transitions. [2023-11-28 20:24:52,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1261 transitions. [2023-11-28 20:24:52,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:52,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1261 transitions. [2023-11-28 20:24:52,248 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-28 20:24:52,250 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-28 20:24:52,251 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-28 20:24:52,251 INFO L175 Difference]: Start difference. First operand has 386 places, 387 transitions, 898 flow. Second operand 3 states and 1261 transitions. [2023-11-28 20:24:52,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 391 transitions, 944 flow [2023-11-28 20:24:52,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 391 transitions, 937 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:24:52,260 INFO L231 Difference]: Finished difference. Result has 383 places, 387 transitions, 901 flow [2023-11-28 20:24:52,261 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-28 20:24:52,261 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-28 20:24:52,261 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 387 transitions, 901 flow [2023-11-28 20:24:52,262 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-28 20:24:52,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:52,262 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-28 20:24:52,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 20:24:52,263 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-28 20:24:52,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:52,263 INFO L85 PathProgramCache]: Analyzing trace with hash 638616018, now seen corresponding path program 1 times [2023-11-28 20:24:52,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:52,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433297594] [2023-11-28 20:24:52,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:52,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:52,304 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-28 20:24:52,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:52,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433297594] [2023-11-28 20:24:52,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433297594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:52,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:52,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:52,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846693603] [2023-11-28 20:24:52,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:52,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:52,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:52,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:52,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:52,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:52,320 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-28 20:24:52,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:52,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:52,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:53,042 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-28 20:24:53,042 INFO L294 olderBase$Statistics]: this new event has 193 ancestors and is cut-off event [2023-11-28 20:24:53,042 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-28 20:24:53,042 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-28 20:24:53,042 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2023-11-28 20:24:53,147 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-28 20:24:53,148 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,148 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,148 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,148 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,208 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-28 20:24:53,208 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-28 20:24:53,208 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:53,209 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:53,209 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:53,209 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-28 20:24:53,209 INFO L294 olderBase$Statistics]: this new event has 251 ancestors and is cut-off event [2023-11-28 20:24:53,209 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-28 20:24:53,209 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-28 20:24:53,209 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-28 20:24:53,209 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-28 20:24:53,209 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,210 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,210 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,210 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,211 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-28 20:24:53,211 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,211 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,211 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,211 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,211 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,211 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-28 20:24:53,211 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,212 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-28 20:24:53,212 INFO L294 olderBase$Statistics]: this new event has 277 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,212 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,213 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,213 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is cut-off event [2023-11-28 20:24:53,215 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-28 20:24:53,215 INFO L294 olderBase$Statistics]: this new event has 257 ancestors and is cut-off event [2023-11-28 20:24:53,215 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,215 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,216 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-28 20:24:53,228 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-28 20:24:53,228 INFO L294 olderBase$Statistics]: this new event has 241 ancestors and is not cut-off event [2023-11-28 20:24:53,228 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is not cut-off event [2023-11-28 20:24:53,228 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is not cut-off event [2023-11-28 20:24:53,228 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is not cut-off event [2023-11-28 20:24:53,228 INFO L297 olderBase$Statistics]: existing Event has 241 ancestors and is not cut-off event [2023-11-28 20:24:53,229 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-28 20:24:53,229 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2023-11-28 20:24:53,229 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:53,229 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:53,229 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:53,229 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:53,231 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-28 20:24:53,231 INFO L294 olderBase$Statistics]: this new event has 243 ancestors and is cut-off event [2023-11-28 20:24:53,231 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-28 20:24:53,231 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-28 20:24:53,231 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2023-11-28 20:24:53,231 INFO L297 olderBase$Statistics]: existing Event has 243 ancestors and is cut-off event [2023-11-28 20:24:53,239 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-28 20:24:53,239 INFO L294 olderBase$Statistics]: this new event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,239 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,239 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2023-11-28 20:24:53,239 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-28 20:24:53,239 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2023-11-28 20:24:53,243 INFO L124 PetriNetUnfolderBase]: 395/4999 cut-off events. [2023-11-28 20:24:53,243 INFO L125 PetriNetUnfolderBase]: For 280/328 co-relation queries the response was YES. [2023-11-28 20:24:53,276 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-28 20:24:53,284 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 12 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2023-11-28 20:24:53,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 388 transitions, 933 flow [2023-11-28 20:24:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1257 transitions. [2023-11-28 20:24:53,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9610091743119266 [2023-11-28 20:24:53,287 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1257 transitions. [2023-11-28 20:24:53,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1257 transitions. [2023-11-28 20:24:53,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:53,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1257 transitions. [2023-11-28 20:24:53,289 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-28 20:24:53,291 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-28 20:24:53,291 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-28 20:24:53,291 INFO L175 Difference]: Start difference. First operand has 383 places, 387 transitions, 901 flow. Second operand 3 states and 1257 transitions. [2023-11-28 20:24:53,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 388 transitions, 933 flow [2023-11-28 20:24:53,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 388 transitions, 933 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-28 20:24:53,299 INFO L231 Difference]: Finished difference. Result has 384 places, 386 transitions, 903 flow [2023-11-28 20:24:53,300 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-28 20:24:53,300 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -14 predicate places. [2023-11-28 20:24:53,301 INFO L495 AbstractCegarLoop]: Abstraction has has 384 places, 386 transitions, 903 flow [2023-11-28 20:24:53,301 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-28 20:24:53,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:53,301 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-28 20:24:53,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-28 20:24:53,301 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-28 20:24:53,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -764087432, now seen corresponding path program 1 times [2023-11-28 20:24:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42088777] [2023-11-28 20:24:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:53,954 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-28 20:24:53,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:53,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42088777] [2023-11-28 20:24:53,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42088777] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:53,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:53,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:24:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304692395] [2023-11-28 20:24:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:53,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:24:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:24:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:24:54,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-28 20:24:54,112 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-28 20:24:54,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:54,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-28 20:24:54,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:54,667 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-28 20:24:54,667 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-28 20:24:54,667 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-28 20:24:54,667 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:54,667 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:54,693 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-28 20:24:54,694 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:54,694 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-28 20:24:54,694 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:54,694 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-28 20:24:54,694 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:54,694 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:54,700 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-28 20:24:54,700 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-28 20:24:54,700 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is not cut-off event [2023-11-28 20:24:54,700 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:54,700 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:54,700 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:54,700 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:54,700 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:54,703 INFO L124 PetriNetUnfolderBase]: 133/3982 cut-off events. [2023-11-28 20:24:54,703 INFO L125 PetriNetUnfolderBase]: For 32/71 co-relation queries the response was YES. [2023-11-28 20:24:54,738 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-28 20:24:54,746 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 9 selfloop transitions, 4 changer transitions 0/385 dead transitions. [2023-11-28 20:24:54,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 385 transitions, 927 flow [2023-11-28 20:24:54,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:24:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:24:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2023-11-28 20:24:54,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9480122324159022 [2023-11-28 20:24:54,751 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2480 transitions. [2023-11-28 20:24:54,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2480 transitions. [2023-11-28 20:24:54,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:54,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2480 transitions. [2023-11-28 20:24:54,757 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-28 20:24:54,760 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-28 20:24:54,761 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-28 20:24:54,761 INFO L175 Difference]: Start difference. First operand has 384 places, 386 transitions, 903 flow. Second operand 6 states and 2480 transitions. [2023-11-28 20:24:54,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 385 transitions, 927 flow [2023-11-28 20:24:54,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 385 transitions, 923 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 20:24:54,769 INFO L231 Difference]: Finished difference. Result has 386 places, 385 transitions, 905 flow [2023-11-28 20:24:54,769 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-28 20:24:54,769 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-28 20:24:54,770 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 385 transitions, 905 flow [2023-11-28 20:24:54,770 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-28 20:24:54,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:54,770 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-28 20:24:54,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-28 20:24:54,770 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-28 20:24:54,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1077722887, now seen corresponding path program 1 times [2023-11-28 20:24:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:54,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33062418] [2023-11-28 20:24:54,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:55,527 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-28 20:24:55,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:55,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33062418] [2023-11-28 20:24:55,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33062418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:55,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:55,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 20:24:55,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133202112] [2023-11-28 20:24:55,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:55,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 20:24:55,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:55,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 20:24:55,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-28 20:24:55,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 436 [2023-11-28 20:24:55,697 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-28 20:24:55,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:55,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 436 [2023-11-28 20:24:55,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:56,404 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-28 20:24:56,404 INFO L294 olderBase$Statistics]: this new event has 203 ancestors and is not cut-off event [2023-11-28 20:24:56,404 INFO L297 olderBase$Statistics]: existing Event has 211 ancestors and is not cut-off event [2023-11-28 20:24:56,404 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:56,404 INFO L297 olderBase$Statistics]: existing Event has 203 ancestors and is not cut-off event [2023-11-28 20:24:56,440 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-28 20:24:56,441 INFO L294 olderBase$Statistics]: this new event has 295 ancestors and is cut-off event [2023-11-28 20:24:56,441 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,441 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:56,441 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,441 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-28 20:24:56,441 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,441 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,441 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:56,441 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,442 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-28 20:24:56,442 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-28 20:24:56,442 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is cut-off event [2023-11-28 20:24:56,442 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,442 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,442 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:56,442 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:56,442 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is cut-off event [2023-11-28 20:24:56,450 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-28 20:24:56,450 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-28 20:24:56,450 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:56,450 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:56,450 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:56,450 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:56,450 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:56,450 INFO L297 olderBase$Statistics]: existing Event has 295 ancestors and is not cut-off event [2023-11-28 20:24:56,453 INFO L124 PetriNetUnfolderBase]: 133/3973 cut-off events. [2023-11-28 20:24:56,454 INFO L125 PetriNetUnfolderBase]: For 15/44 co-relation queries the response was YES. [2023-11-28 20:24:56,491 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-28 20:24:56,499 INFO L140 encePairwiseOnDemand]: 431/436 looper letters, 9 selfloop transitions, 4 changer transitions 0/384 dead transitions. [2023-11-28 20:24:56,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 384 transitions, 929 flow [2023-11-28 20:24:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 20:24:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 20:24:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2023-11-28 20:24:56,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9480122324159022 [2023-11-28 20:24:56,507 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2480 transitions. [2023-11-28 20:24:56,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2480 transitions. [2023-11-28 20:24:56,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:56,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2480 transitions. [2023-11-28 20:24:56,515 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-28 20:24:56,518 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-28 20:24:56,518 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-28 20:24:56,519 INFO L175 Difference]: Start difference. First operand has 386 places, 385 transitions, 905 flow. Second operand 6 states and 2480 transitions. [2023-11-28 20:24:56,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 384 transitions, 929 flow [2023-11-28 20:24:56,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 386 places, 384 transitions, 922 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:24:56,526 INFO L231 Difference]: Finished difference. Result has 386 places, 384 transitions, 904 flow [2023-11-28 20:24:56,526 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-28 20:24:56,527 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -12 predicate places. [2023-11-28 20:24:56,527 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 384 transitions, 904 flow [2023-11-28 20:24:56,527 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-28 20:24:56,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:56,528 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-28 20:24:56,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-28 20:24:56,528 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-28 20:24:56,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:56,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1035990443, now seen corresponding path program 1 times [2023-11-28 20:24:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:56,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994459716] [2023-11-28 20:24:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 20:24:56,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:56,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994459716] [2023-11-28 20:24:56,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994459716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:56,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:56,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:56,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172845330] [2023-11-28 20:24:56,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:56,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:56,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:56,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:56,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:56,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 417 out of 436 [2023-11-28 20:24:56,612 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-28 20:24:56,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:56,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 417 of 436 [2023-11-28 20:24:56,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:57,373 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-28 20:24:57,373 INFO L294 olderBase$Statistics]: this new event has 267 ancestors and is cut-off event [2023-11-28 20:24:57,373 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:57,373 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2023-11-28 20:24:57,373 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is cut-off event [2023-11-28 20:24:57,379 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-28 20:24:57,379 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-28 20:24:57,379 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:57,379 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:57,379 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:57,379 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:57,381 INFO L124 PetriNetUnfolderBase]: 193/5482 cut-off events. [2023-11-28 20:24:57,381 INFO L125 PetriNetUnfolderBase]: For 34/50 co-relation queries the response was YES. [2023-11-28 20:24:57,416 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-28 20:24:57,423 INFO L140 encePairwiseOnDemand]: 434/436 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2023-11-28 20:24:57,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 383 transitions, 920 flow [2023-11-28 20:24:57,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2023-11-28 20:24:57,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9640672782874617 [2023-11-28 20:24:57,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1261 transitions. [2023-11-28 20:24:57,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1261 transitions. [2023-11-28 20:24:57,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:57,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1261 transitions. [2023-11-28 20:24:57,430 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-28 20:24:57,432 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-28 20:24:57,432 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-28 20:24:57,432 INFO L175 Difference]: Start difference. First operand has 386 places, 384 transitions, 904 flow. Second operand 3 states and 1261 transitions. [2023-11-28 20:24:57,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 383 transitions, 920 flow [2023-11-28 20:24:57,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 383 transitions, 913 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 20:24:57,439 INFO L231 Difference]: Finished difference. Result has 383 places, 383 transitions, 897 flow [2023-11-28 20:24:57,440 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-28 20:24:57,440 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -15 predicate places. [2023-11-28 20:24:57,440 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 383 transitions, 897 flow [2023-11-28 20:24:57,440 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-28 20:24:57,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:57,441 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-28 20:24:57,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-28 20:24:57,441 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-28 20:24:57,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2132542680, now seen corresponding path program 1 times [2023-11-28 20:24:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:57,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285138688] [2023-11-28 20:24:57,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:57,499 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-28 20:24:57,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:57,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285138688] [2023-11-28 20:24:57,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285138688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:57,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:57,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479396845] [2023-11-28 20:24:57,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:57,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:57,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:57,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:57,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:57,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:57,512 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-28 20:24:57,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:57,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:57,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:58,377 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-28 20:24:58,377 INFO L294 olderBase$Statistics]: this new event has 259 ancestors and is not cut-off event [2023-11-28 20:24:58,377 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:58,377 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is not cut-off event [2023-11-28 20:24:58,378 INFO L297 olderBase$Statistics]: existing Event has 259 ancestors and is not cut-off event [2023-11-28 20:24:58,380 INFO L124 PetriNetUnfolderBase]: 199/5895 cut-off events. [2023-11-28 20:24:58,380 INFO L125 PetriNetUnfolderBase]: For 42/74 co-relation queries the response was YES. [2023-11-28 20:24:58,432 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-28 20:24:58,443 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 10 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2023-11-28 20:24:58,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 381 transitions, 915 flow [2023-11-28 20:24:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1255 transitions. [2023-11-28 20:24:58,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.959480122324159 [2023-11-28 20:24:58,446 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1255 transitions. [2023-11-28 20:24:58,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1255 transitions. [2023-11-28 20:24:58,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:58,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1255 transitions. [2023-11-28 20:24:58,448 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-28 20:24:58,449 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-28 20:24:58,449 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-28 20:24:58,449 INFO L175 Difference]: Start difference. First operand has 383 places, 383 transitions, 897 flow. Second operand 3 states and 1255 transitions. [2023-11-28 20:24:58,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 381 transitions, 915 flow [2023-11-28 20:24:58,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 381 transitions, 914 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:24:58,455 INFO L231 Difference]: Finished difference. Result has 382 places, 381 transitions, 894 flow [2023-11-28 20:24:58,455 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-28 20:24:58,456 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -16 predicate places. [2023-11-28 20:24:58,456 INFO L495 AbstractCegarLoop]: Abstraction has has 382 places, 381 transitions, 894 flow [2023-11-28 20:24:58,456 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-28 20:24:58,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 20:24:58,456 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-28 20:24:58,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-28 20:24:58,456 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-28 20:24:58,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 20:24:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -939309606, now seen corresponding path program 1 times [2023-11-28 20:24:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 20:24:58,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832232914] [2023-11-28 20:24:58,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 20:24:58,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 20:24:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 20:24:58,509 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-28 20:24:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 20:24:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832232914] [2023-11-28 20:24:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832232914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 20:24:58,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 20:24:58,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 20:24:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898731141] [2023-11-28 20:24:58,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 20:24:58,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 20:24:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 20:24:58,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 20:24:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 20:24:58,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 414 out of 436 [2023-11-28 20:24:58,524 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-28 20:24:58,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 20:24:58,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 414 of 436 [2023-11-28 20:24:58,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 20:24:59,044 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-28 20:24:59,044 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2023-11-28 20:24:59,044 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2023-11-28 20:24:59,044 INFO L297 olderBase$Statistics]: existing Event has 194 ancestors and is cut-off event [2023-11-28 20:24:59,045 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2023-11-28 20:24:59,107 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-28 20:24:59,107 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,107 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,107 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,107 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,131 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-28 20:24:59,131 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,131 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,131 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,131 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,131 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,131 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-28 20:24:59,131 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,132 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-28 20:24:59,132 INFO L294 olderBase$Statistics]: this new event has 278 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,132 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,134 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-28 20:24:59,134 INFO L294 olderBase$Statistics]: this new event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,134 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2023-11-28 20:24:59,134 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,134 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is cut-off event [2023-11-28 20:24:59,143 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-28 20:24:59,143 INFO L294 olderBase$Statistics]: this new event has 242 ancestors and is not cut-off event [2023-11-28 20:24:59,143 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2023-11-28 20:24:59,143 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2023-11-28 20:24:59,143 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is not cut-off event [2023-11-28 20:24:59,143 INFO L297 olderBase$Statistics]: existing Event has 242 ancestors and is not cut-off event [2023-11-28 20:24:59,148 INFO L124 PetriNetUnfolderBase]: 203/4395 cut-off events. [2023-11-28 20:24:59,148 INFO L125 PetriNetUnfolderBase]: For 88/116 co-relation queries the response was YES. [2023-11-28 20:24:59,180 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-28 20:24:59,181 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 0 selfloop transitions, 0 changer transitions 379/379 dead transitions. [2023-11-28 20:24:59,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 379 transitions, 910 flow [2023-11-28 20:24:59,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 20:24:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 20:24:59,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2023-11-28 20:24:59,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9587155963302753 [2023-11-28 20:24:59,185 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1254 transitions. [2023-11-28 20:24:59,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1254 transitions. [2023-11-28 20:24:59,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 20:24:59,186 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1254 transitions. [2023-11-28 20:24:59,187 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-28 20:24:59,188 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-28 20:24:59,188 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-28 20:24:59,189 INFO L175 Difference]: Start difference. First operand has 382 places, 381 transitions, 894 flow. Second operand 3 states and 1254 transitions. [2023-11-28 20:24:59,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 379 transitions, 910 flow [2023-11-28 20:24:59,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 379 transitions, 909 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 20:24:59,193 INFO L231 Difference]: Finished difference. Result has 381 places, 0 transitions, 0 flow [2023-11-28 20:24:59,193 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-28 20:24:59,193 INFO L281 CegarLoopForPetriNet]: 398 programPoint places, -17 predicate places. [2023-11-28 20:24:59,194 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 0 transitions, 0 flow [2023-11-28 20:24:59,194 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-28 20:24:59,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (73 of 74 remaining) [2023-11-28 20:24:59,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (72 of 74 remaining) [2023-11-28 20:24:59,196 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (71 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (70 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (69 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (68 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (67 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (66 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (65 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (63 of 74 remaining) [2023-11-28 20:24:59,197 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (62 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (61 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (57 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (56 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (55 of 74 remaining) [2023-11-28 20:24:59,198 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (54 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (53 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (52 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (51 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (49 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (48 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (47 of 74 remaining) [2023-11-28 20:24:59,199 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (35 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (34 of 74 remaining) [2023-11-28 20:24:59,200 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (33 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (32 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (31 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (30 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (24 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 74 remaining) [2023-11-28 20:24:59,201 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (7 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (6 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (5 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (4 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 74 remaining) [2023-11-28 20:24:59,202 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 74 remaining) [2023-11-28 20:24:59,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 74 remaining) [2023-11-28 20:24:59,203 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 74 remaining) [2023-11-28 20:24:59,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-28 20:24:59,203 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-28 20:24:59,208 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 20:24:59,208 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 20:24:59,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:24:59 BasicIcfg [2023-11-28 20:24:59,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 20:24:59,213 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 20:24:59,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 20:24:59,213 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 20:24:59,213 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:24:40" (3/4) ... [2023-11-28 20:24:59,214 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-28 20:24:59,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-28 20:24:59,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-28 20:24:59,217 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2023-11-28 20:24:59,223 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2023-11-28 20:24:59,223 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-28 20:24:59,223 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-28 20:24:59,224 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-28 20:24:59,310 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-28 20:24:59,310 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-28 20:24:59,310 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 20:24:59,311 INFO L158 Benchmark]: Toolchain (without parser) took 20189.70ms. Allocated memory was 153.1MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 112.7MB in the beginning and 1.0GB in the end (delta: -892.2MB). Peak memory consumption was 327.2MB. Max. memory is 16.1GB. [2023-11-28 20:24:59,312 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 20:24:59,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.05ms. Allocated memory is still 153.1MB. Free memory was 112.7MB in the beginning and 100.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-28 20:24:59,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.36ms. Allocated memory is still 153.1MB. Free memory was 100.2MB in the beginning and 97.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 20:24:59,313 INFO L158 Benchmark]: Boogie Preprocessor took 42.59ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 20:24:59,313 INFO L158 Benchmark]: RCFGBuilder took 723.19ms. Allocated memory was 153.1MB in the beginning and 276.8MB in the end (delta: 123.7MB). Free memory was 95.1MB in the beginning and 244.9MB in the end (delta: -149.8MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2023-11-28 20:24:59,314 INFO L158 Benchmark]: TraceAbstraction took 19021.07ms. Allocated memory was 276.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 243.8MB in the beginning and 1.0GB in the end (delta: -767.4MB). Peak memory consumption was 956.5MB. Max. memory is 16.1GB. [2023-11-28 20:24:59,314 INFO L158 Benchmark]: Witness Printer took 98.04ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-28 20:24:59,316 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.14ms. Allocated memory is still 104.9MB. Free memory is still 53.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 244.05ms. Allocated memory is still 153.1MB. Free memory was 112.7MB in the beginning and 100.2MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.36ms. Allocated memory is still 153.1MB. Free memory was 100.2MB in the beginning and 97.2MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.59ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 95.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 723.19ms. Allocated memory was 153.1MB in the beginning and 276.8MB in the end (delta: 123.7MB). Free memory was 95.1MB in the beginning and 244.9MB in the end (delta: -149.8MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19021.07ms. Allocated memory was 276.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 243.8MB in the beginning and 1.0GB in the end (delta: -767.4MB). Peak memory consumption was 956.5MB. Max. memory is 16.1GB. * Witness Printer took 98.04ms. Allocated memory is still 1.4GB. Free memory was 1.0GB in the beginning and 1.0GB 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: 18.8s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 694 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 264 mSDsluCounter, 152 SdHoareTripleChecker+Invalid, 0.9s 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.1s 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.2s SatisfiabilityAnalysisTime, 2.6s 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-28 20:24:59,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c5378bf0-2b07-492a-821c-bc165b704ff1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE