./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_18-nested_rc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/09-regions_18-nested_rc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 0a93ea17a7eb1959d7b4006ffd88709d1f0f9bf991a564fd1c5bb23dda0591d4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:29,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:29,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:09:29,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:29,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:29,385 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:29,385 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:29,385 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:29,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:29,388 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:29,388 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:29,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:29,389 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:29,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:29,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:29,389 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:29,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:29,390 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 0a93ea17a7eb1959d7b4006ffd88709d1f0f9bf991a564fd1c5bb23dda0591d4 [2025-04-29 11:09:29,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:29,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:29,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:29,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:29,633 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:29,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_18-nested_rc.c [2025-04-29 11:09:30,926 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b9543fa/08084ad2ca3d4e66a9ca93e62fb40d43/FLAGea50f20b9 [2025-04-29 11:09:31,087 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:31,090 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_18-nested_rc.c [2025-04-29 11:09:31,099 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:31,100 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:31,100 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:31,113 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b9543fa/08084ad2ca3d4e66a9ca93e62fb40d43/FLAGea50f20b9 [2025-04-29 11:09:31,927 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74b9543fa/08084ad2ca3d4e66a9ca93e62fb40d43 [2025-04-29 11:09:31,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:31,930 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:31,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:31,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:31,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:31,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:31" (1/1) ... [2025-04-29 11:09:31,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcd7ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:31, skipping insertion in model container [2025-04-29 11:09:31,935 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:31" (1/1) ... [2025-04-29 11:09:31,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:32,111 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:32,127 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:32,169 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:32,192 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:32,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32 WrapperNode [2025-04-29 11:09:32,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:32,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:32,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:32,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:32,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,246 INFO L138 Inliner]: procedures = 20, calls = 47, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 246 [2025-04-29 11:09:32,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:32,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:32,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:32,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:32,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:32,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:32,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:32,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:32,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (1/1) ... [2025-04-29 11:09:32,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:32,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:32,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:09:32,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:09:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:32,343 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:09:32,432 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:32,433 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:32,848 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:32,849 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:32,872 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:32,872 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:09:32,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:32 BoogieIcfgContainer [2025-04-29 11:09:32,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:32,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:32,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:32,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:32,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:31" (1/3) ... [2025-04-29 11:09:32,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf28ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:32, skipping insertion in model container [2025-04-29 11:09:32,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:32" (2/3) ... [2025-04-29 11:09:32,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cf28ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:32, skipping insertion in model container [2025-04-29 11:09:32,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:32" (3/3) ... [2025-04-29 11:09:32,879 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_18-nested_rc.c [2025-04-29 11:09:32,887 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:32,889 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_18-nested_rc.c that has 2 procedures, 288 locations, 289 edges, 1 initial locations, 1 loop locations, and 18 error locations. [2025-04-29 11:09:32,889 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:32,977 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:09:33,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 290 transitions, 584 flow [2025-04-29 11:09:33,095 INFO L116 PetriNetUnfolderBase]: 3/289 cut-off events. [2025-04-29 11:09:33,096 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:33,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 289 events. 3/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2025-04-29 11:09:33,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 290 transitions, 584 flow [2025-04-29 11:09:33,107 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 289 transitions, 581 flow [2025-04-29 11:09:33,115 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:33,125 INFO L340 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;@51f77d91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:33,125 INFO L341 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-04-29 11:09:33,136 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:33,136 INFO L116 PetriNetUnfolderBase]: 2/61 cut-off events. [2025-04-29 11:09:33,136 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:33,136 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:33,136 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] [2025-04-29 11:09:33,136 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:33,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1654301178, now seen corresponding path program 1 times [2025-04-29 11:09:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:33,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905998575] [2025-04-29 11:09:33,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:33,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:09:33,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:09:33,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:33,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:33,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905998575] [2025-04-29 11:09:33,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905998575] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:33,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424918420] [2025-04-29 11:09:33,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:33,362 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:33,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:33,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:33,401 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 290 [2025-04-29 11:09:33,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 289 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:33,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:33,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 290 [2025-04-29 11:09:33,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:33,514 INFO L116 PetriNetUnfolderBase]: 7/367 cut-off events. [2025-04-29 11:09:33,514 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:33,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 367 events. 7/367 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 402 event pairs, 6 based on Foata normal form. 5/342 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-04-29 11:09:33,518 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 10 selfloop transitions, 2 changer transitions 1/288 dead transitions. [2025-04-29 11:09:33,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 288 transitions, 603 flow [2025-04-29 11:09:33,519 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 846 transitions. [2025-04-29 11:09:33,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9724137931034482 [2025-04-29 11:09:33,534 INFO L175 Difference]: Start difference. First operand has 290 places, 289 transitions, 581 flow. Second operand 3 states and 846 transitions. [2025-04-29 11:09:33,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 288 transitions, 603 flow [2025-04-29 11:09:33,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 288 transitions, 602 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:33,547 INFO L231 Difference]: Finished difference. Result has 292 places, 287 transitions, 586 flow [2025-04-29 11:09:33,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=292, PETRI_TRANSITIONS=287} [2025-04-29 11:09:33,554 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 2 predicate places. [2025-04-29 11:09:33,554 INFO L485 AbstractCegarLoop]: Abstraction has has 292 places, 287 transitions, 586 flow [2025-04-29 11:09:33,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 278.3333333333333) internal successors, (835), 3 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:33,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:33,555 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] [2025-04-29 11:09:33,555 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:33,555 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:33,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:33,556 INFO L85 PathProgramCache]: Analyzing trace with hash 393259866, now seen corresponding path program 1 times [2025-04-29 11:09:33,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:33,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310193070] [2025-04-29 11:09:33,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:33,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:33,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:09:33,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:09:33,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:33,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:33,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:33,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:33,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310193070] [2025-04-29 11:09:33,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310193070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:33,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391291466] [2025-04-29 11:09:33,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:33,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:33,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:33,690 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:33,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:09:33,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:09:33,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:09:33,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:33,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:33,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:09:33,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:33,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:33,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:33,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391291466] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:33,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:33,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:09:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930458210] [2025-04-29 11:09:33,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:33,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:33,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:33,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:33,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:33,888 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 290 [2025-04-29 11:09:33,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 287 transitions, 586 flow. Second operand has 10 states, 10 states have (on average 275.8) internal successors, (2758), 10 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:33,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:33,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 290 [2025-04-29 11:09:33,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:34,012 INFO L116 PetriNetUnfolderBase]: 7/373 cut-off events. [2025-04-29 11:09:34,013 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:34,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 373 events. 7/373 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 395 event pairs, 6 based on Foata normal form. 2/346 useless extension candidates. Maximal degree in co-relation 377. Up to 24 conditions per place. [2025-04-29 11:09:34,015 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 14 selfloop transitions, 9 changer transitions 0/295 dead transitions. [2025-04-29 11:09:34,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 295 transitions, 650 flow [2025-04-29 11:09:34,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2491 transitions. [2025-04-29 11:09:34,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9544061302681992 [2025-04-29 11:09:34,024 INFO L175 Difference]: Start difference. First operand has 292 places, 287 transitions, 586 flow. Second operand 9 states and 2491 transitions. [2025-04-29 11:09:34,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 295 transitions, 650 flow [2025-04-29 11:09:34,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 295 transitions, 648 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:34,031 INFO L231 Difference]: Finished difference. Result has 301 places, 293 transitions, 634 flow [2025-04-29 11:09:34,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=634, PETRI_PLACES=301, PETRI_TRANSITIONS=293} [2025-04-29 11:09:34,032 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 11 predicate places. [2025-04-29 11:09:34,032 INFO L485 AbstractCegarLoop]: Abstraction has has 301 places, 293 transitions, 634 flow [2025-04-29 11:09:34,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 275.8) internal successors, (2758), 10 states have internal predecessors, (2758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:34,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:34,034 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:34,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:09:34,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:34,235 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:34,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:34,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1843283674, now seen corresponding path program 2 times [2025-04-29 11:09:34,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:34,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447190144] [2025-04-29 11:09:34,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:34,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:34,253 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-04-29 11:09:34,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 55 of 70 statements. [2025-04-29 11:09:34,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:34,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:09:34,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:34,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447190144] [2025-04-29 11:09:34,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447190144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:34,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:34,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:34,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054554735] [2025-04-29 11:09:34,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:34,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:34,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:34,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:34,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:35,186 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 290 [2025-04-29 11:09:35,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 293 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:35,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:35,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 290 [2025-04-29 11:09:35,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:35,412 INFO L116 PetriNetUnfolderBase]: 365/1657 cut-off events. [2025-04-29 11:09:35,413 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:09:35,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2499 conditions, 1657 events. 365/1657 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9270 event pairs, 364 based on Foata normal form. 0/1532 useless extension candidates. Maximal degree in co-relation 2428. Up to 800 conditions per place. [2025-04-29 11:09:35,423 INFO L140 encePairwiseOnDemand]: 278/290 looper letters, 71 selfloop transitions, 10 changer transitions 0/291 dead transitions. [2025-04-29 11:09:35,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 291 transitions, 792 flow [2025-04-29 11:09:35,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:35,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-04-29 11:09:35,426 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7545977011494253 [2025-04-29 11:09:35,427 INFO L175 Difference]: Start difference. First operand has 301 places, 293 transitions, 634 flow. Second operand 6 states and 1313 transitions. [2025-04-29 11:09:35,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 291 transitions, 792 flow [2025-04-29 11:09:35,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 291 transitions, 786 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:35,432 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 644 flow [2025-04-29 11:09:35,433 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=644, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2025-04-29 11:09:35,433 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 13 predicate places. [2025-04-29 11:09:35,434 INFO L485 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 644 flow [2025-04-29 11:09:35,434 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:35,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:35,434 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:35,435 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:35,435 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:35,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:35,435 INFO L85 PathProgramCache]: Analyzing trace with hash 449054916, now seen corresponding path program 1 times [2025-04-29 11:09:35,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:35,435 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104672919] [2025-04-29 11:09:35,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:35,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:35,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:09:35,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:09:35,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:35,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:35,567 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:35,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:35,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104672919] [2025-04-29 11:09:35,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104672919] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:35,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601758207] [2025-04-29 11:09:35,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:35,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:35,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:35,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:09:35,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-04-29 11:09:35,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-04-29 11:09:35,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:35,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:35,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:09:35,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:35,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:35,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:35,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601758207] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:35,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:35,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:09:35,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100603694] [2025-04-29 11:09:35,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:35,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:35,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:35,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:35,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:35,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 290 [2025-04-29 11:09:35,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 644 flow. Second operand has 18 states, 18 states have (on average 275.8888888888889) internal successors, (4966), 18 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:35,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:35,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 290 [2025-04-29 11:09:35,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:36,022 INFO L116 PetriNetUnfolderBase]: 7/391 cut-off events. [2025-04-29 11:09:36,023 INFO L117 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-04-29 11:09:36,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 391 events. 7/391 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 394 event pairs, 6 based on Foata normal form. 4/368 useless extension candidates. Maximal degree in co-relation 363. Up to 24 conditions per place. [2025-04-29 11:09:36,024 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 18 selfloop transitions, 21 changer transitions 0/309 dead transitions. [2025-04-29 11:09:36,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 309 transitions, 810 flow [2025-04-29 11:09:36,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:09:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:09:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 5797 transitions. [2025-04-29 11:09:36,035 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.951888341543514 [2025-04-29 11:09:36,035 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 644 flow. Second operand 21 states and 5797 transitions. [2025-04-29 11:09:36,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 309 transitions, 810 flow [2025-04-29 11:09:36,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 309 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:36,042 INFO L231 Difference]: Finished difference. Result has 323 places, 304 transitions, 754 flow [2025-04-29 11:09:36,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=754, PETRI_PLACES=323, PETRI_TRANSITIONS=304} [2025-04-29 11:09:36,044 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 33 predicate places. [2025-04-29 11:09:36,044 INFO L485 AbstractCegarLoop]: Abstraction has has 323 places, 304 transitions, 754 flow [2025-04-29 11:09:36,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 275.8888888888889) internal successors, (4966), 18 states have internal predecessors, (4966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:36,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:36,048 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:36,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:36,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:09:36,254 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:36,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash 915087300, now seen corresponding path program 2 times [2025-04-29 11:09:36,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:36,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268300554] [2025-04-29 11:09:36,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:36,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:36,269 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-04-29 11:09:36,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 63 of 98 statements. [2025-04-29 11:09:36,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:36,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-04-29 11:09:36,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:36,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268300554] [2025-04-29 11:09:36,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268300554] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:36,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:36,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:36,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146922610] [2025-04-29 11:09:36,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:36,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:36,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:36,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:36,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:36,806 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 290 [2025-04-29 11:09:36,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 304 transitions, 754 flow. Second operand has 6 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:36,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:36,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 290 [2025-04-29 11:09:36,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:37,036 INFO L116 PetriNetUnfolderBase]: 365/1675 cut-off events. [2025-04-29 11:09:37,037 INFO L117 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-04-29 11:09:37,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2580 conditions, 1675 events. 365/1675 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9251 event pairs, 364 based on Foata normal form. 0/1552 useless extension candidates. Maximal degree in co-relation 2430. Up to 800 conditions per place. [2025-04-29 11:09:37,043 INFO L140 encePairwiseOnDemand]: 278/290 looper letters, 71 selfloop transitions, 10 changer transitions 0/302 dead transitions. [2025-04-29 11:09:37,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 302 transitions, 912 flow [2025-04-29 11:09:37,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:37,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-04-29 11:09:37,046 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7545977011494253 [2025-04-29 11:09:37,046 INFO L175 Difference]: Start difference. First operand has 323 places, 304 transitions, 754 flow. Second operand 6 states and 1313 transitions. [2025-04-29 11:09:37,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 302 transitions, 912 flow [2025-04-29 11:09:37,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 302 transitions, 888 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:37,051 INFO L231 Difference]: Finished difference. Result has 320 places, 302 transitions, 746 flow [2025-04-29 11:09:37,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=746, PETRI_PLACES=320, PETRI_TRANSITIONS=302} [2025-04-29 11:09:37,052 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 30 predicate places. [2025-04-29 11:09:37,052 INFO L485 AbstractCegarLoop]: Abstraction has has 320 places, 302 transitions, 746 flow [2025-04-29 11:09:37,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.33333333333334) internal successors, (1238), 6 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:37,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:37,053 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:37,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:09:37,053 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:37,054 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:37,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1216755137, now seen corresponding path program 1 times [2025-04-29 11:09:37,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:37,054 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789005523] [2025-04-29 11:09:37,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:37,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:37,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-29 11:09:37,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-29 11:09:37,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:37,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:37,338 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:37,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:37,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789005523] [2025-04-29 11:09:37,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789005523] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:37,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551413692] [2025-04-29 11:09:37,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:37,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:37,340 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:37,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:09:37,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-29 11:09:37,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-29 11:09:37,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:37,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:37,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:09:37,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:37,479 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:37,631 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:37,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551413692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:37,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:37,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:09:37,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202834548] [2025-04-29 11:09:37,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:37,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:37,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:37,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:37,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:37,656 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 274 out of 290 [2025-04-29 11:09:37,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 302 transitions, 746 flow. Second operand has 23 states, 23 states have (on average 276.0) internal successors, (6348), 23 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:37,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:37,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 274 of 290 [2025-04-29 11:09:37,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:37,932 INFO L116 PetriNetUnfolderBase]: 7/404 cut-off events. [2025-04-29 11:09:37,932 INFO L117 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-04-29 11:09:37,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 404 events. 7/404 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 391 event pairs, 6 based on Foata normal form. 3/382 useless extension candidates. Maximal degree in co-relation 368. Up to 24 conditions per place. [2025-04-29 11:09:37,935 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 21 selfloop transitions, 30 changer transitions 0/319 dead transitions. [2025-04-29 11:09:37,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 319 transitions, 970 flow [2025-04-29 11:09:37,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8274 transitions. [2025-04-29 11:09:37,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9510344827586207 [2025-04-29 11:09:37,947 INFO L175 Difference]: Start difference. First operand has 320 places, 302 transitions, 746 flow. Second operand 30 states and 8274 transitions. [2025-04-29 11:09:37,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 319 transitions, 970 flow [2025-04-29 11:09:37,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 319 transitions, 950 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:37,953 INFO L231 Difference]: Finished difference. Result has 348 places, 312 transitions, 878 flow [2025-04-29 11:09:37,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=878, PETRI_PLACES=348, PETRI_TRANSITIONS=312} [2025-04-29 11:09:37,955 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 58 predicate places. [2025-04-29 11:09:37,955 INFO L485 AbstractCegarLoop]: Abstraction has has 348 places, 312 transitions, 878 flow [2025-04-29 11:09:37,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 276.0) internal successors, (6348), 23 states have internal predecessors, (6348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:37,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:37,958 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:37,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:38,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:38,159 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:38,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:38,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1926959507, now seen corresponding path program 2 times [2025-04-29 11:09:38,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:38,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345490935] [2025-04-29 11:09:38,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:38,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:38,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-04-29 11:09:38,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 75 of 125 statements. [2025-04-29 11:09:38,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:38,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:38,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:38,438 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345490935] [2025-04-29 11:09:38,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345490935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:38,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:38,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:38,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230728700] [2025-04-29 11:09:38,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:38,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:38,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:38,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:38,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:38,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 290 [2025-04-29 11:09:38,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 312 transitions, 878 flow. Second operand has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:38,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:38,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 290 [2025-04-29 11:09:38,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:39,155 INFO L116 PetriNetUnfolderBase]: 417/1869 cut-off events. [2025-04-29 11:09:39,155 INFO L117 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-04-29 11:09:39,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2951 conditions, 1869 events. 417/1869 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10712 event pairs, 416 based on Foata normal form. 0/1737 useless extension candidates. Maximal degree in co-relation 2722. Up to 914 conditions per place. [2025-04-29 11:09:39,162 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 81 selfloop transitions, 5 changer transitions 0/311 dead transitions. [2025-04-29 11:09:39,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 311 transitions, 1048 flow [2025-04-29 11:09:39,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:39,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:39,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1293 transitions. [2025-04-29 11:09:39,165 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.743103448275862 [2025-04-29 11:09:39,165 INFO L175 Difference]: Start difference. First operand has 348 places, 312 transitions, 878 flow. Second operand 6 states and 1293 transitions. [2025-04-29 11:09:39,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 311 transitions, 1048 flow [2025-04-29 11:09:39,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 311 transitions, 1002 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:09:39,172 INFO L231 Difference]: Finished difference. Result has 334 places, 311 transitions, 840 flow [2025-04-29 11:09:39,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=840, PETRI_PLACES=334, PETRI_TRANSITIONS=311} [2025-04-29 11:09:39,174 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 44 predicate places. [2025-04-29 11:09:39,174 INFO L485 AbstractCegarLoop]: Abstraction has has 334 places, 311 transitions, 840 flow [2025-04-29 11:09:39,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.83333333333334) internal successors, (1223), 6 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:39,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:39,175 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:39,175 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:09:39,175 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:39,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:39,176 INFO L85 PathProgramCache]: Analyzing trace with hash -327017116, now seen corresponding path program 1 times [2025-04-29 11:09:39,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:39,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966581822] [2025-04-29 11:09:39,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:39,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:39,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-04-29 11:09:39,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-04-29 11:09:39,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:39,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:39,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:39,568 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966581822] [2025-04-29 11:09:39,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966581822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:39,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:39,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:39,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367845167] [2025-04-29 11:09:39,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:39,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:39,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:39,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:40,076 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 290 [2025-04-29 11:09:40,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 311 transitions, 840 flow. Second operand has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:40,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:40,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 290 [2025-04-29 11:09:40,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:40,364 INFO L116 PetriNetUnfolderBase]: 257/1709 cut-off events. [2025-04-29 11:09:40,364 INFO L117 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-04-29 11:09:40,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2439 conditions, 1709 events. 257/1709 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10074 event pairs, 36 based on Foata normal form. 0/1580 useless extension candidates. Maximal degree in co-relation 2231. Up to 436 conditions per place. [2025-04-29 11:09:40,371 INFO L140 encePairwiseOnDemand]: 261/290 looper letters, 68 selfloop transitions, 75 changer transitions 0/388 dead transitions. [2025-04-29 11:09:40,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 388 transitions, 1280 flow [2025-04-29 11:09:40,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1477 transitions. [2025-04-29 11:09:40,376 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8488505747126437 [2025-04-29 11:09:40,376 INFO L175 Difference]: Start difference. First operand has 334 places, 311 transitions, 840 flow. Second operand 6 states and 1477 transitions. [2025-04-29 11:09:40,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 388 transitions, 1280 flow [2025-04-29 11:09:40,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 388 transitions, 1270 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:40,385 INFO L231 Difference]: Finished difference. Result has 338 places, 379 transitions, 1310 flow [2025-04-29 11:09:40,385 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=828, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1310, PETRI_PLACES=338, PETRI_TRANSITIONS=379} [2025-04-29 11:09:40,387 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 48 predicate places. [2025-04-29 11:09:40,387 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 379 transitions, 1310 flow [2025-04-29 11:09:40,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:40,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:40,388 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:40,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:09:40,388 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:40,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash -314957849, now seen corresponding path program 1 times [2025-04-29 11:09:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:40,390 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953944445] [2025-04-29 11:09:40,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:40,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-04-29 11:09:40,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-04-29 11:09:40,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:40,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-04-29 11:09:40,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:40,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953944445] [2025-04-29 11:09:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953944445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:40,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:40,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653093383] [2025-04-29 11:09:40,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:40,765 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:40,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:40,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:41,115 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 290 [2025-04-29 11:09:41,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 379 transitions, 1310 flow. Second operand has 6 states, 6 states have (on average 233.5) internal successors, (1401), 6 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:41,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:41,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 290 [2025-04-29 11:09:41,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:41,337 INFO L116 PetriNetUnfolderBase]: 224/1599 cut-off events. [2025-04-29 11:09:41,337 INFO L117 PetriNetUnfolderBase]: For 477/499 co-relation queries the response was YES. [2025-04-29 11:09:41,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2735 conditions, 1599 events. 224/1599 cut-off events. For 477/499 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8646 event pairs, 53 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 2525. Up to 336 conditions per place. [2025-04-29 11:09:41,345 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 117 selfloop transitions, 5 changer transitions 0/378 dead transitions. [2025-04-29 11:09:41,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 378 transitions, 1552 flow [2025-04-29 11:09:41,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1433 transitions. [2025-04-29 11:09:41,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8235632183908046 [2025-04-29 11:09:41,347 INFO L175 Difference]: Start difference. First operand has 338 places, 379 transitions, 1310 flow. Second operand 6 states and 1433 transitions. [2025-04-29 11:09:41,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 378 transitions, 1552 flow [2025-04-29 11:09:41,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 378 transitions, 1552 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:41,355 INFO L231 Difference]: Finished difference. Result has 342 places, 378 transitions, 1318 flow [2025-04-29 11:09:41,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=342, PETRI_TRANSITIONS=378} [2025-04-29 11:09:41,356 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 52 predicate places. [2025-04-29 11:09:41,356 INFO L485 AbstractCegarLoop]: Abstraction has has 342 places, 378 transitions, 1318 flow [2025-04-29 11:09:41,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.5) internal successors, (1401), 6 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:41,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:41,357 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:41,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:09:41,357 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:41,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:41,358 INFO L85 PathProgramCache]: Analyzing trace with hash 742778122, now seen corresponding path program 1 times [2025-04-29 11:09:41,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:41,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783006522] [2025-04-29 11:09:41,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:41,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:41,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-04-29 11:09:41,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-04-29 11:09:41,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:41,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-04-29 11:09:41,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:41,699 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783006522] [2025-04-29 11:09:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783006522] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:41,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:41,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927161707] [2025-04-29 11:09:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:41,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:41,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:41,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:42,010 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 290 [2025-04-29 11:09:42,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 378 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 209.16666666666666) internal successors, (1255), 6 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:42,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:42,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 290 [2025-04-29 11:09:42,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:42,364 INFO L116 PetriNetUnfolderBase]: 717/2944 cut-off events. [2025-04-29 11:09:42,364 INFO L117 PetriNetUnfolderBase]: For 935/996 co-relation queries the response was YES. [2025-04-29 11:09:42,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5716 conditions, 2944 events. 717/2944 cut-off events. For 935/996 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19970 event pairs, 399 based on Foata normal form. 0/2723 useless extension candidates. Maximal degree in co-relation 5505. Up to 1485 conditions per place. [2025-04-29 11:09:42,377 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 146 selfloop transitions, 5 changer transitions 0/377 dead transitions. [2025-04-29 11:09:42,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 377 transitions, 1618 flow [2025-04-29 11:09:42,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1303 transitions. [2025-04-29 11:09:42,379 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7488505747126437 [2025-04-29 11:09:42,379 INFO L175 Difference]: Start difference. First operand has 342 places, 378 transitions, 1318 flow. Second operand 6 states and 1303 transitions. [2025-04-29 11:09:42,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 377 transitions, 1618 flow [2025-04-29 11:09:42,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 377 transitions, 1608 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:42,386 INFO L231 Difference]: Finished difference. Result has 341 places, 377 transitions, 1316 flow [2025-04-29 11:09:42,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1316, PETRI_PLACES=341, PETRI_TRANSITIONS=377} [2025-04-29 11:09:42,387 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 51 predicate places. [2025-04-29 11:09:42,387 INFO L485 AbstractCegarLoop]: Abstraction has has 341 places, 377 transitions, 1316 flow [2025-04-29 11:09:42,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.16666666666666) internal successors, (1255), 6 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:42,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:42,388 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:42,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:09:42,388 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:42,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:42,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1759716543, now seen corresponding path program 1 times [2025-04-29 11:09:42,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:42,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506948983] [2025-04-29 11:09:42,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:42,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-04-29 11:09:42,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-04-29 11:09:42,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:42,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-04-29 11:09:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:42,732 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506948983] [2025-04-29 11:09:42,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506948983] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:42,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014434604] [2025-04-29 11:09:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:42,733 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:42,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:42,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:42,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:43,011 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 290 [2025-04-29 11:09:43,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 377 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:43,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:43,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 290 [2025-04-29 11:09:43,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:43,368 INFO L116 PetriNetUnfolderBase]: 717/2943 cut-off events. [2025-04-29 11:09:43,368 INFO L117 PetriNetUnfolderBase]: For 937/998 co-relation queries the response was YES. [2025-04-29 11:09:43,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 2943 events. 717/2943 cut-off events. For 937/998 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19964 event pairs, 399 based on Foata normal form. 0/2723 useless extension candidates. Maximal degree in co-relation 5503. Up to 1484 conditions per place. [2025-04-29 11:09:43,384 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 145 selfloop transitions, 5 changer transitions 0/376 dead transitions. [2025-04-29 11:09:43,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 376 transitions, 1614 flow [2025-04-29 11:09:43,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1308 transitions. [2025-04-29 11:09:43,387 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7517241379310344 [2025-04-29 11:09:43,388 INFO L175 Difference]: Start difference. First operand has 341 places, 377 transitions, 1316 flow. Second operand 6 states and 1308 transitions. [2025-04-29 11:09:43,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 376 transitions, 1614 flow [2025-04-29 11:09:43,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 376 transitions, 1604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:43,396 INFO L231 Difference]: Finished difference. Result has 340 places, 376 transitions, 1314 flow [2025-04-29 11:09:43,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=340, PETRI_TRANSITIONS=376} [2025-04-29 11:09:43,397 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 50 predicate places. [2025-04-29 11:09:43,397 INFO L485 AbstractCegarLoop]: Abstraction has has 340 places, 376 transitions, 1314 flow [2025-04-29 11:09:43,398 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 210.66666666666666) internal successors, (1264), 6 states have internal predecessors, (1264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:43,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:43,398 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:43,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:09:43,398 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:43,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:43,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1833269387, now seen corresponding path program 1 times [2025-04-29 11:09:43,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:43,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846649317] [2025-04-29 11:09:43,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:43,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:43,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-04-29 11:09:43,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-04-29 11:09:43,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:43,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-29 11:09:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:43,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846649317] [2025-04-29 11:09:43,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846649317] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:43,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:43,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:43,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573065497] [2025-04-29 11:09:43,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:43,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:43,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:43,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:43,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:44,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 290 [2025-04-29 11:09:44,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 376 transitions, 1314 flow. Second operand has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:44,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:44,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 290 [2025-04-29 11:09:44,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:44,599 INFO L116 PetriNetUnfolderBase]: 545/2515 cut-off events. [2025-04-29 11:09:44,599 INFO L117 PetriNetUnfolderBase]: For 952/1054 co-relation queries the response was YES. [2025-04-29 11:09:44,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 2515 events. 545/2515 cut-off events. For 952/1054 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16128 event pairs, 93 based on Foata normal form. 16/2366 useless extension candidates. Maximal degree in co-relation 4520. Up to 813 conditions per place. [2025-04-29 11:09:44,611 INFO L140 encePairwiseOnDemand]: 267/290 looper letters, 131 selfloop transitions, 130 changer transitions 0/513 dead transitions. [2025-04-29 11:09:44,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 513 transitions, 2486 flow [2025-04-29 11:09:44,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1511 transitions. [2025-04-29 11:09:44,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8683908045977011 [2025-04-29 11:09:44,613 INFO L175 Difference]: Start difference. First operand has 340 places, 376 transitions, 1314 flow. Second operand 6 states and 1511 transitions. [2025-04-29 11:09:44,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 513 transitions, 2486 flow [2025-04-29 11:09:44,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 513 transitions, 2476 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:44,624 INFO L231 Difference]: Finished difference. Result has 345 places, 505 transitions, 2532 flow [2025-04-29 11:09:44,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2532, PETRI_PLACES=345, PETRI_TRANSITIONS=505} [2025-04-29 11:09:44,624 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 55 predicate places. [2025-04-29 11:09:44,624 INFO L485 AbstractCegarLoop]: Abstraction has has 345 places, 505 transitions, 2532 flow [2025-04-29 11:09:44,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.16666666666666) internal successors, (1411), 6 states have internal predecessors, (1411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:44,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:44,625 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:44,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:09:44,625 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:44,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:44,626 INFO L85 PathProgramCache]: Analyzing trace with hash 374945334, now seen corresponding path program 1 times [2025-04-29 11:09:44,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:44,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152088925] [2025-04-29 11:09:44,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:44,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:44,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-04-29 11:09:44,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-04-29 11:09:44,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:44,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-04-29 11:09:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:44,990 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152088925] [2025-04-29 11:09:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152088925] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656030659] [2025-04-29 11:09:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:44,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:44,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:44,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:44,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:45,287 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 290 [2025-04-29 11:09:45,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 505 transitions, 2532 flow. Second operand has 6 states, 6 states have (on average 235.33333333333334) internal successors, (1412), 6 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:45,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:45,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 290 [2025-04-29 11:09:45,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:45,708 INFO L116 PetriNetUnfolderBase]: 821/3281 cut-off events. [2025-04-29 11:09:45,709 INFO L117 PetriNetUnfolderBase]: For 3300/3510 co-relation queries the response was YES. [2025-04-29 11:09:45,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7606 conditions, 3281 events. 821/3281 cut-off events. For 3300/3510 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22405 event pairs, 74 based on Foata normal form. 76/3182 useless extension candidates. Maximal degree in co-relation 7390. Up to 1071 conditions per place. [2025-04-29 11:09:45,723 INFO L140 encePairwiseOnDemand]: 267/290 looper letters, 251 selfloop transitions, 131 changer transitions 5/643 dead transitions. [2025-04-29 11:09:45,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 643 transitions, 4206 flow [2025-04-29 11:09:45,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:45,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1512 transitions. [2025-04-29 11:09:45,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8689655172413793 [2025-04-29 11:09:45,724 INFO L175 Difference]: Start difference. First operand has 345 places, 505 transitions, 2532 flow. Second operand 6 states and 1512 transitions. [2025-04-29 11:09:45,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 643 transitions, 4206 flow [2025-04-29 11:09:45,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 643 transitions, 4206 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:45,737 INFO L231 Difference]: Finished difference. Result has 355 places, 633 transitions, 4012 flow [2025-04-29 11:09:45,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=2532, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=505, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4012, PETRI_PLACES=355, PETRI_TRANSITIONS=633} [2025-04-29 11:09:45,738 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 65 predicate places. [2025-04-29 11:09:45,738 INFO L485 AbstractCegarLoop]: Abstraction has has 355 places, 633 transitions, 4012 flow [2025-04-29 11:09:45,739 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 235.33333333333334) internal successors, (1412), 6 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:45,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:45,739 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:45,739 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:09:45,739 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:45,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:45,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1602499889, now seen corresponding path program 1 times [2025-04-29 11:09:45,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:45,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275282341] [2025-04-29 11:09:45,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:45,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:45,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-04-29 11:09:45,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-04-29 11:09:45,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:45,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:46,072 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-04-29 11:09:46,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:46,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275282341] [2025-04-29 11:09:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275282341] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:46,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:46,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:46,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865443525] [2025-04-29 11:09:46,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:46,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:46,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:46,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:46,335 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 290 [2025-04-29 11:09:46,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 633 transitions, 4012 flow. Second operand has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:46,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:46,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 290 [2025-04-29 11:09:46,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:47,050 INFO L116 PetriNetUnfolderBase]: 1308/4610 cut-off events. [2025-04-29 11:09:47,050 INFO L117 PetriNetUnfolderBase]: For 4887/4944 co-relation queries the response was YES. [2025-04-29 11:09:47,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12175 conditions, 4610 events. 1308/4610 cut-off events. For 4887/4944 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33859 event pairs, 369 based on Foata normal form. 11/4376 useless extension candidates. Maximal degree in co-relation 11955. Up to 2225 conditions per place. [2025-04-29 11:09:47,075 INFO L140 encePairwiseOnDemand]: 271/290 looper letters, 316 selfloop transitions, 84 changer transitions 0/712 dead transitions. [2025-04-29 11:09:47,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 712 transitions, 5210 flow [2025-04-29 11:09:47,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:47,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1390 transitions. [2025-04-29 11:09:47,077 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7988505747126436 [2025-04-29 11:09:47,077 INFO L175 Difference]: Start difference. First operand has 355 places, 633 transitions, 4012 flow. Second operand 6 states and 1390 transitions. [2025-04-29 11:09:47,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 712 transitions, 5210 flow [2025-04-29 11:09:47,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 712 transitions, 4956 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:47,097 INFO L231 Difference]: Finished difference. Result has 364 places, 704 transitions, 4548 flow [2025-04-29 11:09:47,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=3764, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4548, PETRI_PLACES=364, PETRI_TRANSITIONS=704} [2025-04-29 11:09:47,098 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 74 predicate places. [2025-04-29 11:09:47,098 INFO L485 AbstractCegarLoop]: Abstraction has has 364 places, 704 transitions, 4548 flow [2025-04-29 11:09:47,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 215.66666666666666) internal successors, (1294), 6 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:47,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:47,099 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:47,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:09:47,099 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:47,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1751333917, now seen corresponding path program 1 times [2025-04-29 11:09:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:47,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793751607] [2025-04-29 11:09:47,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:47,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-29 11:09:47,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:09:47,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:47,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-29 11:09:47,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:47,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793751607] [2025-04-29 11:09:47,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793751607] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:47,771 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477415766] [2025-04-29 11:09:47,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:47,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:47,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:47,773 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:09:47,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-04-29 11:09:47,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:09:47,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:47,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:47,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-29 11:09:47,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:48,345 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:09:48,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:09:48,511 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:09:48,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:09:48,801 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:48,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:09:48,869 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-04-29 11:09:48,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-04-29 11:09:48,932 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:48,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-04-29 11:09:48,974 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:48,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-04-29 11:09:49,016 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:49,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55 [2025-04-29 11:09:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-04-29 11:09:49,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:09:49,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477415766] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:49,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:09:49,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2025-04-29 11:09:49,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36350487] [2025-04-29 11:09:49,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:49,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:09:49,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:49,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:09:49,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2025-04-29 11:09:50,291 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 290 [2025-04-29 11:09:50,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 704 transitions, 4548 flow. Second operand has 11 states, 11 states have (on average 220.63636363636363) internal successors, (2427), 11 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:50,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:50,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 290 [2025-04-29 11:09:50,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:51,134 INFO L116 PetriNetUnfolderBase]: 1021/3887 cut-off events. [2025-04-29 11:09:51,134 INFO L117 PetriNetUnfolderBase]: For 6178/6399 co-relation queries the response was YES. [2025-04-29 11:09:51,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11441 conditions, 3887 events. 1021/3887 cut-off events. For 6178/6399 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 27763 event pairs, 76 based on Foata normal form. 32/3772 useless extension candidates. Maximal degree in co-relation 11213. Up to 892 conditions per place. [2025-04-29 11:09:51,157 INFO L140 encePairwiseOnDemand]: 267/290 looper letters, 401 selfloop transitions, 143 changer transitions 1/829 dead transitions. [2025-04-29 11:09:51,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 829 transitions, 6572 flow [2025-04-29 11:09:51,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:09:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:09:51,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3834 transitions. [2025-04-29 11:09:51,161 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7776876267748478 [2025-04-29 11:09:51,161 INFO L175 Difference]: Start difference. First operand has 364 places, 704 transitions, 4548 flow. Second operand 17 states and 3834 transitions. [2025-04-29 11:09:51,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 829 transitions, 6572 flow [2025-04-29 11:09:51,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 829 transitions, 6500 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:51,191 INFO L231 Difference]: Finished difference. Result has 391 places, 761 transitions, 5494 flow [2025-04-29 11:09:51,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=4494, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5494, PETRI_PLACES=391, PETRI_TRANSITIONS=761} [2025-04-29 11:09:51,192 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 101 predicate places. [2025-04-29 11:09:51,192 INFO L485 AbstractCegarLoop]: Abstraction has has 391 places, 761 transitions, 5494 flow [2025-04-29 11:09:51,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 220.63636363636363) internal successors, (2427), 11 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:51,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:51,193 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:51,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:51,394 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:09:51,394 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:51,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:51,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1838293789, now seen corresponding path program 2 times [2025-04-29 11:09:51,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:51,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947527859] [2025-04-29 11:09:51,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:51,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:51,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 229 statements into 2 equivalence classes. [2025-04-29 11:09:51,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:09:51,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:09:51,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-29 11:09:52,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:52,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947527859] [2025-04-29 11:09:52,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947527859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:52,198 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254827519] [2025-04-29 11:09:52,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:52,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:52,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:52,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:52,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:09:52,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 229 statements into 2 equivalence classes. [2025-04-29 11:09:52,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:09:52,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:09:52,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:52,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-29 11:09:52,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:52,876 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:09:52,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:09:52,961 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:09:52,961 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:09:53,119 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:09:53,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:09:53,161 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:53,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:09:53,198 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:09:53,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:09:53,233 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:09:53,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:09:53,328 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-04-29 11:09:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-04-29 11:09:53,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:09:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254827519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:09:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 19 [2025-04-29 11:09:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902453795] [2025-04-29 11:09:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:09:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:09:53,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2025-04-29 11:09:54,219 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 290 [2025-04-29 11:09:54,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 761 transitions, 5494 flow. Second operand has 11 states, 11 states have (on average 220.63636363636363) internal successors, (2427), 11 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:54,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:54,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 290 [2025-04-29 11:09:54,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:55,229 INFO L116 PetriNetUnfolderBase]: 1463/5615 cut-off events. [2025-04-29 11:09:55,229 INFO L117 PetriNetUnfolderBase]: For 13210/13500 co-relation queries the response was YES. [2025-04-29 11:09:55,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17599 conditions, 5615 events. 1463/5615 cut-off events. For 13210/13500 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 45620 event pairs, 94 based on Foata normal form. 151/5575 useless extension candidates. Maximal degree in co-relation 17357. Up to 1301 conditions per place. [2025-04-29 11:09:55,262 INFO L140 encePairwiseOnDemand]: 256/290 looper letters, 419 selfloop transitions, 261 changer transitions 4/968 dead transitions. [2025-04-29 11:09:55,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 968 transitions, 8690 flow [2025-04-29 11:09:55,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:09:55,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:09:55,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2567 transitions. [2025-04-29 11:09:55,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8047021943573668 [2025-04-29 11:09:55,264 INFO L175 Difference]: Start difference. First operand has 391 places, 761 transitions, 5494 flow. Second operand 11 states and 2567 transitions. [2025-04-29 11:09:55,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 968 transitions, 8690 flow [2025-04-29 11:09:55,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 968 transitions, 8644 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:55,308 INFO L231 Difference]: Finished difference. Result has 402 places, 862 transitions, 7685 flow [2025-04-29 11:09:55,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=5470, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7685, PETRI_PLACES=402, PETRI_TRANSITIONS=862} [2025-04-29 11:09:55,309 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 112 predicate places. [2025-04-29 11:09:55,309 INFO L485 AbstractCegarLoop]: Abstraction has has 402 places, 862 transitions, 7685 flow [2025-04-29 11:09:55,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 220.63636363636363) internal successors, (2427), 11 states have internal predecessors, (2427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:55,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:55,311 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:55,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:55,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-29 11:09:55,511 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:09:55,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:55,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1703230603, now seen corresponding path program 3 times [2025-04-29 11:09:55,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:55,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785105048] [2025-04-29 11:09:55,513 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:55,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:55,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 229 statements into 11 equivalence classes. [2025-04-29 11:09:55,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 194 of 229 statements. [2025-04-29 11:09:55,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:09:55,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:56,135 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-29 11:09:56,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:56,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785105048] [2025-04-29 11:09:56,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785105048] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:56,135 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26612986] [2025-04-29 11:09:56,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:09:56,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:56,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:56,137 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:09:56,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:09:56,290 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 229 statements into 11 equivalence classes. [2025-04-29 11:09:59,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 194 of 229 statements. [2025-04-29 11:09:59,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-29 11:09:59,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:59,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 653 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-29 11:09:59,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:59,713 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:09:59,713 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:09:59,795 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:09:59,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:09:59,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:09:59,947 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:10:00,108 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:10:00,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:10:00,163 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:00,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:10:00,194 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:00,194 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:10:00,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-04-29 11:10:00,268 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-04-29 11:10:00,269 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:10:00,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26612986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:00,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:10:00,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2025-04-29 11:10:00,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727738422] [2025-04-29 11:10:00,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:00,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:10:00,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:00,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:10:00,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-04-29 11:10:01,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 290 [2025-04-29 11:10:01,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 862 transitions, 7685 flow. Second operand has 13 states, 13 states have (on average 214.3846153846154) internal successors, (2787), 13 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:01,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:01,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 290 [2025-04-29 11:10:01,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:03,452 INFO L116 PetriNetUnfolderBase]: 2087/7902 cut-off events. [2025-04-29 11:10:03,452 INFO L117 PetriNetUnfolderBase]: For 26724/27220 co-relation queries the response was YES. [2025-04-29 11:10:03,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26329 conditions, 7902 events. 2087/7902 cut-off events. For 26724/27220 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 70154 event pairs, 146 based on Foata normal form. 286/7922 useless extension candidates. Maximal degree in co-relation 26081. Up to 1683 conditions per place. [2025-04-29 11:10:03,498 INFO L140 encePairwiseOnDemand]: 253/290 looper letters, 553 selfloop transitions, 330 changer transitions 3/1165 dead transitions. [2025-04-29 11:10:03,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1165 transitions, 12558 flow [2025-04-29 11:10:03,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:10:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-29 11:10:03,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4230 transitions. [2025-04-29 11:10:03,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7676950998185118 [2025-04-29 11:10:03,502 INFO L175 Difference]: Start difference. First operand has 402 places, 862 transitions, 7685 flow. Second operand 19 states and 4230 transitions. [2025-04-29 11:10:03,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1165 transitions, 12558 flow [2025-04-29 11:10:03,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 1165 transitions, 12454 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:03,579 INFO L231 Difference]: Finished difference. Result has 429 places, 1012 transitions, 10772 flow [2025-04-29 11:10:03,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=7601, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=862, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10772, PETRI_PLACES=429, PETRI_TRANSITIONS=1012} [2025-04-29 11:10:03,580 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 139 predicate places. [2025-04-29 11:10:03,580 INFO L485 AbstractCegarLoop]: Abstraction has has 429 places, 1012 transitions, 10772 flow [2025-04-29 11:10:03,581 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 214.3846153846154) internal successors, (2787), 13 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:03,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:03,581 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:03,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:10:03,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:10:03,782 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:10:03,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:03,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1940707757, now seen corresponding path program 4 times [2025-04-29 11:10:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:03,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467734999] [2025-04-29 11:10:03,784 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:10:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:03,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 229 statements into 2 equivalence classes. [2025-04-29 11:10:03,857 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:10:03,857 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:10:03,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-29 11:10:04,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:04,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467734999] [2025-04-29 11:10:04,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467734999] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:04,795 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234749949] [2025-04-29 11:10:04,795 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:10:04,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:04,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:04,798 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:10:04,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:10:04,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 229 statements into 2 equivalence classes. [2025-04-29 11:10:06,282 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:10:06,282 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:10:06,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:06,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:10:06,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:10:06,462 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:10:06,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:10:06,527 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:10:06,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:10:06,701 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:10:06,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:10:06,722 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:10:06,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:10:06,814 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:06,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:10:06,847 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:06,847 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:10:06,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-04-29 11:10:06,940 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-04-29 11:10:06,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:10:06,959 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)))) is different from false [2025-04-29 11:10:06,985 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse1 (+ 3 |c_~#c~0.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse1 0)))) (and (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) .cse1) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse2 1)) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse2)) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse2)) 0)))))) is different from false [2025-04-29 11:10:07,155 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#c~0.offset| .cse4 1)) (.cse2 (+ 2 |c_~#c~0.offset| .cse4)) (.cse1 (+ 3 |c_~#c~0.offset| .cse4))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (store (select |c_#race| |c_~#c~0.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2629) |c_~#c~0.base|) .cse1) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2629) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2629) |c_~#c~0.base|) .cse3) 0)) (forall ((v_ArrVal_2629 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2629) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse4)) 0)))))) is different from false [2025-04-29 11:10:07,169 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:07,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 66 [2025-04-29 11:10:07,174 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:07,174 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2025-04-29 11:10:07,179 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:10:07,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-29 11:10:07,184 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:10:07,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-29 11:10:07,188 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:10:07,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-29 11:10:07,661 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 1 not checked. [2025-04-29 11:10:07,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234749949] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:10:07,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:10:07,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 32 [2025-04-29 11:10:07,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917102349] [2025-04-29 11:10:07,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:10:07,662 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 11:10:07,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:07,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 11:10:07,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=696, Unknown=50, NotChecked=174, Total=1056 [2025-04-29 11:10:07,901 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 290 [2025-04-29 11:10:07,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 1012 transitions, 10772 flow. Second operand has 33 states, 33 states have (on average 116.33333333333333) internal successors, (3839), 33 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:07,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:07,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 290 [2025-04-29 11:10:07,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:14,263 INFO L116 PetriNetUnfolderBase]: 8217/21447 cut-off events. [2025-04-29 11:10:14,263 INFO L117 PetriNetUnfolderBase]: For 81841/82201 co-relation queries the response was YES. [2025-04-29 11:10:14,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79055 conditions, 21447 events. 8217/21447 cut-off events. For 81841/82201 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 203878 event pairs, 2200 based on Foata normal form. 229/20779 useless extension candidates. Maximal degree in co-relation 78761. Up to 8397 conditions per place. [2025-04-29 11:10:14,408 INFO L140 encePairwiseOnDemand]: 244/290 looper letters, 910 selfloop transitions, 458 changer transitions 2/1514 dead transitions. [2025-04-29 11:10:14,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 1514 transitions, 18900 flow [2025-04-29 11:10:14,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-29 11:10:14,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-29 11:10:14,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 3694 transitions. [2025-04-29 11:10:14,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41090100111234706 [2025-04-29 11:10:14,411 INFO L175 Difference]: Start difference. First operand has 429 places, 1012 transitions, 10772 flow. Second operand 31 states and 3694 transitions. [2025-04-29 11:10:14,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 1514 transitions, 18900 flow [2025-04-29 11:10:14,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 1514 transitions, 18720 flow, removed 71 selfloop flow, removed 3 redundant places. [2025-04-29 11:10:14,632 INFO L231 Difference]: Finished difference. Result has 467 places, 1197 transitions, 15698 flow [2025-04-29 11:10:14,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=10606, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=15698, PETRI_PLACES=467, PETRI_TRANSITIONS=1197} [2025-04-29 11:10:14,633 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 177 predicate places. [2025-04-29 11:10:14,633 INFO L485 AbstractCegarLoop]: Abstraction has has 467 places, 1197 transitions, 15698 flow [2025-04-29 11:10:14,634 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 116.33333333333333) internal successors, (3839), 33 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:14,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:14,634 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:14,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:10:14,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:14,835 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-04-29 11:10:14,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1420672129, now seen corresponding path program 5 times [2025-04-29 11:10:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:14,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902105873] [2025-04-29 11:10:14,836 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:10:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:14,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 229 statements into 12 equivalence classes. [2025-04-29 11:10:14,894 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:10:14,895 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-04-29 11:10:14,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:15,542 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-04-29 11:10:15,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:15,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902105873] [2025-04-29 11:10:15,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902105873] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:15,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490282384] [2025-04-29 11:10:15,542 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 11:10:15,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:15,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:15,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:10:15,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:10:15,681 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 229 statements into 12 equivalence classes. [2025-04-29 11:10:19,051 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 229 of 229 statements. [2025-04-29 11:10:19,051 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-04-29 11:10:19,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:19,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-29 11:10:19,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:10:19,231 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:10:19,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 11:10:19,304 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:10:19,304 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 11:10:19,457 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:10:19,479 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:10:19,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 11:10:19,512 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-04-29 11:10:19,536 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:19,536 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-04-29 11:10:19,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:19,569 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-04-29 11:10:19,622 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2025-04-29 11:10:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-04-29 11:10:19,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:10:19,655 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)))) is different from false [2025-04-29 11:10:19,676 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)))))))) is different from false [2025-04-29 11:10:19,684 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ 2 |c_~#c~0.offset| .cse2)) (.cse1 (+ 3 |c_~#c~0.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (select |c_#race| |c_~#c~0.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_2956 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse1))) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse2)) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse2 1)) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse3) 0)))))) is different from false [2025-04-29 11:10:19,693 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ |c_~#c~0.offset| .cse4 1)) (.cse3 (+ 2 |c_~#c~0.offset| .cse4)) (.cse1 (+ 3 |c_~#c~0.offset| .cse4))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (store (select |c_#race| |c_~#c~0.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse1) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse3) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse4)) 0)))))) is different from false [2025-04-29 11:10:19,707 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ |c_~#c~0.offset| .cse4 1)) (.cse3 (+ 2 |c_~#c~0.offset| .cse4)) (.cse1 (+ 3 |c_~#c~0.offset| .cse4))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (store (select |c_#race| |c_~#c~0.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse1) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2956) |c_~#c~0.base|) .cse3) 0)) (forall ((v_ArrVal_2956 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc0#1.base| v_ArrVal_2956) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse4)) 0)))))) is different from false [2025-04-29 11:10:19,812 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:19,813 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-04-29 11:10:19,817 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:10:19,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2025-04-29 11:10:19,824 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:10:19,825 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-29 11:10:19,828 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:10:19,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-04-29 11:10:19,832 INFO L325 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-04-29 11:10:19,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-04-29 11:10:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 250 trivial. 1 not checked. [2025-04-29 11:10:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490282384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:10:28,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:10:28,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 28 [2025-04-29 11:10:28,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088083188] [2025-04-29 11:10:28,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:10:28,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-29 11:10:28,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:28,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-29 11:10:28,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=458, Unknown=6, NotChecked=240, Total=812 [2025-04-29 11:10:28,606 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2025-04-29 11:10:28,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 467 places, 1197 transitions, 15698 flow. Second operand has 29 states, 29 states have (on average 133.55172413793105) internal successors, (3873), 29 states have internal predecessors, (3873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:28,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:28,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2025-04-29 11:10:28,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15