./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:58:29,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:58:30,002 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-26 11:58:30,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:58:30,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:58:30,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:58:30,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:58:30,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:58:30,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:58:30,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:58:30,067 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:58:30,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:58:30,068 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:58:30,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:58:30,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-26 11:58:30,071 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:58:30,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:58:30,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:58:30,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:58:30,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-26 11:58:30,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:58:30,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-26 11:58:30,074 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-26 11:58:30,075 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:58:30,075 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:58:30,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:58:30,076 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:58:30,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:58:30,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:58:30,078 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:58:30,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:30,080 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:58:30,080 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:58:30,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-26 11:58:30,080 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:58:30,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:58:30,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:58:30,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:58:30,082 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-26 11:58:30,082 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:58:30,082 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:58:30,082 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_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 [2023-11-26 11:58:30,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:58:30,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:58:30,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:58:30,391 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:58:30,391 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:58:30,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2023-11-26 11:58:33,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:58:33,787 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:58:33,788 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2023-11-26 11:58:33,796 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/data/a71b72616/7a76dfa94d3f497aad79c35ea61c1fbb/FLAG10df0685a [2023-11-26 11:58:33,810 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/data/a71b72616/7a76dfa94d3f497aad79c35ea61c1fbb [2023-11-26 11:58:33,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:58:33,814 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:58:33,815 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:33,815 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:58:33,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:58:33,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:33" (1/1) ... [2023-11-26 11:58:33,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6d6aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:33, skipping insertion in model container [2023-11-26 11:58:33,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:58:33" (1/1) ... [2023-11-26 11:58:33,861 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:58:34,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:34,063 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:58:34,101 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:58:34,118 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:58:34,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34 WrapperNode [2023-11-26 11:58:34,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:58:34,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:34,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:58:34,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:58:34,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,177 INFO L138 Inliner]: procedures = 22, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 249 [2023-11-26 11:58:34,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:58:34,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:58:34,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:58:34,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:58:34,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:58:34,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:58:34,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:58:34,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:58:34,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (1/1) ... [2023-11-26 11:58:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:58:34,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:58:34,257 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:58:34,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:58:34,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:58:34,368 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-26 11:58:34,368 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-26 11:58:34,369 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-26 11:58:34,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-26 11:58:34,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-26 11:58:34,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:58:34,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-26 11:58:34,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:58:34,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:58:34,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-26 11:58:34,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:58:34,373 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:58:34,579 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:58:34,584 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:58:35,297 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:58:35,328 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:58:35,334 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:58:35,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:35 BoogieIcfgContainer [2023-11-26 11:58:35,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:58:35,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:58:35,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:58:35,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:58:35,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:58:33" (1/3) ... [2023-11-26 11:58:35,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67664273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:35, skipping insertion in model container [2023-11-26 11:58:35,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:58:34" (2/3) ... [2023-11-26 11:58:35,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67664273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:58:35, skipping insertion in model container [2023-11-26 11:58:35,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:35" (3/3) ... [2023-11-26 11:58:35,352 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2023-11-26 11:58:35,366 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-26 11:58:35,378 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:58:35,379 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 32 error locations. [2023-11-26 11:58:35,379 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:58:35,482 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-26 11:58:35,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 318 places, 329 transitions, 672 flow [2023-11-26 11:58:35,739 INFO L124 PetriNetUnfolderBase]: 18/327 cut-off events. [2023-11-26 11:58:35,740 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 11:58:35,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 327 events. 18/327 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 659 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2023-11-26 11:58:35,752 INFO L82 GeneralOperation]: Start removeDead. Operand has 318 places, 329 transitions, 672 flow [2023-11-26 11:58:35,786 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 303 transitions, 618 flow [2023-11-26 11:58:35,807 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:58:35,816 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;@6fcc4e30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:58:35,816 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-26 11:58:35,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:58:35,824 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2023-11-26 11:58:35,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:58:35,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:35,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:35,826 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:35,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:35,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1149262623, now seen corresponding path program 1 times [2023-11-26 11:58:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:35,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342310468] [2023-11-26 11:58:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:35,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:36,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342310468] [2023-11-26 11:58:36,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342310468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:36,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833909145] [2023-11-26 11:58:36,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:36,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:36,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:36,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 329 [2023-11-26 11:58:36,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 303 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:36,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 329 [2023-11-26 11:58:36,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:36,278 INFO L124 PetriNetUnfolderBase]: 17/396 cut-off events. [2023-11-26 11:58:36,278 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-26 11:58:36,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 396 events. 17/396 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1226 event pairs, 3 based on Foata normal form. 12/344 useless extension candidates. Maximal degree in co-relation 272. Up to 16 conditions per place. [2023-11-26 11:58:36,287 INFO L140 encePairwiseOnDemand]: 320/329 looper letters, 9 selfloop transitions, 2 changer transitions 2/296 dead transitions. [2023-11-26 11:58:36,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 296 transitions, 626 flow [2023-11-26 11:58:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:36,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 942 transitions. [2023-11-26 11:58:36,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9544072948328267 [2023-11-26 11:58:36,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 942 transitions. [2023-11-26 11:58:36,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 942 transitions. [2023-11-26 11:58:36,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:36,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 942 transitions. [2023-11-26 11:58:36,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 314.0) internal successors, (942), 3 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,331 INFO L175 Difference]: Start difference. First operand has 294 places, 303 transitions, 618 flow. Second operand 3 states and 942 transitions. [2023-11-26 11:58:36,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 296 transitions, 626 flow [2023-11-26 11:58:36,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 296 transitions, 618 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:58:36,345 INFO L231 Difference]: Finished difference. Result has 291 places, 294 transitions, 596 flow [2023-11-26 11:58:36,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=291, PETRI_TRANSITIONS=294} [2023-11-26 11:58:36,351 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -3 predicate places. [2023-11-26 11:58:36,352 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 294 transitions, 596 flow [2023-11-26 11:58:36,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:36,353 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] [2023-11-26 11:58:36,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:58:36,354 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:36,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash -2028855472, now seen corresponding path program 1 times [2023-11-26 11:58:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873285917] [2023-11-26 11:58:36,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:36,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:36,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:36,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873285917] [2023-11-26 11:58:36,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873285917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:36,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:36,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:36,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035161043] [2023-11-26 11:58:36,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:36,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:36,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:36,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:36,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:36,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 329 [2023-11-26 11:58:36,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 294 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:36,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 329 [2023-11-26 11:58:36,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:36,554 INFO L124 PetriNetUnfolderBase]: 18/432 cut-off events. [2023-11-26 11:58:36,555 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-26 11:58:36,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 432 events. 18/432 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1357 event pairs, 3 based on Foata normal form. 0/367 useless extension candidates. Maximal degree in co-relation 426. Up to 17 conditions per place. [2023-11-26 11:58:36,560 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 9 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2023-11-26 11:58:36,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 293 transitions, 616 flow [2023-11-26 11:58:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:36,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 936 transitions. [2023-11-26 11:58:36,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9483282674772037 [2023-11-26 11:58:36,565 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 936 transitions. [2023-11-26 11:58:36,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 936 transitions. [2023-11-26 11:58:36,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:36,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 936 transitions. [2023-11-26 11:58:36,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,574 INFO L175 Difference]: Start difference. First operand has 291 places, 294 transitions, 596 flow. Second operand 3 states and 936 transitions. [2023-11-26 11:58:36,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 293 transitions, 616 flow [2023-11-26 11:58:36,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 293 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:36,584 INFO L231 Difference]: Finished difference. Result has 288 places, 293 transitions, 594 flow [2023-11-26 11:58:36,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=288, PETRI_TRANSITIONS=293} [2023-11-26 11:58:36,585 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -6 predicate places. [2023-11-26 11:58:36,586 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 293 transitions, 594 flow [2023-11-26 11:58:36,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:36,587 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] [2023-11-26 11:58:36,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:58:36,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:36,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1430882428, now seen corresponding path program 1 times [2023-11-26 11:58:36,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:36,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343724511] [2023-11-26 11:58:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:36,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:36,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:36,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343724511] [2023-11-26 11:58:36,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343724511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:36,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:36,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023409523] [2023-11-26 11:58:36,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:36,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:36,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:36,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:36,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:36,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 293 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:36,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:36,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:36,834 INFO L124 PetriNetUnfolderBase]: 27/546 cut-off events. [2023-11-26 11:58:36,834 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 11:58:36,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 546 events. 27/546 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2399 event pairs, 5 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 536. Up to 21 conditions per place. [2023-11-26 11:58:36,841 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 10 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2023-11-26 11:58:36,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 292 transitions, 616 flow [2023-11-26 11:58:36,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2023-11-26 11:58:36,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9463019250253293 [2023-11-26 11:58:36,845 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 934 transitions. [2023-11-26 11:58:36,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 934 transitions. [2023-11-26 11:58:36,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:36,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 934 transitions. [2023-11-26 11:58:36,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,853 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,854 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,855 INFO L175 Difference]: Start difference. First operand has 288 places, 293 transitions, 594 flow. Second operand 3 states and 934 transitions. [2023-11-26 11:58:36,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 292 transitions, 616 flow [2023-11-26 11:58:36,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 292 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:36,864 INFO L231 Difference]: Finished difference. Result has 287 places, 292 transitions, 592 flow [2023-11-26 11:58:36,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=287, PETRI_TRANSITIONS=292} [2023-11-26 11:58:36,866 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -7 predicate places. [2023-11-26 11:58:36,867 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 292 transitions, 592 flow [2023-11-26 11:58:36,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,868 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:36,868 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] [2023-11-26 11:58:36,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:58:36,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:36,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1157212278, now seen corresponding path program 1 times [2023-11-26 11:58:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029310598] [2023-11-26 11:58:36,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:36,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:36,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:36,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029310598] [2023-11-26 11:58:36,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029310598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:36,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:36,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907971257] [2023-11-26 11:58:36,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:36,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:36,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:36,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:36,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:36,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 292 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:36,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:36,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:36,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:37,099 INFO L124 PetriNetUnfolderBase]: 23/449 cut-off events. [2023-11-26 11:58:37,099 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 11:58:37,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 449 events. 23/449 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1732 event pairs, 5 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 433. Up to 21 conditions per place. [2023-11-26 11:58:37,105 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 10 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2023-11-26 11:58:37,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 291 transitions, 614 flow [2023-11-26 11:58:37,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2023-11-26 11:58:37,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9463019250253293 [2023-11-26 11:58:37,109 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:37,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,119 INFO L175 Difference]: Start difference. First operand has 287 places, 292 transitions, 592 flow. Second operand 3 states and 934 transitions. [2023-11-26 11:58:37,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 291 transitions, 614 flow [2023-11-26 11:58:37,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 291 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:37,126 INFO L231 Difference]: Finished difference. Result has 286 places, 291 transitions, 590 flow [2023-11-26 11:58:37,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=286, PETRI_TRANSITIONS=291} [2023-11-26 11:58:37,129 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -8 predicate places. [2023-11-26 11:58:37,129 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 291 transitions, 590 flow [2023-11-26 11:58:37,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:37,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:37,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:58:37,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:37,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:37,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1596150994, now seen corresponding path program 1 times [2023-11-26 11:58:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:37,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11034742] [2023-11-26 11:58:37,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:37,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:37,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11034742] [2023-11-26 11:58:37,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11034742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:37,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:37,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:37,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263188673] [2023-11-26 11:58:37,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:37,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:37,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:37,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:37,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:37,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 291 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:37,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:37,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:37,360 INFO L124 PetriNetUnfolderBase]: 22/441 cut-off events. [2023-11-26 11:58:37,360 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2023-11-26 11:58:37,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 441 events. 22/441 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1517 event pairs, 5 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 418. Up to 22 conditions per place. [2023-11-26 11:58:37,366 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 10 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2023-11-26 11:58:37,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 290 transitions, 612 flow [2023-11-26 11:58:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:37,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2023-11-26 11:58:37,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9463019250253293 [2023-11-26 11:58:37,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:37,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,380 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,380 INFO L175 Difference]: Start difference. First operand has 286 places, 291 transitions, 590 flow. Second operand 3 states and 934 transitions. [2023-11-26 11:58:37,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 290 transitions, 612 flow [2023-11-26 11:58:37,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 290 transitions, 608 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:37,388 INFO L231 Difference]: Finished difference. Result has 285 places, 290 transitions, 588 flow [2023-11-26 11:58:37,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=285, PETRI_TRANSITIONS=290} [2023-11-26 11:58:37,389 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -9 predicate places. [2023-11-26 11:58:37,390 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 290 transitions, 588 flow [2023-11-26 11:58:37,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:37,391 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] [2023-11-26 11:58:37,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:58:37,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:37,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:37,392 INFO L85 PathProgramCache]: Analyzing trace with hash -5475858, now seen corresponding path program 1 times [2023-11-26 11:58:37,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:37,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858177484] [2023-11-26 11:58:37,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:37,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:37,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858177484] [2023-11-26 11:58:37,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858177484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:37,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:37,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413550002] [2023-11-26 11:58:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:37,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:37,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:37,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:37,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:37,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 290 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:37,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:37,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:37,602 INFO L124 PetriNetUnfolderBase]: 26/533 cut-off events. [2023-11-26 11:58:37,602 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2023-11-26 11:58:37,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 565 conditions, 533 events. 26/533 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2143 event pairs, 5 based on Foata normal form. 0/449 useless extension candidates. Maximal degree in co-relation 504. Up to 22 conditions per place. [2023-11-26 11:58:37,609 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 10 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2023-11-26 11:58:37,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 289 transitions, 610 flow [2023-11-26 11:58:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:37,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 934 transitions. [2023-11-26 11:58:37,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9463019250253293 [2023-11-26 11:58:37,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:37,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 934 transitions. [2023-11-26 11:58:37,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,624 INFO L175 Difference]: Start difference. First operand has 285 places, 290 transitions, 588 flow. Second operand 3 states and 934 transitions. [2023-11-26 11:58:37,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 289 transitions, 610 flow [2023-11-26 11:58:37,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 289 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:37,632 INFO L231 Difference]: Finished difference. Result has 284 places, 289 transitions, 586 flow [2023-11-26 11:58:37,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=284, PETRI_TRANSITIONS=289} [2023-11-26 11:58:37,634 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -10 predicate places. [2023-11-26 11:58:37,634 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 289 transitions, 586 flow [2023-11-26 11:58:37,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:37,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:37,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:58:37,636 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:37,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash 342716041, now seen corresponding path program 1 times [2023-11-26 11:58:37,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:37,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064885150] [2023-11-26 11:58:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:37,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:37,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064885150] [2023-11-26 11:58:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064885150] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:37,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294411646] [2023-11-26 11:58:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:37,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:37,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:37,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:37,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:37,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 289 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:37,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:37,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:37,878 INFO L124 PetriNetUnfolderBase]: 48/765 cut-off events. [2023-11-26 11:58:37,879 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-26 11:58:37,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 765 events. 48/765 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4094 event pairs, 9 based on Foata normal form. 0/644 useless extension candidates. Maximal degree in co-relation 745. Up to 36 conditions per place. [2023-11-26 11:58:37,887 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 12 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2023-11-26 11:58:37,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 290 transitions, 619 flow [2023-11-26 11:58:37,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:37,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2023-11-26 11:58:37,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9513677811550152 [2023-11-26 11:58:37,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2023-11-26 11:58:37,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2023-11-26 11:58:37,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:37,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2023-11-26 11:58:37,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,899 INFO L175 Difference]: Start difference. First operand has 284 places, 289 transitions, 586 flow. Second operand 3 states and 939 transitions. [2023-11-26 11:58:37,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 290 transitions, 619 flow [2023-11-26 11:58:37,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 290 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:37,907 INFO L231 Difference]: Finished difference. Result has 282 places, 289 transitions, 597 flow [2023-11-26 11:58:37,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=282, PETRI_TRANSITIONS=289} [2023-11-26 11:58:37,909 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -12 predicate places. [2023-11-26 11:58:37,909 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 289 transitions, 597 flow [2023-11-26 11:58:37,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,910 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:37,910 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] [2023-11-26 11:58:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:58:37,911 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:37,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash 717074551, now seen corresponding path program 1 times [2023-11-26 11:58:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:37,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489031310] [2023-11-26 11:58:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:37,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:37,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489031310] [2023-11-26 11:58:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489031310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:37,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:37,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:37,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014628202] [2023-11-26 11:58:37,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:37,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:37,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:37,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:37,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:37,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 289 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:37,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:37,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:37,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:38,154 INFO L124 PetriNetUnfolderBase]: 54/809 cut-off events. [2023-11-26 11:58:38,154 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-26 11:58:38,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 809 events. 54/809 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4570 event pairs, 6 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 723. Up to 36 conditions per place. [2023-11-26 11:58:38,162 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 12 selfloop transitions, 3 changer transitions 0/290 dead transitions. [2023-11-26 11:58:38,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 290 transitions, 630 flow [2023-11-26 11:58:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2023-11-26 11:58:38,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9513677811550152 [2023-11-26 11:58:38,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2023-11-26 11:58:38,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2023-11-26 11:58:38,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:38,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2023-11-26 11:58:38,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,174 INFO L175 Difference]: Start difference. First operand has 282 places, 289 transitions, 597 flow. Second operand 3 states and 939 transitions. [2023-11-26 11:58:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 290 transitions, 630 flow [2023-11-26 11:58:38,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 290 transitions, 630 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:38,182 INFO L231 Difference]: Finished difference. Result has 282 places, 289 transitions, 612 flow [2023-11-26 11:58:38,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=282, PETRI_TRANSITIONS=289} [2023-11-26 11:58:38,183 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -12 predicate places. [2023-11-26 11:58:38,183 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 289 transitions, 612 flow [2023-11-26 11:58:38,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:38,185 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] [2023-11-26 11:58:38,185 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:58:38,185 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:38,185 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:38,186 INFO L85 PathProgramCache]: Analyzing trace with hash -768999534, now seen corresponding path program 1 times [2023-11-26 11:58:38,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:38,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973319743] [2023-11-26 11:58:38,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:38,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:38,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973319743] [2023-11-26 11:58:38,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973319743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:38,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:38,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:38,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130778787] [2023-11-26 11:58:38,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:38,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:38,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:38,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:38,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:38,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 289 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:38,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:38,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:38,446 INFO L124 PetriNetUnfolderBase]: 56/983 cut-off events. [2023-11-26 11:58:38,447 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2023-11-26 11:58:38,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 983 events. 56/983 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6084 event pairs, 4 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 904. Up to 55 conditions per place. [2023-11-26 11:58:38,458 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 14 selfloop transitions, 3 changer transitions 0/292 dead transitions. [2023-11-26 11:58:38,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 292 transitions, 655 flow [2023-11-26 11:58:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2023-11-26 11:58:38,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9533941236068896 [2023-11-26 11:58:38,463 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2023-11-26 11:58:38,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2023-11-26 11:58:38,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:38,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2023-11-26 11:58:38,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,471 INFO L175 Difference]: Start difference. First operand has 282 places, 289 transitions, 612 flow. Second operand 3 states and 941 transitions. [2023-11-26 11:58:38,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 292 transitions, 655 flow [2023-11-26 11:58:38,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 292 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:38,479 INFO L231 Difference]: Finished difference. Result has 282 places, 289 transitions, 627 flow [2023-11-26 11:58:38,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=282, PETRI_TRANSITIONS=289} [2023-11-26 11:58:38,480 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -12 predicate places. [2023-11-26 11:58:38,481 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 289 transitions, 627 flow [2023-11-26 11:58:38,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:38,482 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] [2023-11-26 11:58:38,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:58:38,482 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:38,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1331333269, now seen corresponding path program 1 times [2023-11-26 11:58:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:38,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773971787] [2023-11-26 11:58:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:38,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:38,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:38,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773971787] [2023-11-26 11:58:38,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773971787] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:38,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:38,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:38,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51988757] [2023-11-26 11:58:38,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:38,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:38,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:38,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 329 [2023-11-26 11:58:38,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 289 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:38,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 329 [2023-11-26 11:58:38,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:38,700 INFO L124 PetriNetUnfolderBase]: 42/828 cut-off events. [2023-11-26 11:58:38,701 INFO L125 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2023-11-26 11:58:38,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 828 events. 42/828 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4880 event pairs, 4 based on Foata normal form. 1/733 useless extension candidates. Maximal degree in co-relation 766. Up to 25 conditions per place. [2023-11-26 11:58:38,709 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 10 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2023-11-26 11:58:38,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 289 transitions, 652 flow [2023-11-26 11:58:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2023-11-26 11:58:38,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2023-11-26 11:58:38,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2023-11-26 11:58:38,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2023-11-26 11:58:38,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:38,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2023-11-26 11:58:38,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,721 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,722 INFO L175 Difference]: Start difference. First operand has 282 places, 289 transitions, 627 flow. Second operand 3 states and 940 transitions. [2023-11-26 11:58:38,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 289 transitions, 652 flow [2023-11-26 11:58:38,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 289 transitions, 652 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:38,730 INFO L231 Difference]: Finished difference. Result has 283 places, 288 transitions, 629 flow [2023-11-26 11:58:38,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=283, PETRI_TRANSITIONS=288} [2023-11-26 11:58:38,732 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -11 predicate places. [2023-11-26 11:58:38,732 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 288 transitions, 629 flow [2023-11-26 11:58:38,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.3333333333333) internal successors, (931), 3 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:38,733 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] [2023-11-26 11:58:38,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:58:38,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:38,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:38,734 INFO L85 PathProgramCache]: Analyzing trace with hash 91218114, now seen corresponding path program 1 times [2023-11-26 11:58:38,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:38,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632135070] [2023-11-26 11:58:38,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:38,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:38,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:38,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632135070] [2023-11-26 11:58:38,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632135070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:38,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:38,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702008404] [2023-11-26 11:58:38,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:38,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:38,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:38,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 288 transitions, 629 flow. Second operand has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:38,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:38,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:38,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:38,982 INFO L124 PetriNetUnfolderBase]: 60/1105 cut-off events. [2023-11-26 11:58:38,982 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2023-11-26 11:58:38,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1237 conditions, 1105 events. 60/1105 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7284 event pairs, 7 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 1063. Up to 47 conditions per place. [2023-11-26 11:58:38,995 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 14 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2023-11-26 11:58:38,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 291 transitions, 672 flow [2023-11-26 11:58:38,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2023-11-26 11:58:38,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9533941236068896 [2023-11-26 11:58:39,000 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2023-11-26 11:58:39,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2023-11-26 11:58:39,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:39,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2023-11-26 11:58:39,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:39,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:39,008 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:39,008 INFO L175 Difference]: Start difference. First operand has 283 places, 288 transitions, 629 flow. Second operand 3 states and 941 transitions. [2023-11-26 11:58:39,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 291 transitions, 672 flow [2023-11-26 11:58:39,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 291 transitions, 668 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:39,017 INFO L231 Difference]: Finished difference. Result has 281 places, 288 transitions, 640 flow [2023-11-26 11:58:39,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=281, PETRI_TRANSITIONS=288} [2023-11-26 11:58:39,018 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -13 predicate places. [2023-11-26 11:58:39,018 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 288 transitions, 640 flow [2023-11-26 11:58:39,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.3333333333333) internal successors, (925), 3 states have internal predecessors, (925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:39,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:39,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:39,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:58:39,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:39,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1126472382, now seen corresponding path program 1 times [2023-11-26 11:58:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:39,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943154961] [2023-11-26 11:58:39,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:39,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:39,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:39,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943154961] [2023-11-26 11:58:39,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943154961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:39,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:39,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:39,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283558285] [2023-11-26 11:58:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:39,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:39,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:39,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:39,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:39,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:39,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 288 transitions, 640 flow. Second operand has 6 states, 6 states have (on average 308.5) internal successors, (1851), 6 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:39,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:39,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:39,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:39,991 INFO L124 PetriNetUnfolderBase]: 35/788 cut-off events. [2023-11-26 11:58:39,991 INFO L125 PetriNetUnfolderBase]: For 6/18 co-relation queries the response was YES. [2023-11-26 11:58:39,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 788 events. 35/788 cut-off events. For 6/18 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4330 event pairs, 0 based on Foata normal form. 8/709 useless extension candidates. Maximal degree in co-relation 702. Up to 17 conditions per place. [2023-11-26 11:58:40,001 INFO L140 encePairwiseOnDemand]: 324/329 looper letters, 7 selfloop transitions, 4 changer transitions 0/287 dead transitions. [2023-11-26 11:58:40,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 287 transitions, 660 flow [2023-11-26 11:58:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:40,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:58:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1854 transitions. [2023-11-26 11:58:40,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.939209726443769 [2023-11-26 11:58:40,007 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1854 transitions. [2023-11-26 11:58:40,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1854 transitions. [2023-11-26 11:58:40,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:40,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1854 transitions. [2023-11-26 11:58:40,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,021 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,021 INFO L175 Difference]: Start difference. First operand has 281 places, 288 transitions, 640 flow. Second operand 6 states and 1854 transitions. [2023-11-26 11:58:40,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 287 transitions, 660 flow [2023-11-26 11:58:40,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 287 transitions, 660 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:40,031 INFO L231 Difference]: Finished difference. Result has 285 places, 287 transitions, 646 flow [2023-11-26 11:58:40,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=285, PETRI_TRANSITIONS=287} [2023-11-26 11:58:40,034 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -9 predicate places. [2023-11-26 11:58:40,034 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 287 transitions, 646 flow [2023-11-26 11:58:40,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.5) internal successors, (1851), 6 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:40,035 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] [2023-11-26 11:58:40,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:58:40,036 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:40,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1205059394, now seen corresponding path program 1 times [2023-11-26 11:58:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351183933] [2023-11-26 11:58:40,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:40,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:40,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:40,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351183933] [2023-11-26 11:58:40,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351183933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:40,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597646497] [2023-11-26 11:58:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:40,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:40,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:40,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 329 [2023-11-26 11:58:40,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 287 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:40,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 329 [2023-11-26 11:58:40,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:40,318 INFO L124 PetriNetUnfolderBase]: 45/1192 cut-off events. [2023-11-26 11:58:40,319 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2023-11-26 11:58:40,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1324 conditions, 1192 events. 45/1192 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7353 event pairs, 2 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1176. Up to 42 conditions per place. [2023-11-26 11:58:40,330 INFO L140 encePairwiseOnDemand]: 325/329 looper letters, 12 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2023-11-26 11:58:40,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 290 transitions, 683 flow [2023-11-26 11:58:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 946 transitions. [2023-11-26 11:58:40,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9584599797365755 [2023-11-26 11:58:40,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 946 transitions. [2023-11-26 11:58:40,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 946 transitions. [2023-11-26 11:58:40,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:40,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 946 transitions. [2023-11-26 11:58:40,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,342 INFO L175 Difference]: Start difference. First operand has 285 places, 287 transitions, 646 flow. Second operand 3 states and 946 transitions. [2023-11-26 11:58:40,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 290 transitions, 683 flow [2023-11-26 11:58:40,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 290 transitions, 676 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:58:40,352 INFO L231 Difference]: Finished difference. Result has 282 places, 287 transitions, 649 flow [2023-11-26 11:58:40,352 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=649, PETRI_PLACES=282, PETRI_TRANSITIONS=287} [2023-11-26 11:58:40,354 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -12 predicate places. [2023-11-26 11:58:40,354 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 287 transitions, 649 flow [2023-11-26 11:58:40,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:40,355 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] [2023-11-26 11:58:40,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:58:40,355 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:40,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1579118145, now seen corresponding path program 1 times [2023-11-26 11:58:40,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:40,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138870710] [2023-11-26 11:58:40,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:40,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:40,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138870710] [2023-11-26 11:58:40,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138870710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:40,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:40,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:40,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066118239] [2023-11-26 11:58:40,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:40,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:40,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:40,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:40,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:40,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 329 [2023-11-26 11:58:40,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 287 transitions, 649 flow. Second operand has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:40,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 329 [2023-11-26 11:58:40,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:40,652 INFO L124 PetriNetUnfolderBase]: 46/1238 cut-off events. [2023-11-26 11:58:40,652 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2023-11-26 11:58:40,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1391 conditions, 1238 events. 46/1238 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7825 event pairs, 4 based on Foata normal form. 0/1131 useless extension candidates. Maximal degree in co-relation 1249. Up to 43 conditions per place. [2023-11-26 11:58:40,663 INFO L140 encePairwiseOnDemand]: 325/329 looper letters, 12 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2023-11-26 11:58:40,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 290 transitions, 686 flow [2023-11-26 11:58:40,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:40,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:40,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 946 transitions. [2023-11-26 11:58:40,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9584599797365755 [2023-11-26 11:58:40,668 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 946 transitions. [2023-11-26 11:58:40,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 946 transitions. [2023-11-26 11:58:40,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:40,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 946 transitions. [2023-11-26 11:58:40,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,676 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,676 INFO L175 Difference]: Start difference. First operand has 282 places, 287 transitions, 649 flow. Second operand 3 states and 946 transitions. [2023-11-26 11:58:40,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 290 transitions, 686 flow [2023-11-26 11:58:40,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 290 transitions, 686 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:40,684 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 659 flow [2023-11-26 11:58:40,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=283, PETRI_TRANSITIONS=287} [2023-11-26 11:58:40,686 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -11 predicate places. [2023-11-26 11:58:40,686 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 659 flow [2023-11-26 11:58:40,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 311.3333333333333) internal successors, (934), 3 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:40,687 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] [2023-11-26 11:58:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:58:40,688 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:40,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash -641760149, now seen corresponding path program 1 times [2023-11-26 11:58:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:40,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930698909] [2023-11-26 11:58:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:40,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:40,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930698909] [2023-11-26 11:58:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930698909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:40,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:40,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229776383] [2023-11-26 11:58:40,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:40,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:40,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:40,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:40,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:40,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 329 [2023-11-26 11:58:40,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 287 transitions, 659 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:40,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 329 [2023-11-26 11:58:40,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:40,926 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][166], [113#L50-40true, Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 386#true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:40,926 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2023-11-26 11:58:40,927 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,927 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,927 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 173#L50-41true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 388#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|)]) [2023-11-26 11:58:40,929 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2023-11-26 11:58:40,930 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,930 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,930 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 55#L50-42true, 388#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|)]) [2023-11-26 11:58:40,932 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2023-11-26 11:58:40,932 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,933 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-26 11:58:40,933 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,936 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([829] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [Black: 381#true, 113#L50-40true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 386#true, 383#(= |#race~filename_4~0| 0), Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:40,936 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,936 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2023-11-26 11:58:40,936 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,937 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,937 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([829] L50-39-->L50-40: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][139], [113#L50-40true, Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 386#true, 383#(= |#race~filename_4~0| 0), Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:40,937 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,937 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2023-11-26 11:58:40,937 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,937 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,938 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-26 11:58:40,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][166], [Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 386#true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 103#L52true, 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:40,945 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2023-11-26 11:58:40,945 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:58:40,945 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-26 11:58:40,946 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-26 11:58:40,950 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][166], [Black: 381#true, 113#L50-40true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 386#true, 383#(= |#race~filename_4~0| 0), Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:40,950 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is not cut-off event [2023-11-26 11:58:40,951 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-26 11:58:40,951 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-26 11:58:40,951 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2023-11-26 11:58:40,951 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is not cut-off event [2023-11-26 11:58:40,951 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 173#L50-41true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 388#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|)]) [2023-11-26 11:58:40,952 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,952 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,952 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-26 11:58:40,952 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:40,952 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:40,953 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][176], [Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 55#L50-42true, 388#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|)]) [2023-11-26 11:58:40,953 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-26 11:58:40,953 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,953 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2023-11-26 11:58:40,954 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-26 11:58:40,954 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-26 11:58:40,959 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][166], [Black: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 386#true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 103#L52true, 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:40,960 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event [2023-11-26 11:58:40,960 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is not cut-off event [2023-11-26 11:58:40,960 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2023-11-26 11:58:40,960 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is not cut-off event [2023-11-26 11:58:40,960 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is not cut-off event [2023-11-26 11:58:40,970 INFO L124 PetriNetUnfolderBase]: 71/1122 cut-off events. [2023-11-26 11:58:40,971 INFO L125 PetriNetUnfolderBase]: For 42/45 co-relation queries the response was YES. [2023-11-26 11:58:40,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1122 events. 71/1122 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6835 event pairs, 6 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1295. Up to 88 conditions per place. [2023-11-26 11:58:40,984 INFO L140 encePairwiseOnDemand]: 326/329 looper letters, 10 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2023-11-26 11:58:40,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 287 transitions, 684 flow [2023-11-26 11:58:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2023-11-26 11:58:40,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2023-11-26 11:58:40,988 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2023-11-26 11:58:40,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2023-11-26 11:58:40,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:40,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2023-11-26 11:58:40,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:40,996 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 659 flow. Second operand 3 states and 940 transitions. [2023-11-26 11:58:40,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 287 transitions, 684 flow [2023-11-26 11:58:40,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 684 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-26 11:58:41,004 INFO L231 Difference]: Finished difference. Result has 284 places, 286 transitions, 661 flow [2023-11-26 11:58:41,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=657, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=661, PETRI_PLACES=284, PETRI_TRANSITIONS=286} [2023-11-26 11:58:41,006 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -10 predicate places. [2023-11-26 11:58:41,006 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 286 transitions, 661 flow [2023-11-26 11:58:41,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:41,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:41,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:41,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:58:41,008 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:41,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1695538774, now seen corresponding path program 1 times [2023-11-26 11:58:41,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:41,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163741966] [2023-11-26 11:58:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:41,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:41,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:41,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163741966] [2023-11-26 11:58:41,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163741966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:41,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:41,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:58:41,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775440728] [2023-11-26 11:58:41,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:41,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:58:41,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:41,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:58:41,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:58:41,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:41,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 286 transitions, 661 flow. Second operand has 6 states, 6 states have (on average 308.6666666666667) internal successors, (1852), 6 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:41,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:41,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:41,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:41,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([896] thread2EXIT-->L69-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][237], [Black: 381#true, 395#(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: 350#true, 378#(= |#race~filename_1~0| 0), Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 386#true, Black: 364#true, 136#L69-7true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:41,946 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-26 11:58:41,946 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 11:58:41,947 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-26 11:58:41,947 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is cut-off event [2023-11-26 11:58:41,953 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([896] thread2EXIT-->L69-7: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_6|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][237], [395#(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: 381#true, Black: 350#true, 378#(= |#race~filename_1~0| 0), Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 386#true, Black: 364#true, 136#L69-7true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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))]) [2023-11-26 11:58:41,953 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is not cut-off event [2023-11-26 11:58:41,953 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is not cut-off event [2023-11-26 11:58:41,953 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is not cut-off event [2023-11-26 11:58:41,954 INFO L297 olderBase$Statistics]: existing Event has 199 ancestors and is not cut-off event [2023-11-26 11:58:41,954 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2023-11-26 11:58:41,960 INFO L124 PetriNetUnfolderBase]: 35/1022 cut-off events. [2023-11-26 11:58:41,960 INFO L125 PetriNetUnfolderBase]: For 5/20 co-relation queries the response was YES. [2023-11-26 11:58:41,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 1022 events. 35/1022 cut-off events. For 5/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 5791 event pairs, 0 based on Foata normal form. 8/959 useless extension candidates. Maximal degree in co-relation 1113. Up to 24 conditions per place. [2023-11-26 11:58:41,972 INFO L140 encePairwiseOnDemand]: 324/329 looper letters, 7 selfloop transitions, 4 changer transitions 0/285 dead transitions. [2023-11-26 11:58:41,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 285 transitions, 681 flow [2023-11-26 11:58:41,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:58:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:58:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1854 transitions. [2023-11-26 11:58:41,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.939209726443769 [2023-11-26 11:58:41,979 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1854 transitions. [2023-11-26 11:58:41,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1854 transitions. [2023-11-26 11:58:41,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:41,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1854 transitions. [2023-11-26 11:58:41,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:41,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:41,992 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 329.0) internal successors, (2303), 7 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:41,992 INFO L175 Difference]: Start difference. First operand has 284 places, 286 transitions, 661 flow. Second operand 6 states and 1854 transitions. [2023-11-26 11:58:41,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 285 transitions, 681 flow [2023-11-26 11:58:41,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 285 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:58:42,000 INFO L231 Difference]: Finished difference. Result has 286 places, 285 transitions, 663 flow [2023-11-26 11:58:42,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=663, PETRI_PLACES=286, PETRI_TRANSITIONS=285} [2023-11-26 11:58:42,002 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -8 predicate places. [2023-11-26 11:58:42,002 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 285 transitions, 663 flow [2023-11-26 11:58:42,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.6666666666667) internal successors, (1852), 6 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:42,003 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] [2023-11-26 11:58:42,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:58:42,004 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:42,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:42,004 INFO L85 PathProgramCache]: Analyzing trace with hash -811611911, now seen corresponding path program 1 times [2023-11-26 11:58:42,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:42,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86608341] [2023-11-26 11:58:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:42,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:42,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86608341] [2023-11-26 11:58:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86608341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:42,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910309030] [2023-11-26 11:58:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:42,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:42,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:42,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 285 transitions, 663 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:42,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:42,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:42,282 INFO L124 PetriNetUnfolderBase]: 43/1181 cut-off events. [2023-11-26 11:58:42,282 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2023-11-26 11:58:42,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1181 events. 43/1181 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7309 event pairs, 3 based on Foata normal form. 0/1107 useless extension candidates. Maximal degree in co-relation 1199. Up to 30 conditions per place. [2023-11-26 11:58:42,294 INFO L140 encePairwiseOnDemand]: 325/329 looper letters, 10 selfloop transitions, 1 changer transitions 0/282 dead transitions. [2023-11-26 11:58:42,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 282 transitions, 679 flow [2023-11-26 11:58:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:42,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2023-11-26 11:58:42,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9473150962512664 [2023-11-26 11:58:42,298 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 935 transitions. [2023-11-26 11:58:42,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 935 transitions. [2023-11-26 11:58:42,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:42,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 935 transitions. [2023-11-26 11:58:42,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 311.6666666666667) internal successors, (935), 3 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,305 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,305 INFO L175 Difference]: Start difference. First operand has 286 places, 285 transitions, 663 flow. Second operand 3 states and 935 transitions. [2023-11-26 11:58:42,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 282 transitions, 679 flow [2023-11-26 11:58:42,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 282 transitions, 672 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:58:42,312 INFO L231 Difference]: Finished difference. Result has 281 places, 282 transitions, 652 flow [2023-11-26 11:58:42,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=281, PETRI_TRANSITIONS=282} [2023-11-26 11:58:42,314 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -13 predicate places. [2023-11-26 11:58:42,314 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 282 transitions, 652 flow [2023-11-26 11:58:42,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:58:42,315 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] [2023-11-26 11:58:42,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:58:42,315 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 48 more)] === [2023-11-26 11:58:42,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:58:42,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1852161685, now seen corresponding path program 1 times [2023-11-26 11:58:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:58:42,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990351068] [2023-11-26 11:58:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:58:42,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:58:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:58:42,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:58:42,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:58:42,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990351068] [2023-11-26 11:58:42,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990351068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:58:42,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:58:42,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:58:42,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341042827] [2023-11-26 11:58:42,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:58:42,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:58:42,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:58:42,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:58:42,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:58:42,408 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 329 [2023-11-26 11:58:42,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 282 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:58:42,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 329 [2023-11-26 11:58:42,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:58:42,562 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][166], [Black: 381#true, Black: 350#true, 397#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 173#L50-41true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 401#true]) [2023-11-26 11:58:42,563 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2023-11-26 11:58:42,563 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:42,563 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:42,563 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:42,567 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([833] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 381#true, Black: 350#true, 397#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 173#L50-41true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 401#true]) [2023-11-26 11:58:42,568 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-26 11:58:42,568 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:42,568 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:42,568 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-26 11:58:42,568 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([833] L50-40-->L50-41: Formula: (= |v_#race~result_7~0_1| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_1|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][144], [Black: 381#true, Black: 350#true, 397#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 173#L50-41true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 401#true]) [2023-11-26 11:58:42,568 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-26 11:58:42,568 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:42,569 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2023-11-26 11:58:42,569 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2023-11-26 11:58:42,569 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-26 11:58:42,581 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([895] thread1EXIT-->L68-7: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem29#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem29#1=|v_ULTIMATE.start_main_#t~mem29#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][166], [Black: 381#true, Black: 350#true, 397#true, 378#(= |#race~filename_1~0| 0), 2#L68-7true, Black: 355#true, 366#(= |#race~filename_5~0| 0), 352#(= |#race~isNull_3~0| 0), 383#(= |#race~filename_4~0| 0), 173#L50-41true, Black: 364#true, 347#(= |#race~isNull_0~0| 0), 357#(= |#race~filename_2~0| 0), Black: 376#true, Black: 345#true, 374#(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)), 401#true]) [2023-11-26 11:58:42,581 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is not cut-off event [2023-11-26 11:58:42,581 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-26 11:58:42,581 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2023-11-26 11:58:42,581 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is not cut-off event [2023-11-26 11:58:42,582 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is not cut-off event [2023-11-26 11:58:42,604 INFO L124 PetriNetUnfolderBase]: 47/1114 cut-off events. [2023-11-26 11:58:42,604 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2023-11-26 11:58:42,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1304 conditions, 1114 events. 47/1114 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6346 event pairs, 3 based on Foata normal form. 3/1053 useless extension candidates. Maximal degree in co-relation 1211. Up to 47 conditions per place. [2023-11-26 11:58:42,619 INFO L140 encePairwiseOnDemand]: 323/329 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2023-11-26 11:58:42,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 281 transitions, 674 flow [2023-11-26 11:58:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:58:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:58:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 936 transitions. [2023-11-26 11:58:42,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9483282674772037 [2023-11-26 11:58:42,623 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 936 transitions. [2023-11-26 11:58:42,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 936 transitions. [2023-11-26 11:58:42,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:58:42,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 936 transitions. [2023-11-26 11:58:42,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 329.0) internal successors, (1316), 4 states have internal predecessors, (1316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,630 INFO L175 Difference]: Start difference. First operand has 281 places, 282 transitions, 652 flow. Second operand 3 states and 936 transitions. [2023-11-26 11:58:42,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 281 transitions, 674 flow [2023-11-26 11:58:42,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 673 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:58:42,636 INFO L231 Difference]: Finished difference. Result has 279 places, 0 transitions, 0 flow [2023-11-26 11:58:42,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=329, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=279, PETRI_TRANSITIONS=0} [2023-11-26 11:58:42,638 INFO L281 CegarLoopForPetriNet]: 294 programPoint places, -15 predicate places. [2023-11-26 11:58:42,639 INFO L495 AbstractCegarLoop]: Abstraction has has 279 places, 0 transitions, 0 flow [2023-11-26 11:58:42,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.3333333333333) internal successors, (928), 3 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:58:42,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (51 of 52 remaining) [2023-11-26 11:58:42,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 52 remaining) [2023-11-26 11:58:42,646 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (49 of 52 remaining) [2023-11-26 11:58:42,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (48 of 52 remaining) [2023-11-26 11:58:42,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 52 remaining) [2023-11-26 11:58:42,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 52 remaining) [2023-11-26 11:58:42,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (45 of 52 remaining) [2023-11-26 11:58:42,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (44 of 52 remaining) [2023-11-26 11:58:42,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (43 of 52 remaining) [2023-11-26 11:58:42,647 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 52 remaining) [2023-11-26 11:58:42,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 52 remaining) [2023-11-26 11:58:42,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 52 remaining) [2023-11-26 11:58:42,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 52 remaining) [2023-11-26 11:58:42,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (38 of 52 remaining) [2023-11-26 11:58:42,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 52 remaining) [2023-11-26 11:58:42,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (36 of 52 remaining) [2023-11-26 11:58:42,648 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (35 of 52 remaining) [2023-11-26 11:58:42,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (34 of 52 remaining) [2023-11-26 11:58:42,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (33 of 52 remaining) [2023-11-26 11:58:42,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (32 of 52 remaining) [2023-11-26 11:58:42,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (31 of 52 remaining) [2023-11-26 11:58:42,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (30 of 52 remaining) [2023-11-26 11:58:42,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (29 of 52 remaining) [2023-11-26 11:58:42,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (28 of 52 remaining) [2023-11-26 11:58:42,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (27 of 52 remaining) [2023-11-26 11:58:42,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 52 remaining) [2023-11-26 11:58:42,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (25 of 52 remaining) [2023-11-26 11:58:42,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (24 of 52 remaining) [2023-11-26 11:58:42,650 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (23 of 52 remaining) [2023-11-26 11:58:42,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (22 of 52 remaining) [2023-11-26 11:58:42,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (21 of 52 remaining) [2023-11-26 11:58:42,651 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (20 of 52 remaining) [2023-11-26 11:58:42,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 52 remaining) [2023-11-26 11:58:42,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 52 remaining) [2023-11-26 11:58:42,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 52 remaining) [2023-11-26 11:58:42,652 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 52 remaining) [2023-11-26 11:58:42,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 52 remaining) [2023-11-26 11:58:42,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 52 remaining) [2023-11-26 11:58:42,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 52 remaining) [2023-11-26 11:58:42,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (12 of 52 remaining) [2023-11-26 11:58:42,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 52 remaining) [2023-11-26 11:58:42,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (10 of 52 remaining) [2023-11-26 11:58:42,653 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (9 of 52 remaining) [2023-11-26 11:58:42,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 52 remaining) [2023-11-26 11:58:42,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 52 remaining) [2023-11-26 11:58:42,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 52 remaining) [2023-11-26 11:58:42,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 52 remaining) [2023-11-26 11:58:42,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (4 of 52 remaining) [2023-11-26 11:58:42,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 52 remaining) [2023-11-26 11:58:42,654 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 52 remaining) [2023-11-26 11:58:42,655 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (1 of 52 remaining) [2023-11-26 11:58:42,655 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (0 of 52 remaining) [2023-11-26 11:58:42,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:58:42,655 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:58:42,663 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:58:42,664 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:58:42,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:58:42 BasicIcfg [2023-11-26 11:58:42,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:58:42,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:58:42,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:58:42,671 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:58:42,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:58:35" (3/4) ... [2023-11-26 11:58:42,673 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-26 11:58:42,678 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2023-11-26 11:58:42,678 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2023-11-26 11:58:42,686 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-26 11:58:42,687 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-26 11:58:42,687 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-26 11:58:42,688 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-26 11:58:42,808 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/witness.graphml [2023-11-26 11:58:42,808 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/witness.yml [2023-11-26 11:58:42,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:58:42,809 INFO L158 Benchmark]: Toolchain (without parser) took 8995.13ms. Allocated memory was 119.5MB in the beginning and 220.2MB in the end (delta: 100.7MB). Free memory was 76.4MB in the beginning and 178.7MB in the end (delta: -102.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:42,809 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 119.5MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:58:42,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.61ms. Allocated memory is still 119.5MB. Free memory was 76.2MB in the beginning and 64.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-26 11:58:42,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.91ms. Allocated memory is still 119.5MB. Free memory was 64.0MB in the beginning and 61.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:58:42,810 INFO L158 Benchmark]: Boogie Preprocessor took 40.18ms. Allocated memory is still 119.5MB. Free memory was 61.6MB in the beginning and 59.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:58:42,810 INFO L158 Benchmark]: RCFGBuilder took 1118.01ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 59.6MB in the beginning and 103.8MB in the end (delta: -44.2MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2023-11-26 11:58:42,811 INFO L158 Benchmark]: TraceAbstraction took 7328.99ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 103.2MB in the beginning and 185.0MB in the end (delta: -81.8MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2023-11-26 11:58:42,811 INFO L158 Benchmark]: Witness Printer took 137.81ms. Allocated memory is still 220.2MB. Free memory was 185.0MB in the beginning and 178.7MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:58:42,815 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.29ms. Allocated memory is still 119.5MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.61ms. Allocated memory is still 119.5MB. Free memory was 76.2MB in the beginning and 64.2MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.91ms. Allocated memory is still 119.5MB. Free memory was 64.0MB in the beginning and 61.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.18ms. Allocated memory is still 119.5MB. Free memory was 61.6MB in the beginning and 59.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1118.01ms. Allocated memory was 119.5MB in the beginning and 151.0MB in the end (delta: 31.5MB). Free memory was 59.6MB in the beginning and 103.8MB in the end (delta: -44.2MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7328.99ms. Allocated memory was 151.0MB in the beginning and 220.2MB in the end (delta: 69.2MB). Free memory was 103.2MB in the beginning and 185.0MB in the end (delta: -81.8MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. * Witness Printer took 137.81ms. Allocated memory is still 220.2MB. Free memory was 185.0MB in the beginning and 178.7MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. 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: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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 5 procedures, 464 locations, 52 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: 7.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 164 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 628 IncrementalHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 118 mSDtfsCounter, 628 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=16, InterpolantAutomatonStates: 60, 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, 1.8s InterpolantComputationTime, 1323 NumberOfCodeBlocks, 1323 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1305 ConstructedInterpolants, 0 QuantifiedInterpolants, 1499 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 32 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-26 11:58:42,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2644999d-e074-468a-9431-5bb7acf7ba90/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE