./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB --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 12fde76b4484c87975ec3c2c6c513458a595d4b258864aadbba7a9ba15d60c4e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:20:48,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:20:48,511 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:20:48,517 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:20:48,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:20:48,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:20:48,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:20:48,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:20:48,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:20:48,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:20:48,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:20:48,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:20:48,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:20:48,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:20:48,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:20:48,564 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:20:48,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:20:48,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:20:48,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:20:48,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:20:48,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:20:48,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:20:48,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:48,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:48,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:48,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:20:48,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:20:48,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:20:48,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:48,568 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:20:48,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:20:48,568 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:20:48,568 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:20:48,568 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:20:48,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:20:48,569 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:20:48,569 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:20:48,569 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:20:48,569 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:20:48,569 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 12fde76b4484c87975ec3c2c6c513458a595d4b258864aadbba7a9ba15d60c4e [2024-11-28 03:20:48,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:20:48,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:20:48,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:20:48,899 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:20:48,900 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:20:48,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i [2024-11-28 03:20:51,736 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/data/2c833c031/6ccf066a7066439b8d8fe1464befa8c0/FLAG1452be6b6 [2024-11-28 03:20:52,170 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:20:52,170 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/sv-benchmarks/c/pthread-race-challenges/per-thread-array-join-counter-race-4.i [2024-11-28 03:20:52,188 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/data/2c833c031/6ccf066a7066439b8d8fe1464befa8c0/FLAG1452be6b6 [2024-11-28 03:20:52,294 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/data/2c833c031/6ccf066a7066439b8d8fe1464befa8c0 [2024-11-28 03:20:52,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:20:52,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:20:52,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:20:52,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:20:52,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:20:52,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:52,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e369d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52, skipping insertion in model container [2024-11-28 03:20:52,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:52,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:20:52,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:20:52,809 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:20:52,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:20:52,973 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:20:52,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52 WrapperNode [2024-11-28 03:20:52,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:20:52,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:20:52,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:20:52,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:20:52,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,011 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,051 INFO L138 Inliner]: procedures = 267, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 262 [2024-11-28 03:20:53,052 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:20:53,052 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:20:53,053 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:20:53,053 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:20:53,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:20:53,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:20:53,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:20:53,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:20:53,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (1/1) ... [2024-11-28 03:20:53,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:20:53,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:20:53,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:20:53,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b844a6c-b40b-4bf3-8944-aebed941edb6/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:20:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 03:20:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-28 03:20:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:20:53,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:20:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-28 03:20:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:20:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:20:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure cleaner [2024-11-28 03:20:53,173 INFO L138 BoogieDeclarations]: Found implementation of procedure cleaner [2024-11-28 03:20:53,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:20:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-28 03:20:53,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-28 03:20:53,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:20:53,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:20:53,176 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:20:53,347 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:20:53,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:20:53,941 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:20:53,941 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:20:54,013 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:20:54,017 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 03:20:54,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:54 BoogieIcfgContainer [2024-11-28 03:20:54,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:20:54,019 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:20:54,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:20:54,027 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:20:54,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:20:52" (1/3) ... [2024-11-28 03:20:54,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278c95f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:54, skipping insertion in model container [2024-11-28 03:20:54,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:20:52" (2/3) ... [2024-11-28 03:20:54,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278c95f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:20:54, skipping insertion in model container [2024-11-28 03:20:54,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:20:54" (3/3) ... [2024-11-28 03:20:54,031 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-join-counter-race-4.i [2024-11-28 03:20:54,052 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:20:54,053 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-join-counter-race-4.i that has 3 procedures, 370 locations, 1 initial locations, 5 loop locations, and 34 error locations. [2024-11-28 03:20:54,054 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:20:54,191 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-28 03:20:54,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 453 transitions, 920 flow [2024-11-28 03:20:54,599 INFO L124 PetriNetUnfolderBase]: 21/569 cut-off events. [2024-11-28 03:20:54,602 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 03:20:54,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 569 events. 21/569 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 874 event pairs, 0 based on Foata normal form. 0/483 useless extension candidates. Maximal degree in co-relation 365. Up to 6 conditions per place. [2024-11-28 03:20:54,620 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 453 transitions, 920 flow [2024-11-28 03:20:54,634 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 380 transitions, 770 flow [2024-11-28 03:20:54,648 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:20:54,659 INFO L333 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, 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;@7eddc017, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:20:54,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 51 error locations. [2024-11-28 03:20:54,692 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:20:54,692 INFO L124 PetriNetUnfolderBase]: 0/139 cut-off events. [2024-11-28 03:20:54,692 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:20:54,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:54,693 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:54,695 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:20:54,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:54,702 INFO L85 PathProgramCache]: Analyzing trace with hash 619922167, now seen corresponding path program 1 times [2024-11-28 03:20:54,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:54,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266952613] [2024-11-28 03:20:54,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:55,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:55,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266952613] [2024-11-28 03:20:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266952613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:55,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:20:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471817178] [2024-11-28 03:20:55,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:55,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:55,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:55,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:55,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:55,338 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 453 [2024-11-28 03:20:55,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:55,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:55,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 453 [2024-11-28 03:20:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:56,299 INFO L124 PetriNetUnfolderBase]: 384/2882 cut-off events. [2024-11-28 03:20:56,300 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-28 03:20:56,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3515 conditions, 2882 events. 384/2882 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20131 event pairs, 264 based on Foata normal form. 97/2500 useless extension candidates. Maximal degree in co-relation 3291. Up to 604 conditions per place. [2024-11-28 03:20:56,340 INFO L140 encePairwiseOnDemand]: 443/453 looper letters, 26 selfloop transitions, 2 changer transitions 1/370 dead transitions. [2024-11-28 03:20:56,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 370 transitions, 806 flow [2024-11-28 03:20:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:20:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1260 transitions. [2024-11-28 03:20:56,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9271523178807947 [2024-11-28 03:20:56,372 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 770 flow. Second operand 3 states and 1260 transitions. [2024-11-28 03:20:56,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 370 transitions, 806 flow [2024-11-28 03:20:56,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 370 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:20:56,392 INFO L231 Difference]: Finished difference. Result has 372 places, 369 transitions, 751 flow [2024-11-28 03:20:56,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=372, PETRI_TRANSITIONS=369} [2024-11-28 03:20:56,400 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -3 predicate places. [2024-11-28 03:20:56,400 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 369 transitions, 751 flow [2024-11-28 03:20:56,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:56,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:56,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:56,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:20:56,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:20:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:56,407 INFO L85 PathProgramCache]: Analyzing trace with hash 613247882, now seen corresponding path program 1 times [2024-11-28 03:20:56,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:56,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114962966] [2024-11-28 03:20:56,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:56,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114962966] [2024-11-28 03:20:56,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114962966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:56,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:56,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:20:56,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422255447] [2024-11-28 03:20:56,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:56,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:56,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:56,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:56,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 453 [2024-11-28 03:20:56,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 369 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:56,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:56,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 453 [2024-11-28 03:20:56,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:57,391 INFO L124 PetriNetUnfolderBase]: 405/2952 cut-off events. [2024-11-28 03:20:57,392 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2024-11-28 03:20:57,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 2952 events. 405/2952 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 20706 event pairs, 305 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 3503. Up to 667 conditions per place. [2024-11-28 03:20:57,418 INFO L140 encePairwiseOnDemand]: 445/453 looper letters, 29 selfloop transitions, 1 changer transitions 0/362 dead transitions. [2024-11-28 03:20:57,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 362 transitions, 797 flow [2024-11-28 03:20:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:57,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:20:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1231 transitions. [2024-11-28 03:20:57,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.905813097866078 [2024-11-28 03:20:57,424 INFO L175 Difference]: Start difference. First operand has 372 places, 369 transitions, 751 flow. Second operand 3 states and 1231 transitions. [2024-11-28 03:20:57,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 362 transitions, 797 flow [2024-11-28 03:20:57,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 362 transitions, 793 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:20:57,436 INFO L231 Difference]: Finished difference. Result has 364 places, 362 transitions, 735 flow [2024-11-28 03:20:57,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=364, PETRI_TRANSITIONS=362} [2024-11-28 03:20:57,437 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2024-11-28 03:20:57,438 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 362 transitions, 735 flow [2024-11-28 03:20:57,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.0) internal successors, (1197), 3 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:57,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:57,439 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:57,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:20:57,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:20:57,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:57,442 INFO L85 PathProgramCache]: Analyzing trace with hash -612422524, now seen corresponding path program 1 times [2024-11-28 03:20:57,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:57,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641280280] [2024-11-28 03:20:57,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:57,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:57,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:57,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641280280] [2024-11-28 03:20:57,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641280280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:57,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:57,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:20:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928233064] [2024-11-28 03:20:57,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:57,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:57,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:57,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:57,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:57,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 453 [2024-11-28 03:20:57,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 362 transitions, 735 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:57,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:57,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 453 [2024-11-28 03:20:57,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:58,311 INFO L124 PetriNetUnfolderBase]: 432/2983 cut-off events. [2024-11-28 03:20:58,311 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-28 03:20:58,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3687 conditions, 2983 events. 432/2983 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 21521 event pairs, 299 based on Foata normal form. 0/2540 useless extension candidates. Maximal degree in co-relation 3538. Up to 673 conditions per place. [2024-11-28 03:20:58,394 INFO L140 encePairwiseOnDemand]: 450/453 looper letters, 22 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-28 03:20:58,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 781 flow [2024-11-28 03:20:58,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:20:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2024-11-28 03:20:58,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927888153053716 [2024-11-28 03:20:58,400 INFO L175 Difference]: Start difference. First operand has 364 places, 362 transitions, 735 flow. Second operand 3 states and 1261 transitions. [2024-11-28 03:20:58,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 781 flow [2024-11-28 03:20:58,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 361 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:20:58,409 INFO L231 Difference]: Finished difference. Result has 364 places, 361 transitions, 736 flow [2024-11-28 03:20:58,410 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=364, PETRI_TRANSITIONS=361} [2024-11-28 03:20:58,410 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -11 predicate places. [2024-11-28 03:20:58,411 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 361 transitions, 736 flow [2024-11-28 03:20:58,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:58,412 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:58,412 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:58,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:20:58,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:20:58,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:58,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2090316711, now seen corresponding path program 1 times [2024-11-28 03:20:58,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:58,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484985658] [2024-11-28 03:20:58,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:58,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:58,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484985658] [2024-11-28 03:20:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484985658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:58,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:58,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:20:58,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137831319] [2024-11-28 03:20:58,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:58,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:58,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:58,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:58,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:58,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 453 [2024-11-28 03:20:58,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 361 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:58,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:58,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 453 [2024-11-28 03:20:58,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:20:59,445 INFO L124 PetriNetUnfolderBase]: 565/3891 cut-off events. [2024-11-28 03:20:59,446 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-28 03:20:59,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4806 conditions, 3891 events. 565/3891 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 30243 event pairs, 413 based on Foata normal form. 0/3330 useless extension candidates. Maximal degree in co-relation 4657. Up to 875 conditions per place. [2024-11-28 03:20:59,479 INFO L140 encePairwiseOnDemand]: 450/453 looper letters, 23 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-28 03:20:59,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 360 transitions, 784 flow [2024-11-28 03:20:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:20:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:20:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2024-11-28 03:20:59,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9242089771891097 [2024-11-28 03:20:59,484 INFO L175 Difference]: Start difference. First operand has 364 places, 361 transitions, 736 flow. Second operand 3 states and 1256 transitions. [2024-11-28 03:20:59,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 360 transitions, 784 flow [2024-11-28 03:20:59,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:20:59,491 INFO L231 Difference]: Finished difference. Result has 363 places, 360 transitions, 734 flow [2024-11-28 03:20:59,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=363, PETRI_TRANSITIONS=360} [2024-11-28 03:20:59,492 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2024-11-28 03:20:59,493 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 360 transitions, 734 flow [2024-11-28 03:20:59,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:59,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:20:59,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:20:59,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:20:59,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:20:59,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:20:59,495 INFO L85 PathProgramCache]: Analyzing trace with hash 162095876, now seen corresponding path program 1 times [2024-11-28 03:20:59,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:20:59,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094406196] [2024-11-28 03:20:59,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:20:59,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:20:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:20:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:20:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:20:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094406196] [2024-11-28 03:20:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094406196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:20:59,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:20:59,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:20:59,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5800999] [2024-11-28 03:20:59,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:20:59,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:20:59,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:20:59,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:20:59,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:20:59,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 453 [2024-11-28 03:20:59,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 360 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:20:59,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:20:59,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 453 [2024-11-28 03:20:59,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:00,507 INFO L124 PetriNetUnfolderBase]: 717/3499 cut-off events. [2024-11-28 03:21:00,507 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-28 03:21:00,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4616 conditions, 3499 events. 717/3499 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 25725 event pairs, 505 based on Foata normal form. 0/2894 useless extension candidates. Maximal degree in co-relation 4467. Up to 1075 conditions per place. [2024-11-28 03:21:00,544 INFO L140 encePairwiseOnDemand]: 450/453 looper letters, 24 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-28 03:21:00,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 359 transitions, 784 flow [2024-11-28 03:21:00,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:00,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:00,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2024-11-28 03:21:00,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9227373068432672 [2024-11-28 03:21:00,548 INFO L175 Difference]: Start difference. First operand has 363 places, 360 transitions, 734 flow. Second operand 3 states and 1254 transitions. [2024-11-28 03:21:00,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 359 transitions, 784 flow [2024-11-28 03:21:00,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 359 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:00,555 INFO L231 Difference]: Finished difference. Result has 362 places, 359 transitions, 732 flow [2024-11-28 03:21:00,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=362, PETRI_TRANSITIONS=359} [2024-11-28 03:21:00,559 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2024-11-28 03:21:00,559 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 359 transitions, 732 flow [2024-11-28 03:21:00,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:00,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:00,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:00,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:21:00,560 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:00,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:00,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1347198662, now seen corresponding path program 1 times [2024-11-28 03:21:00,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:00,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138067651] [2024-11-28 03:21:00,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:00,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138067651] [2024-11-28 03:21:00,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138067651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:00,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:00,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:00,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220729640] [2024-11-28 03:21:00,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:00,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:00,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:00,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:00,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:00,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 453 [2024-11-28 03:21:00,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 359 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:00,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:00,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 453 [2024-11-28 03:21:00,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:01,482 INFO L124 PetriNetUnfolderBase]: 1108/3870 cut-off events. [2024-11-28 03:21:01,482 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-28 03:21:01,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 3870 events. 1108/3870 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 27543 event pairs, 465 based on Foata normal form. 0/3415 useless extension candidates. Maximal degree in co-relation 5432. Up to 1645 conditions per place. [2024-11-28 03:21:01,511 INFO L140 encePairwiseOnDemand]: 445/453 looper letters, 34 selfloop transitions, 3 changer transitions 0/365 dead transitions. [2024-11-28 03:21:01,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 365 transitions, 823 flow [2024-11-28 03:21:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:01,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:01,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2024-11-28 03:21:01,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9161147902869757 [2024-11-28 03:21:01,515 INFO L175 Difference]: Start difference. First operand has 362 places, 359 transitions, 732 flow. Second operand 3 states and 1245 transitions. [2024-11-28 03:21:01,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 365 transitions, 823 flow [2024-11-28 03:21:01,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 365 transitions, 819 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:01,521 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 739 flow [2024-11-28 03:21:01,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=739, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2024-11-28 03:21:01,522 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2024-11-28 03:21:01,522 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 739 flow [2024-11-28 03:21:01,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.0) internal successors, (1206), 3 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:01,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:01,523 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:01,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:21:01,523 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:01,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:01,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1359568308, now seen corresponding path program 1 times [2024-11-28 03:21:01,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:01,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26277884] [2024-11-28 03:21:01,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:01,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:01,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26277884] [2024-11-28 03:21:01,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26277884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:01,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:01,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725309205] [2024-11-28 03:21:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:01,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:01,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:01,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:01,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 453 [2024-11-28 03:21:01,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 739 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:01,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:01,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 453 [2024-11-28 03:21:01,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:02,277 INFO L124 PetriNetUnfolderBase]: 521/3345 cut-off events. [2024-11-28 03:21:02,277 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-28 03:21:02,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4284 conditions, 3345 events. 521/3345 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 25629 event pairs, 334 based on Foata normal form. 0/2966 useless extension candidates. Maximal degree in co-relation 4136. Up to 845 conditions per place. [2024-11-28 03:21:02,298 INFO L140 encePairwiseOnDemand]: 447/453 looper letters, 28 selfloop transitions, 3 changer transitions 0/363 dead transitions. [2024-11-28 03:21:02,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 813 flow [2024-11-28 03:21:02,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1264 transitions. [2024-11-28 03:21:02,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9300956585724798 [2024-11-28 03:21:02,302 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 739 flow. Second operand 3 states and 1264 transitions. [2024-11-28 03:21:02,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 813 flow [2024-11-28 03:21:02,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 363 transitions, 813 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:02,311 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 754 flow [2024-11-28 03:21:02,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2024-11-28 03:21:02,312 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2024-11-28 03:21:02,312 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 754 flow [2024-11-28 03:21:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:02,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:02,313 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:21:02,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash -531331003, now seen corresponding path program 1 times [2024-11-28 03:21:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:02,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771829633] [2024-11-28 03:21:02,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:02,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771829633] [2024-11-28 03:21:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771829633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136250669] [2024-11-28 03:21:02,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:02,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:02,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:02,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:02,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 453 [2024-11-28 03:21:02,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:02,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:02,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 453 [2024-11-28 03:21:02,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:03,648 INFO L124 PetriNetUnfolderBase]: 1096/5873 cut-off events. [2024-11-28 03:21:03,648 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-28 03:21:03,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7870 conditions, 5873 events. 1096/5873 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 49250 event pairs, 390 based on Foata normal form. 0/5134 useless extension candidates. Maximal degree in co-relation 7721. Up to 908 conditions per place. [2024-11-28 03:21:03,693 INFO L140 encePairwiseOnDemand]: 442/453 looper letters, 40 selfloop transitions, 8 changer transitions 0/379 dead transitions. [2024-11-28 03:21:03,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 379 transitions, 900 flow [2024-11-28 03:21:03,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:03,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2024-11-28 03:21:03,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9381898454746137 [2024-11-28 03:21:03,697 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 754 flow. Second operand 3 states and 1275 transitions. [2024-11-28 03:21:03,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 379 transitions, 900 flow [2024-11-28 03:21:03,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 379 transitions, 900 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:03,705 INFO L231 Difference]: Finished difference. Result has 362 places, 365 transitions, 824 flow [2024-11-28 03:21:03,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=824, PETRI_PLACES=362, PETRI_TRANSITIONS=365} [2024-11-28 03:21:03,710 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2024-11-28 03:21:03,711 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 365 transitions, 824 flow [2024-11-28 03:21:03,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:03,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:03,711 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:03,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:21:03,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting cleanerErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 835862099, now seen corresponding path program 1 times [2024-11-28 03:21:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357919708] [2024-11-28 03:21:03,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:03,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:03,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357919708] [2024-11-28 03:21:03,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357919708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:03,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:03,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951559542] [2024-11-28 03:21:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:03,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:03,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:03,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:03,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:03,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 453 [2024-11-28 03:21:03,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 365 transitions, 824 flow. Second operand has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:03,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:03,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 453 [2024-11-28 03:21:03,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:05,971 INFO L124 PetriNetUnfolderBase]: 1951/10352 cut-off events. [2024-11-28 03:21:05,971 INFO L125 PetriNetUnfolderBase]: For 263/304 co-relation queries the response was YES. [2024-11-28 03:21:06,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14152 conditions, 10352 events. 1951/10352 cut-off events. For 263/304 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 99556 event pairs, 1213 based on Foata normal form. 0/9260 useless extension candidates. Maximal degree in co-relation 14001. Up to 2709 conditions per place. [2024-11-28 03:21:06,035 INFO L140 encePairwiseOnDemand]: 446/453 looper letters, 33 selfloop transitions, 3 changer transitions 0/373 dead transitions. [2024-11-28 03:21:06,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 373 transitions, 915 flow [2024-11-28 03:21:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1252 transitions. [2024-11-28 03:21:06,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9212656364974245 [2024-11-28 03:21:06,039 INFO L175 Difference]: Start difference. First operand has 362 places, 365 transitions, 824 flow. Second operand 3 states and 1252 transitions. [2024-11-28 03:21:06,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 373 transitions, 915 flow [2024-11-28 03:21:06,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 373 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:06,047 INFO L231 Difference]: Finished difference. Result has 359 places, 364 transitions, 821 flow [2024-11-28 03:21:06,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=821, PETRI_PLACES=359, PETRI_TRANSITIONS=364} [2024-11-28 03:21:06,049 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2024-11-28 03:21:06,049 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 364 transitions, 821 flow [2024-11-28 03:21:06,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.6666666666667) internal successors, (1217), 3 states have internal predecessors, (1217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:06,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:06,050 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:06,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:21:06,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:06,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:06,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1051684256, now seen corresponding path program 1 times [2024-11-28 03:21:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:06,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555797395] [2024-11-28 03:21:06,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:06,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:06,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:06,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555797395] [2024-11-28 03:21:06,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555797395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:06,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:06,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:06,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885466738] [2024-11-28 03:21:06,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:06,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:06,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:06,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:06,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:06,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 453 [2024-11-28 03:21:06,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 364 transitions, 821 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:06,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:06,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 453 [2024-11-28 03:21:06,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:09,001 INFO L124 PetriNetUnfolderBase]: 3184/14712 cut-off events. [2024-11-28 03:21:09,001 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2024-11-28 03:21:09,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21281 conditions, 14712 events. 3184/14712 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 148593 event pairs, 1587 based on Foata normal form. 0/13207 useless extension candidates. Maximal degree in co-relation 21129. Up to 3612 conditions per place. [2024-11-28 03:21:09,079 INFO L140 encePairwiseOnDemand]: 443/453 looper letters, 41 selfloop transitions, 9 changer transitions 0/385 dead transitions. [2024-11-28 03:21:09,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 385 transitions, 969 flow [2024-11-28 03:21:09,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2024-11-28 03:21:09,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9381898454746137 [2024-11-28 03:21:09,083 INFO L175 Difference]: Start difference. First operand has 359 places, 364 transitions, 821 flow. Second operand 3 states and 1275 transitions. [2024-11-28 03:21:09,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 385 transitions, 969 flow [2024-11-28 03:21:09,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 385 transitions, 969 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:09,095 INFO L231 Difference]: Finished difference. Result has 363 places, 372 transitions, 891 flow [2024-11-28 03:21:09,096 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=363, PETRI_TRANSITIONS=372} [2024-11-28 03:21:09,097 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2024-11-28 03:21:09,097 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 372 transitions, 891 flow [2024-11-28 03:21:09,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:09,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:09,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:09,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:21:09,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:09,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1015166270, now seen corresponding path program 1 times [2024-11-28 03:21:09,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:09,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630181741] [2024-11-28 03:21:09,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:09,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:09,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:09,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630181741] [2024-11-28 03:21:09,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630181741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:09,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:09,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:09,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287841720] [2024-11-28 03:21:09,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:09,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:21:09,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:09,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:21:09,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:21:09,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 453 [2024-11-28 03:21:09,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 372 transitions, 891 flow. Second operand has 5 states, 5 states have (on average 412.8) internal successors, (2064), 5 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:09,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:09,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 453 [2024-11-28 03:21:09,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:11,768 INFO L124 PetriNetUnfolderBase]: 1993/11005 cut-off events. [2024-11-28 03:21:11,769 INFO L125 PetriNetUnfolderBase]: For 436/453 co-relation queries the response was YES. [2024-11-28 03:21:11,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16086 conditions, 11005 events. 1993/11005 cut-off events. For 436/453 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 109972 event pairs, 1301 based on Foata normal form. 4/9862 useless extension candidates. Maximal degree in co-relation 15930. Up to 2295 conditions per place. [2024-11-28 03:21:11,815 INFO L140 encePairwiseOnDemand]: 444/453 looper letters, 34 selfloop transitions, 8 changer transitions 0/386 dead transitions. [2024-11-28 03:21:11,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 386 transitions, 1002 flow [2024-11-28 03:21:11,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:11,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2509 transitions. [2024-11-28 03:21:11,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9231052244297278 [2024-11-28 03:21:11,821 INFO L175 Difference]: Start difference. First operand has 363 places, 372 transitions, 891 flow. Second operand 6 states and 2509 transitions. [2024-11-28 03:21:11,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 386 transitions, 1002 flow [2024-11-28 03:21:11,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 386 transitions, 984 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:11,835 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 918 flow [2024-11-28 03:21:11,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=918, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2024-11-28 03:21:11,836 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -5 predicate places. [2024-11-28 03:21:11,836 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 918 flow [2024-11-28 03:21:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 412.8) internal successors, (2064), 5 states have internal predecessors, (2064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:11,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:11,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:11,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:21:11,838 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:11,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:11,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1591579850, now seen corresponding path program 1 times [2024-11-28 03:21:11,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:11,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511681955] [2024-11-28 03:21:11,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:11,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:12,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:12,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511681955] [2024-11-28 03:21:12,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511681955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:12,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:12,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:12,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513989046] [2024-11-28 03:21:12,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:12,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:12,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:12,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:12,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:12,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 453 [2024-11-28 03:21:12,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 918 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:12,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:12,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 453 [2024-11-28 03:21:12,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:14,872 INFO L124 PetriNetUnfolderBase]: 2846/13861 cut-off events. [2024-11-28 03:21:14,872 INFO L125 PetriNetUnfolderBase]: For 1077/1123 co-relation queries the response was YES. [2024-11-28 03:21:14,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21286 conditions, 13861 events. 2846/13861 cut-off events. For 1077/1123 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 140783 event pairs, 1522 based on Foata normal form. 0/12469 useless extension candidates. Maximal degree in co-relation 21125. Up to 3428 conditions per place. [2024-11-28 03:21:14,948 INFO L140 encePairwiseOnDemand]: 448/453 looper letters, 38 selfloop transitions, 6 changer transitions 0/388 dead transitions. [2024-11-28 03:21:14,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 1041 flow [2024-11-28 03:21:14,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:21:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:21:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1270 transitions. [2024-11-28 03:21:14,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9345106696100074 [2024-11-28 03:21:14,952 INFO L175 Difference]: Start difference. First operand has 370 places, 376 transitions, 918 flow. Second operand 3 states and 1270 transitions. [2024-11-28 03:21:14,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 1041 flow [2024-11-28 03:21:14,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 388 transitions, 1037 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:21:14,964 INFO L231 Difference]: Finished difference. Result has 373 places, 381 transitions, 968 flow [2024-11-28 03:21:14,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=968, PETRI_PLACES=373, PETRI_TRANSITIONS=381} [2024-11-28 03:21:14,965 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -2 predicate places. [2024-11-28 03:21:14,965 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 381 transitions, 968 flow [2024-11-28 03:21:14,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:14,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:14,967 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:14,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:21:14,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:14,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:14,968 INFO L85 PathProgramCache]: Analyzing trace with hash -124836980, now seen corresponding path program 1 times [2024-11-28 03:21:14,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:14,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264223331] [2024-11-28 03:21:14,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:14,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:15,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:21:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264223331] [2024-11-28 03:21:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264223331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096648407] [2024-11-28 03:21:15,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:15,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:21:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:15,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:21:15,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:21:15,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 453 [2024-11-28 03:21:15,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 381 transitions, 968 flow. Second operand has 5 states, 5 states have (on average 413.0) internal successors, (2065), 5 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:15,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:15,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 453 [2024-11-28 03:21:15,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:18,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([954] L1030-2-->L1030-5: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret5_1| 0) (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ v_~datas_mutex~0.offset_22 (* v_threadThread1of1ForFork0_~i~0_13 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{threadThread1of1ForFork0_#t~ret5=|v_threadThread1of1ForFork0_#t~ret5_1|, #pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret5][342], [452#(= |#race~threads_total~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 477#(= |#race~datas~0| 0), 170#ULTIMATE.startFINALtrue, 443#true, 426#L1045-4true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), 216#L1030-5true, Black: 475#true]) [2024-11-28 03:21:18,032 INFO L294 olderBase$Statistics]: this new event has 377 ancestors and is cut-off event [2024-11-28 03:21:18,032 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-28 03:21:18,032 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-28 03:21:18,032 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-11-28 03:21:18,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1035-6-->L1035-7: Formula: (= v_cleanerThread1of1ForFork1_~i~1_31 (+ |v_cleanerThread1of1ForFork1_#t~post15_3| 1)) InVars {cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} OutVars{cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_31, cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} AuxVars[] AssignedVars[cleanerThread1of1ForFork1_~i~1][324], [452#(= |#race~threads_total~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 477#(= |#race~datas~0| 0), 170#ULTIMATE.startFINALtrue, 73#L1035-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), 237#L1029-5true, Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, Black: 470#true, 464#(= |#race~datas_mutex~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true]) [2024-11-28 03:21:18,076 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is cut-off event [2024-11-28 03:21:18,076 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-28 03:21:18,076 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2024-11-28 03:21:18,076 INFO L297 olderBase$Statistics]: existing Event has 292 ancestors and is cut-off event [2024-11-28 03:21:18,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L1035-6-->L1035-7: Formula: (= v_cleanerThread1of1ForFork1_~i~1_31 (+ |v_cleanerThread1of1ForFork1_#t~post15_3| 1)) InVars {cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} OutVars{cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_31, cleanerThread1of1ForFork1_#t~post15=|v_cleanerThread1of1ForFork1_#t~post15_3|} AuxVars[] AssignedVars[cleanerThread1of1ForFork1_~i~1][324], [452#(= |#race~threads_total~0| 0), 477#(= |#race~datas~0| 0), 170#ULTIMATE.startFINALtrue, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 73#L1035-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), 237#L1029-5true, Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, 464#(= |#race~datas_mutex~0| 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true]) [2024-11-28 03:21:18,267 INFO L294 olderBase$Statistics]: this new event has 396 ancestors and is cut-off event [2024-11-28 03:21:18,267 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2024-11-28 03:21:18,267 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2024-11-28 03:21:18,267 INFO L297 olderBase$Statistics]: existing Event has 375 ancestors and is cut-off event [2024-11-28 03:21:18,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([954] L1030-2-->L1030-5: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret5_1| 0) (= |v_#pthreadsMutex_119| (store |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22 (store (select |v_#pthreadsMutex_120| v_~datas_mutex~0.base_22) (+ v_~datas_mutex~0.offset_22 (* v_threadThread1of1ForFork0_~i~0_13 24)) 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_120|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} OutVars{threadThread1of1ForFork0_#t~ret5=|v_threadThread1of1ForFork0_#t~ret5_1|, #pthreadsMutex=|v_#pthreadsMutex_119|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_13, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_22, ~datas_mutex~0.base=v_~datas_mutex~0.base_22} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret5][342], [452#(= |#race~threads_total~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 477#(= |#race~datas~0| 0), 170#ULTIMATE.startFINALtrue, 443#true, 426#L1045-4true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 488#(and (<= ~threads_total~0 0) (= |ULTIMATE.start_main_~i~3#1| 0)), Black: 487#(<= ~threads_total~0 0), Black: 490#(and (= |ULTIMATE.start_main_~i~2#1| 0) (<= ~threads_total~0 0)), Black: 462#true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 500#true, Black: 466#true, 495#true, 445#true, 464#(= |#race~datas_mutex~0| 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), 216#L1030-5true, Black: 475#true]) [2024-11-28 03:21:18,280 INFO L294 olderBase$Statistics]: this new event has 398 ancestors and is cut-off event [2024-11-28 03:21:18,280 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-11-28 03:21:18,280 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-11-28 03:21:18,280 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-11-28 03:21:18,369 INFO L124 PetriNetUnfolderBase]: 3019/15049 cut-off events. [2024-11-28 03:21:18,369 INFO L125 PetriNetUnfolderBase]: For 1417/1515 co-relation queries the response was YES. [2024-11-28 03:21:18,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23109 conditions, 15049 events. 3019/15049 cut-off events. For 1417/1515 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 155543 event pairs, 1729 based on Foata normal form. 7/13509 useless extension candidates. Maximal degree in co-relation 22946. Up to 3630 conditions per place. [2024-11-28 03:21:18,453 INFO L140 encePairwiseOnDemand]: 444/453 looper letters, 25 selfloop transitions, 4 changer transitions 17/393 dead transitions. [2024-11-28 03:21:18,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 393 transitions, 1079 flow [2024-11-28 03:21:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2510 transitions. [2024-11-28 03:21:18,458 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9234731420161884 [2024-11-28 03:21:18,458 INFO L175 Difference]: Start difference. First operand has 373 places, 381 transitions, 968 flow. Second operand 6 states and 2510 transitions. [2024-11-28 03:21:18,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 393 transitions, 1079 flow [2024-11-28 03:21:18,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 393 transitions, 1067 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:21:18,478 INFO L231 Difference]: Finished difference. Result has 378 places, 376 transitions, 943 flow [2024-11-28 03:21:18,480 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=378, PETRI_TRANSITIONS=376} [2024-11-28 03:21:18,482 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 3 predicate places. [2024-11-28 03:21:18,482 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 376 transitions, 943 flow [2024-11-28 03:21:18,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 413.0) internal successors, (2065), 5 states have internal predecessors, (2065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:18,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:18,484 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:18,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:21:18,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1309337041, now seen corresponding path program 1 times [2024-11-28 03:21:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641339459] [2024-11-28 03:21:18,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:21:19,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:19,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641339459] [2024-11-28 03:21:19,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641339459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:19,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:19,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:21:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583352107] [2024-11-28 03:21:19,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:19,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:21:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:19,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:21:19,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:21:19,936 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 453 [2024-11-28 03:21:19,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 376 transitions, 943 flow. Second operand has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:19,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:19,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 453 [2024-11-28 03:21:19,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:24,645 INFO L124 PetriNetUnfolderBase]: 6833/25169 cut-off events. [2024-11-28 03:21:24,646 INFO L125 PetriNetUnfolderBase]: For 4938/5184 co-relation queries the response was YES. [2024-11-28 03:21:24,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43463 conditions, 25169 events. 6833/25169 cut-off events. For 4938/5184 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 272727 event pairs, 3718 based on Foata normal form. 0/22796 useless extension candidates. Maximal degree in co-relation 43296. Up to 8661 conditions per place. [2024-11-28 03:21:24,778 INFO L140 encePairwiseOnDemand]: 439/453 looper letters, 90 selfloop transitions, 46 changer transitions 0/464 dead transitions. [2024-11-28 03:21:24,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 464 transitions, 1505 flow [2024-11-28 03:21:24,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:21:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:21:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2480 transitions. [2024-11-28 03:21:24,782 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9124356144223694 [2024-11-28 03:21:24,782 INFO L175 Difference]: Start difference. First operand has 378 places, 376 transitions, 943 flow. Second operand 6 states and 2480 transitions. [2024-11-28 03:21:24,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 464 transitions, 1505 flow [2024-11-28 03:21:24,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 464 transitions, 1477 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-11-28 03:21:24,808 INFO L231 Difference]: Finished difference. Result has 374 places, 421 transitions, 1282 flow [2024-11-28 03:21:24,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1282, PETRI_PLACES=374, PETRI_TRANSITIONS=421} [2024-11-28 03:21:24,810 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -1 predicate places. [2024-11-28 03:21:24,810 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 421 transitions, 1282 flow [2024-11-28 03:21:24,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:24,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:24,812 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:24,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:21:24,812 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting cleanerErr5ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:24,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:24,813 INFO L85 PathProgramCache]: Analyzing trace with hash 902757755, now seen corresponding path program 1 times [2024-11-28 03:21:24,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:24,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238066735] [2024-11-28 03:21:24,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:25,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:21:25,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:25,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238066735] [2024-11-28 03:21:25,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238066735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:25,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:25,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:21:25,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697581956] [2024-11-28 03:21:25,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:25,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:21:25,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:25,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:21:25,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:21:25,782 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 453 [2024-11-28 03:21:25,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 421 transitions, 1282 flow. Second operand has 7 states, 7 states have (on average 406.0) internal successors, (2842), 7 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:25,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:25,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 453 [2024-11-28 03:21:25,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:31,494 INFO L124 PetriNetUnfolderBase]: 7186/31075 cut-off events. [2024-11-28 03:21:31,494 INFO L125 PetriNetUnfolderBase]: For 5066/5694 co-relation queries the response was YES. [2024-11-28 03:21:31,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53849 conditions, 31075 events. 7186/31075 cut-off events. For 5066/5694 co-relation queries the response was YES. Maximal size of possible extension queue 540. Compared 363868 event pairs, 3250 based on Foata normal form. 172/28194 useless extension candidates. Maximal degree in co-relation 53688. Up to 7704 conditions per place. [2024-11-28 03:21:31,690 INFO L140 encePairwiseOnDemand]: 441/453 looper letters, 58 selfloop transitions, 14 changer transitions 10/466 dead transitions. [2024-11-28 03:21:31,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 466 transitions, 1541 flow [2024-11-28 03:21:31,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:21:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 03:21:31,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 4122 transitions. [2024-11-28 03:21:31,698 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.909933774834437 [2024-11-28 03:21:31,698 INFO L175 Difference]: Start difference. First operand has 374 places, 421 transitions, 1282 flow. Second operand 10 states and 4122 transitions. [2024-11-28 03:21:31,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 466 transitions, 1541 flow [2024-11-28 03:21:31,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 466 transitions, 1509 flow, removed 16 selfloop flow, removed 0 redundant places. [2024-11-28 03:21:31,779 INFO L231 Difference]: Finished difference. Result has 387 places, 428 transitions, 1317 flow [2024-11-28 03:21:31,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1245, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=420, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1317, PETRI_PLACES=387, PETRI_TRANSITIONS=428} [2024-11-28 03:21:31,780 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 12 predicate places. [2024-11-28 03:21:31,780 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 428 transitions, 1317 flow [2024-11-28 03:21:31,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 406.0) internal successors, (2842), 7 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:31,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:31,782 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:31,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:21:31,783 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting cleanerErr3ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:31,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash -701579338, now seen corresponding path program 1 times [2024-11-28 03:21:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843040142] [2024-11-28 03:21:31,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:31,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:31,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:21:32,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:32,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843040142] [2024-11-28 03:21:32,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843040142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:32,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:32,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:21:32,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382511054] [2024-11-28 03:21:32,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:32,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 03:21:32,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:32,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 03:21:32,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-28 03:21:33,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 399 out of 453 [2024-11-28 03:21:33,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 428 transitions, 1317 flow. Second operand has 8 states, 8 states have (on average 400.875) internal successors, (3207), 8 states have internal predecessors, (3207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:33,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:33,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 399 of 453 [2024-11-28 03:21:33,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:36,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([878] L1036-1-->L1036-4: Formula: (let ((.cse0 (select |v_#pthreadsMutex_32| v_~datas_mutex~0.base_10)) (.cse1 (+ v_~datas_mutex~0.offset_10 (* v_cleanerThread1of1ForFork1_~i~1_9 24)))) (and (= (select .cse0 .cse1) 0) (= |v_cleanerThread1of1ForFork1_#t~ret6_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| v_~datas_mutex~0.base_10 (store .cse0 .cse1 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, cleanerThread1of1ForFork1_#t~ret6=|v_cleanerThread1of1ForFork1_#t~ret6_1|, ~datas_mutex~0.offset=v_~datas_mutex~0.offset_10, cleanerThread1of1ForFork1_~i~1=v_cleanerThread1of1ForFork1_~i~1_9, ~datas_mutex~0.base=v_~datas_mutex~0.base_10} AuxVars[] AssignedVars[#pthreadsMutex, cleanerThread1of1ForFork1_#t~ret6][390], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), 170#ULTIMATE.startFINALtrue, Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 290#L1028-1true, Black: 462#true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 445#true, Black: 470#true, 468#(= |#race~tids~0| 0), 541#(not (= ~datas~0.base ~tids~0.base)), Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 364#L1036-4true, 519#true, Black: 495#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,004 INFO L294 olderBase$Statistics]: this new event has 296 ancestors and is cut-off event [2024-11-28 03:21:36,004 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-28 03:21:36,004 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-11-28 03:21:36,005 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-28 03:21:36,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, 69#L1038-4true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 399#L1061-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,027 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2024-11-28 03:21:36,027 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2024-11-28 03:21:36,027 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2024-11-28 03:21:36,027 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2024-11-28 03:21:36,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), 194#L1038-5true, Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 399#L1061-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,050 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2024-11-28 03:21:36,050 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,050 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,050 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,051 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, 69#L1038-4true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 477#(= |#race~datas~0| 0), 399#L1061-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,051 INFO L294 olderBase$Statistics]: this new event has 299 ancestors and is cut-off event [2024-11-28 03:21:36,051 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2024-11-28 03:21:36,051 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2024-11-28 03:21:36,051 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-28 03:21:36,051 INFO L297 olderBase$Statistics]: existing Event has 278 ancestors and is cut-off event [2024-11-28 03:21:36,074 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, 69#L1038-4true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 477#(= |#race~datas~0| 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 5#L1061-8true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,074 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2024-11-28 03:21:36,074 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,074 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-28 03:21:36,074 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 194#L1038-5true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 399#L1061-7true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,075 INFO L294 olderBase$Statistics]: this new event has 300 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L297 olderBase$Statistics]: existing Event has 300 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 194#L1038-5true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), 5#L1061-8true, Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,075 INFO L294 olderBase$Statistics]: this new event has 301 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-28 03:21:36,075 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:21:36,076 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:21:36,097 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, 69#L1038-4true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 328#L1061-9true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,097 INFO L294 olderBase$Statistics]: this new event has 301 ancestors and is cut-off event [2024-11-28 03:21:36,097 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:21:36,097 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-11-28 03:21:36,097 INFO L297 olderBase$Statistics]: existing Event has 280 ancestors and is cut-off event [2024-11-28 03:21:36,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([947] L1029-4-->L1029-5: Formula: (= (store |v_#race_35| v_~datas~0.base_17 (store (select |v_#race_35| v_~datas~0.base_17) (+ v_threadThread1of1ForFork0_~i~0_7 v_~datas~0.offset_17) |v_threadThread1of1ForFork0_#t~nondet4_3|)) |v_#race_34|) InVars {#race=|v_#race_35|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} OutVars{#race=|v_#race_34|, threadThread1of1ForFork0_#t~nondet4=|v_threadThread1of1ForFork0_#t~nondet4_3|, threadThread1of1ForFork0_~i~0=v_threadThread1of1ForFork0_~i~0_7, ~datas~0.base=v_~datas~0.base_17, ~datas~0.offset=v_~datas~0.offset_17} AuxVars[] AssignedVars[#race][366], [452#(= |#race~threads_total~0| 0), Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), 237#L1029-5true, Black: 462#true, 551#(and (not (= ~datas~0.base ~tids~0.base)) (= 1 (select |#valid| ~tids~0.base))), 194#L1038-5true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 445#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 472#(= |#race~threads_alive~0| 0), 468#(= |#race~tids~0| 0), Black: 475#true, 477#(= |#race~datas~0| 0), Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 328#L1061-9true, 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 497#(= (select (select |#race| ~datas~0.base) ~datas~0.offset) 0), 519#true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:36,098 INFO L294 olderBase$Statistics]: this new event has 302 ancestors and is cut-off event [2024-11-28 03:21:36,098 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:21:36,098 INFO L297 olderBase$Statistics]: existing Event has 281 ancestors and is cut-off event [2024-11-28 03:21:36,098 INFO L297 olderBase$Statistics]: existing Event has 302 ancestors and is cut-off event [2024-11-28 03:21:39,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([963] threadEXIT-->L1038-9: Formula: (= v_threadThread1of1ForFork0_thidvar0_6 |v_cleanerThread1of1ForFork1_#t~mem8_8|) InVars {cleanerThread1of1ForFork1_#t~mem8=|v_cleanerThread1of1ForFork1_#t~mem8_8|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_6} OutVars{cleanerThread1of1ForFork1_#t~mem8=|v_cleanerThread1of1ForFork1_#t~mem8_8|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_6} AuxVars[] AssignedVars[][463], [452#(= |#race~threads_total~0| 0), 170#ULTIMATE.startFINALtrue, Black: 511#(= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|), Black: 513#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 512#(and (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 514#(and (= (select (select |#race| ~tids~0.base) (+ 3 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4) 1)) |ULTIMATE.start_main_#t~nondet28#1|) (= (select (select |#race| ~tids~0.base) (+ 2 ~tids~0.offset (* |ULTIMATE.start_main_~i~3#1| 4))) |ULTIMATE.start_main_#t~nondet28#1|)), Black: 462#true, Black: 523#(= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base)), Black: 525#(= |cleanerThread1of1ForFork1_#t~mem7| 0), Black: 466#true, Black: 531#(and (= |cleanerThread1of1ForFork1_#t~mem7| 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| ~datas~0.base))), 444#true, Black: 524#(= (select (select |#memory_int| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), Black: 470#true, 468#(= |#race~tids~0| 0), 541#(not (= ~datas~0.base ~tids~0.base)), Black: 475#true, Black: 481#(= (select (select |#race| ~datas~0.base) (+ ~datas~0.offset cleanerThread1of1ForFork1_~i~1)) 0), 477#(= |#race~datas~0| 0), 443#true, Black: 486#(= |ULTIMATE.start_main_~i~2#1| 0), Black: 495#true, 519#true, 432#L1038-9true, 509#true, 464#(= |#race~datas_mutex~0| 0)]) [2024-11-28 03:21:39,514 INFO L294 olderBase$Statistics]: this new event has 407 ancestors and is cut-off event [2024-11-28 03:21:39,514 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-28 03:21:39,514 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-28 03:21:39,514 INFO L297 olderBase$Statistics]: existing Event has 303 ancestors and is cut-off event [2024-11-28 03:21:39,527 INFO L124 PetriNetUnfolderBase]: 8532/33584 cut-off events. [2024-11-28 03:21:39,527 INFO L125 PetriNetUnfolderBase]: For 15789/17578 co-relation queries the response was YES. [2024-11-28 03:21:39,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66409 conditions, 33584 events. 8532/33584 cut-off events. For 15789/17578 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 386995 event pairs, 2717 based on Foata normal form. 71/30762 useless extension candidates. Maximal degree in co-relation 66242. Up to 6303 conditions per place. [2024-11-28 03:21:39,762 INFO L140 encePairwiseOnDemand]: 440/453 looper letters, 95 selfloop transitions, 48 changer transitions 0/494 dead transitions. [2024-11-28 03:21:39,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 494 transitions, 1911 flow [2024-11-28 03:21:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:21:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 03:21:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4477 transitions. [2024-11-28 03:21:39,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8984547461368654 [2024-11-28 03:21:39,769 INFO L175 Difference]: Start difference. First operand has 387 places, 428 transitions, 1317 flow. Second operand 11 states and 4477 transitions. [2024-11-28 03:21:39,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 494 transitions, 1911 flow [2024-11-28 03:21:39,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 494 transitions, 1903 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:21:39,811 INFO L231 Difference]: Finished difference. Result has 397 places, 451 transitions, 1678 flow [2024-11-28 03:21:39,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1678, PETRI_PLACES=397, PETRI_TRANSITIONS=451} [2024-11-28 03:21:39,812 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 22 predicate places. [2024-11-28 03:21:39,812 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 451 transitions, 1678 flow [2024-11-28 03:21:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 400.875) internal successors, (3207), 8 states have internal predecessors, (3207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:39,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:39,814 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:39,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:21:39,814 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:39,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:39,816 INFO L85 PathProgramCache]: Analyzing trace with hash 653526019, now seen corresponding path program 1 times [2024-11-28 03:21:39,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:39,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377933922] [2024-11-28 03:21:39,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:39,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:41,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:21:41,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:41,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377933922] [2024-11-28 03:21:41,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377933922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:41,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:41,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 03:21:41,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488380516] [2024-11-28 03:21:41,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:41,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 03:21:41,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:41,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 03:21:41,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-28 03:21:42,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 387 out of 453 [2024-11-28 03:21:42,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 451 transitions, 1678 flow. Second operand has 11 states, 11 states have (on average 388.72727272727275) internal successors, (4276), 11 states have internal predecessors, (4276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:42,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:42,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 387 of 453 [2024-11-28 03:21:42,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:21:50,366 INFO L124 PetriNetUnfolderBase]: 11047/39922 cut-off events. [2024-11-28 03:21:50,366 INFO L125 PetriNetUnfolderBase]: For 44621/47809 co-relation queries the response was YES. [2024-11-28 03:21:50,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88711 conditions, 39922 events. 11047/39922 cut-off events. For 44621/47809 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 465815 event pairs, 3781 based on Foata normal form. 575/37382 useless extension candidates. Maximal degree in co-relation 88539. Up to 7835 conditions per place. [2024-11-28 03:21:50,663 INFO L140 encePairwiseOnDemand]: 435/453 looper letters, 164 selfloop transitions, 57 changer transitions 0/554 dead transitions. [2024-11-28 03:21:50,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 554 transitions, 2679 flow [2024-11-28 03:21:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-28 03:21:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-28 03:21:50,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 5168 transitions. [2024-11-28 03:21:50,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8775683477670233 [2024-11-28 03:21:50,671 INFO L175 Difference]: Start difference. First operand has 397 places, 451 transitions, 1678 flow. Second operand 13 states and 5168 transitions. [2024-11-28 03:21:50,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 554 transitions, 2679 flow [2024-11-28 03:21:50,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 554 transitions, 2646 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-28 03:21:50,814 INFO L231 Difference]: Finished difference. Result has 407 places, 476 transitions, 2006 flow [2024-11-28 03:21:50,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=453, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=451, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2006, PETRI_PLACES=407, PETRI_TRANSITIONS=476} [2024-11-28 03:21:50,815 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, 32 predicate places. [2024-11-28 03:21:50,815 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 476 transitions, 2006 flow [2024-11-28 03:21:50,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 388.72727272727275) internal successors, (4276), 11 states have internal predecessors, (4276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:50,817 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:21:50,817 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:21:50,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:21:50,818 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [cleanerErr0ASSERT_VIOLATIONDATA_RACE, cleanerErr1ASSERT_VIOLATIONDATA_RACE, cleanerErr2ASSERT_VIOLATIONDATA_RACE, cleanerErr3ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-28 03:21:50,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:21:50,819 INFO L85 PathProgramCache]: Analyzing trace with hash 354636183, now seen corresponding path program 1 times [2024-11-28 03:21:50,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:21:50,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471241597] [2024-11-28 03:21:50,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:21:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:21:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:21:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-28 03:21:50,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:21:50,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471241597] [2024-11-28 03:21:50,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471241597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:21:50,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:21:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:21:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977551679] [2024-11-28 03:21:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:21:50,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:21:50,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:21:50,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:21:50,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:21:51,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 453 [2024-11-28 03:21:51,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 476 transitions, 2006 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:21:51,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:21:51,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 453 [2024-11-28 03:21:51,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand