./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_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_12-arraycollapse_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 9e4e26886ce6e46608edb906008cd9014525a46a71411e5b4afda7a4d77d247c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:22,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:22,621 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:22,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:22,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:22,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:22,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:22,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:22,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:22,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:22,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:22,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:22,645 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:22,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:22,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:22,645 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:22,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:22,646 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:22,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:22,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:22,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:22,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:22,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:22,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:22,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:22,648 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:22,648 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:22,648 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 -> 9e4e26886ce6e46608edb906008cd9014525a46a71411e5b4afda7a4d77d247c [2025-04-29 11:09:22,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:22,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:22,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:22,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:22,891 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:22,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.c [2025-04-29 11:09:24,167 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e8537e7/994da63e24004c7ea9f7adfce501bac8/FLAGab0117796 [2025-04-29 11:09:24,385 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:24,386 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_12-arraycollapse_rc.c [2025-04-29 11:09:24,387 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:24,387 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:24,387 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:24,396 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e8537e7/994da63e24004c7ea9f7adfce501bac8/FLAGab0117796 [2025-04-29 11:09:25,217 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39e8537e7/994da63e24004c7ea9f7adfce501bac8 [2025-04-29 11:09:25,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:25,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:25,221 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:25,221 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:25,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:25,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:25" (1/1) ... [2025-04-29 11:09:25,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ffd73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:25, skipping insertion in model container [2025-04-29 11:09:25,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:25" (1/1) ... [2025-04-29 11:09:25,235 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:25,414 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:25,427 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:25,476 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:25,492 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:25,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:25 WrapperNode [2025-04-29 11:09:25,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:25,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:25,494 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:25,494 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:25,498 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:25" (1/1) ... [2025-04-29 11:09:25,507 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:25" (1/1) ... [2025-04-29 11:09:25,547 INFO L138 Inliner]: procedures = 20, calls = 54, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 349 [2025-04-29 11:09:25,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:25,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:25,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:25,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:25,553 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:25" (1/1) ... [2025-04-29 11:09:25,553 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:25" (1/1) ... [2025-04-29 11:09:25,560 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:25" (1/1) ... [2025-04-29 11:09:25,560 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:25" (1/1) ... [2025-04-29 11:09:25,586 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:25" (1/1) ... [2025-04-29 11:09:25,593 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:25" (1/1) ... [2025-04-29 11:09:25,598 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:25" (1/1) ... [2025-04-29 11:09:25,600 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:25" (1/1) ... [2025-04-29 11:09:25,601 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:25" (1/1) ... [2025-04-29 11:09:25,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:25,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:25,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:25,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:25,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:25" (1/1) ... [2025-04-29 11:09:25,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:25,639 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:25,644 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:25,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:25,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:09:25,658 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:25,658 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:25,659 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:25,747 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:25,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:26,253 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:26,254 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:26,276 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:26,281 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:09:26,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:26 BoogieIcfgContainer [2025-04-29 11:09:26,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:26,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:26,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:26,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:26,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:25" (1/3) ... [2025-04-29 11:09:26,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16eef859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:26, skipping insertion in model container [2025-04-29 11:09:26,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:25" (2/3) ... [2025-04-29 11:09:26,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16eef859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:26, skipping insertion in model container [2025-04-29 11:09:26,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:26" (3/3) ... [2025-04-29 11:09:26,290 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc.c [2025-04-29 11:09:26,300 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:26,302 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc.c that has 2 procedures, 414 locations, 416 edges, 1 initial locations, 1 loop locations, and 28 error locations. [2025-04-29 11:09:26,303 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:26,406 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:09:26,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 417 places, 417 transitions, 838 flow [2025-04-29 11:09:26,559 INFO L116 PetriNetUnfolderBase]: 4/416 cut-off events. [2025-04-29 11:09:26,561 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:26,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 416 events. 4/416 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 362 event pairs, 0 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 288. Up to 2 conditions per place. [2025-04-29 11:09:26,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 417 places, 417 transitions, 838 flow [2025-04-29 11:09:26,574 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 416 places, 416 transitions, 835 flow [2025-04-29 11:09:26,582 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:26,588 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;@6b6906d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:26,589 INFO L341 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-04-29 11:09:26,596 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:26,596 INFO L116 PetriNetUnfolderBase]: 1/62 cut-off events. [2025-04-29 11:09:26,596 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:26,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:26,597 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] [2025-04-29 11:09:26,597 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:26,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:26,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1371960360, now seen corresponding path program 1 times [2025-04-29 11:09:26,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:26,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472244558] [2025-04-29 11:09:26,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:26,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:09:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:09:26,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:26,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:27,233 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:27,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:27,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472244558] [2025-04-29 11:09:27,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472244558] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:27,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:27,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:27,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653258678] [2025-04-29 11:09:27,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:27,242 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:27,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:27,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:27,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:27,888 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 417 [2025-04-29 11:09:27,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 416 transitions, 835 flow. Second operand has 6 states, 6 states have (on average 289.3333333333333) internal successors, (1736), 6 states have internal predecessors, (1736), 0 states have call successors, (0), 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:27,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:27,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 417 [2025-04-29 11:09:27,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:28,306 INFO L116 PetriNetUnfolderBase]: 365/1772 cut-off events. [2025-04-29 11:09:28,306 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:28,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 1772 events. 365/1772 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9527 event pairs, 364 based on Foata normal form. 13/1648 useless extension candidates. Maximal degree in co-relation 2256. Up to 837 conditions per place. [2025-04-29 11:09:28,315 INFO L140 encePairwiseOnDemand]: 396/417 looper letters, 108 selfloop transitions, 15 changer transitions 2/410 dead transitions. [2025-04-29 11:09:28,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 410 transitions, 1069 flow [2025-04-29 11:09:28,316 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:28,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1857 transitions. [2025-04-29 11:09:28,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7422062350119905 [2025-04-29 11:09:28,336 INFO L175 Difference]: Start difference. First operand has 416 places, 416 transitions, 835 flow. Second operand 6 states and 1857 transitions. [2025-04-29 11:09:28,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 410 transitions, 1069 flow [2025-04-29 11:09:28,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 410 transitions, 1068 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:28,371 INFO L231 Difference]: Finished difference. Result has 417 places, 408 transitions, 848 flow [2025-04-29 11:09:28,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=848, PETRI_PLACES=417, PETRI_TRANSITIONS=408} [2025-04-29 11:09:28,376 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 1 predicate places. [2025-04-29 11:09:28,378 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 408 transitions, 848 flow [2025-04-29 11:09:28,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.3333333333333) internal successors, (1736), 6 states have internal predecessors, (1736), 0 states have call successors, (0), 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:28,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:28,379 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] [2025-04-29 11:09:28,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:28,379 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:28,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash -580611398, now seen corresponding path program 1 times [2025-04-29 11:09:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:28,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912874474] [2025-04-29 11:09:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:28,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:09:28,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:09:28,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:28,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:28,702 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:28,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:28,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912874474] [2025-04-29 11:09:28,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912874474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:28,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:28,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:28,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583589602] [2025-04-29 11:09:28,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:28,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:28,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:28,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:28,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:29,300 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 417 [2025-04-29 11:09:29,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 408 transitions, 848 flow. Second operand has 6 states, 6 states have (on average 289.3333333333333) internal successors, (1736), 6 states have internal predecessors, (1736), 0 states have call successors, (0), 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:29,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:29,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 417 [2025-04-29 11:09:29,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:29,459 INFO L116 PetriNetUnfolderBase]: 365/1767 cut-off events. [2025-04-29 11:09:29,460 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:29,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 1767 events. 365/1767 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9519 event pairs, 364 based on Foata normal form. 0/1635 useless extension candidates. Maximal degree in co-relation 2399. Up to 837 conditions per place. [2025-04-29 11:09:29,466 INFO L140 encePairwiseOnDemand]: 399/417 looper letters, 108 selfloop transitions, 15 changer transitions 0/405 dead transitions. [2025-04-29 11:09:29,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 405 transitions, 1088 flow [2025-04-29 11:09:29,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:29,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1854 transitions. [2025-04-29 11:09:29,470 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7410071942446043 [2025-04-29 11:09:29,470 INFO L175 Difference]: Start difference. First operand has 417 places, 408 transitions, 848 flow. Second operand 6 states and 1854 transitions. [2025-04-29 11:09:29,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 405 transitions, 1088 flow [2025-04-29 11:09:29,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 405 transitions, 1058 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:29,475 INFO L231 Difference]: Finished difference. Result has 412 places, 405 transitions, 842 flow [2025-04-29 11:09:29,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=842, PETRI_PLACES=412, PETRI_TRANSITIONS=405} [2025-04-29 11:09:29,476 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -4 predicate places. [2025-04-29 11:09:29,476 INFO L485 AbstractCegarLoop]: Abstraction has has 412 places, 405 transitions, 842 flow [2025-04-29 11:09:29,477 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.3333333333333) internal successors, (1736), 6 states have internal predecessors, (1736), 0 states have call successors, (0), 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:29,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:29,478 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:29,478 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:09:29,478 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:29,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:29,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1491226032, now seen corresponding path program 1 times [2025-04-29 11:09:29,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:29,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601123073] [2025-04-29 11:09:29,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:29,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:09:29,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:09:29,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:29,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:29,771 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:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:29,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601123073] [2025-04-29 11:09:29,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601123073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:29,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:29,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877232995] [2025-04-29 11:09:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:29,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:29,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:29,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:30,245 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 417 [2025-04-29 11:09:30,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 405 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 288.8333333333333) internal successors, (1733), 6 states have internal predecessors, (1733), 0 states have call successors, (0), 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:30,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:30,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 417 [2025-04-29 11:09:30,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:30,539 INFO L116 PetriNetUnfolderBase]: 391/1855 cut-off events. [2025-04-29 11:09:30,539 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-29 11:09:30,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 1855 events. 391/1855 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10289 event pairs, 390 based on Foata normal form. 0/1718 useless extension candidates. Maximal degree in co-relation 2525. Up to 903 conditions per place. [2025-04-29 11:09:30,547 INFO L140 encePairwiseOnDemand]: 411/417 looper letters, 122 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2025-04-29 11:09:30,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 404 transitions, 1094 flow [2025-04-29 11:09:30,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1844 transitions. [2025-04-29 11:09:30,550 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7370103916866507 [2025-04-29 11:09:30,550 INFO L175 Difference]: Start difference. First operand has 412 places, 405 transitions, 842 flow. Second operand 6 states and 1844 transitions. [2025-04-29 11:09:30,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 404 transitions, 1094 flow [2025-04-29 11:09:30,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 404 transitions, 1064 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:30,557 INFO L231 Difference]: Finished difference. Result has 411 places, 404 transitions, 820 flow [2025-04-29 11:09:30,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=820, PETRI_PLACES=411, PETRI_TRANSITIONS=404} [2025-04-29 11:09:30,559 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -5 predicate places. [2025-04-29 11:09:30,559 INFO L485 AbstractCegarLoop]: Abstraction has has 411 places, 404 transitions, 820 flow [2025-04-29 11:09:30,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 288.8333333333333) internal successors, (1733), 6 states have internal predecessors, (1733), 0 states have call successors, (0), 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:30,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:30,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:30,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:30,561 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:30,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1716370518, now seen corresponding path program 1 times [2025-04-29 11:09:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:30,562 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997410004] [2025-04-29 11:09:30,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:30,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-29 11:09:30,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-29 11:09:30,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:30,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:30,634 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:30,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:30,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997410004] [2025-04-29 11:09:30,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997410004] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:30,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:30,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:30,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529611208] [2025-04-29 11:09:30,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:30,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:30,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:30,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:30,660 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 403 out of 417 [2025-04-29 11:09:30,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 404 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 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:30,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:30,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 403 of 417 [2025-04-29 11:09:30,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:30,710 INFO L116 PetriNetUnfolderBase]: 7/589 cut-off events. [2025-04-29 11:09:30,710 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:30,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 589 events. 7/589 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 628 event pairs, 6 based on Foata normal form. 1/554 useless extension candidates. Maximal degree in co-relation 467. Up to 24 conditions per place. [2025-04-29 11:09:30,712 INFO L140 encePairwiseOnDemand]: 414/417 looper letters, 10 selfloop transitions, 2 changer transitions 0/405 dead transitions. [2025-04-29 11:09:30,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 405 transitions, 846 flow [2025-04-29 11:09:30,713 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:30,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:30,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1222 transitions. [2025-04-29 11:09:30,715 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9768185451638689 [2025-04-29 11:09:30,715 INFO L175 Difference]: Start difference. First operand has 411 places, 404 transitions, 820 flow. Second operand 3 states and 1222 transitions. [2025-04-29 11:09:30,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 405 transitions, 846 flow [2025-04-29 11:09:30,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 405 transitions, 836 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:30,722 INFO L231 Difference]: Finished difference. Result has 409 places, 405 transitions, 822 flow [2025-04-29 11:09:30,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=409, PETRI_TRANSITIONS=405} [2025-04-29 11:09:30,723 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -7 predicate places. [2025-04-29 11:09:30,723 INFO L485 AbstractCegarLoop]: Abstraction has has 409 places, 405 transitions, 822 flow [2025-04-29 11:09:30,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 404.3333333333333) internal successors, (1213), 3 states have internal predecessors, (1213), 0 states have call successors, (0), 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:30,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:30,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:30,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:09:30,724 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:30,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash 954727865, now seen corresponding path program 1 times [2025-04-29 11:09:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:30,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617055356] [2025-04-29 11:09:30,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:30,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-29 11:09:30,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-29 11:09:30,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:30,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:31,178 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:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:31,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617055356] [2025-04-29 11:09:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617055356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:31,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:31,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281982211] [2025-04-29 11:09:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:31,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:31,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:31,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:31,855 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 417 [2025-04-29 11:09:31,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 405 transitions, 822 flow. Second operand has 6 states, 6 states have (on average 332.8333333333333) internal successors, (1997), 6 states have internal predecessors, (1997), 0 states have call successors, (0), 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:31,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:31,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 417 [2025-04-29 11:09:31,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:31,948 INFO L116 PetriNetUnfolderBase]: 55/830 cut-off events. [2025-04-29 11:09:31,948 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-29 11:09:31,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 830 events. 55/830 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2255 event pairs, 54 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 887. Up to 219 conditions per place. [2025-04-29 11:09:31,951 INFO L140 encePairwiseOnDemand]: 411/417 looper letters, 81 selfloop transitions, 5 changer transitions 0/404 dead transitions. [2025-04-29 11:09:31,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 404 transitions, 992 flow [2025-04-29 11:09:31,951 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:31,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2054 transitions. [2025-04-29 11:09:31,955 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.820943245403677 [2025-04-29 11:09:31,955 INFO L175 Difference]: Start difference. First operand has 409 places, 405 transitions, 822 flow. Second operand 6 states and 2054 transitions. [2025-04-29 11:09:31,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 404 transitions, 992 flow [2025-04-29 11:09:31,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 404 transitions, 990 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:31,960 INFO L231 Difference]: Finished difference. Result has 412 places, 404 transitions, 828 flow [2025-04-29 11:09:31,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=828, PETRI_PLACES=412, PETRI_TRANSITIONS=404} [2025-04-29 11:09:31,962 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -4 predicate places. [2025-04-29 11:09:31,962 INFO L485 AbstractCegarLoop]: Abstraction has has 412 places, 404 transitions, 828 flow [2025-04-29 11:09:31,963 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 332.8333333333333) internal successors, (1997), 6 states have internal predecessors, (1997), 0 states have call successors, (0), 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:31,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:31,963 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:31,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:09:31,963 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:31,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1241914517, now seen corresponding path program 1 times [2025-04-29 11:09:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:31,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882523123] [2025-04-29 11:09:31,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:31,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:31,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-29 11:09:31,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-29 11:09:31,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:31,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:32,383 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:32,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:32,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882523123] [2025-04-29 11:09:32,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882523123] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:32,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:32,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:32,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265757338] [2025-04-29 11:09:32,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:32,386 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:32,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:32,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:32,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:32,897 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 417 [2025-04-29 11:09:32,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 404 transitions, 828 flow. Second operand has 6 states, 6 states have (on average 315.5) internal successors, (1893), 6 states have internal predecessors, (1893), 0 states have call successors, (0), 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:32,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:32,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 417 [2025-04-29 11:09:32,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:32,989 INFO L116 PetriNetUnfolderBase]: 37/743 cut-off events. [2025-04-29 11:09:32,989 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:09:32,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 743 events. 37/743 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1743 event pairs, 36 based on Foata normal form. 0/700 useless extension candidates. Maximal degree in co-relation 755. Up to 190 conditions per place. [2025-04-29 11:09:32,991 INFO L140 encePairwiseOnDemand]: 399/417 looper letters, 85 selfloop transitions, 15 changer transitions 0/401 dead transitions. [2025-04-29 11:09:32,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 401 transitions, 1022 flow [2025-04-29 11:09:32,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1969 transitions. [2025-04-29 11:09:32,995 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7869704236610712 [2025-04-29 11:09:32,995 INFO L175 Difference]: Start difference. First operand has 412 places, 404 transitions, 828 flow. Second operand 6 states and 1969 transitions. [2025-04-29 11:09:32,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 401 transitions, 1022 flow [2025-04-29 11:09:32,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 401 transitions, 1012 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:33,000 INFO L231 Difference]: Finished difference. Result has 409 places, 401 transitions, 842 flow [2025-04-29 11:09:33,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=842, PETRI_PLACES=409, PETRI_TRANSITIONS=401} [2025-04-29 11:09:33,001 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -7 predicate places. [2025-04-29 11:09:33,001 INFO L485 AbstractCegarLoop]: Abstraction has has 409 places, 401 transitions, 842 flow [2025-04-29 11:09:33,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 315.5) internal successors, (1893), 6 states have internal predecessors, (1893), 0 states have call successors, (0), 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,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:33,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:33,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:09:33,002 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:33,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:33,003 INFO L85 PathProgramCache]: Analyzing trace with hash -9783545, now seen corresponding path program 1 times [2025-04-29 11:09:33,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:33,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376260113] [2025-04-29 11:09:33,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:33,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:33,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:09:33,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:09:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:33,319 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,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:33,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376260113] [2025-04-29 11:09:33,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376260113] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:33,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:33,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724674777] [2025-04-29 11:09:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:33,320 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:33,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:33,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:33,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 417 [2025-04-29 11:09:33,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 401 transitions, 842 flow. Second operand has 6 states, 6 states have (on average 279.1666666666667) internal successors, (1675), 6 states have internal predecessors, (1675), 0 states have call successors, (0), 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,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:33,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 417 [2025-04-29 11:09:33,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:34,021 INFO L116 PetriNetUnfolderBase]: 365/1865 cut-off events. [2025-04-29 11:09:34,022 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:09:34,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 1865 events. 365/1865 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9499 event pairs, 364 based on Foata normal form. 0/1741 useless extension candidates. Maximal degree in co-relation 2457. Up to 890 conditions per place. [2025-04-29 11:09:34,026 INFO L140 encePairwiseOnDemand]: 399/417 looper letters, 123 selfloop transitions, 15 changer transitions 0/398 dead transitions. [2025-04-29 11:09:34,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 398 transitions, 1112 flow [2025-04-29 11:09:34,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:34,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:34,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1779 transitions. [2025-04-29 11:09:34,030 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7110311750599521 [2025-04-29 11:09:34,030 INFO L175 Difference]: Start difference. First operand has 409 places, 401 transitions, 842 flow. Second operand 6 states and 1779 transitions. [2025-04-29 11:09:34,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 398 transitions, 1112 flow [2025-04-29 11:09:34,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 398 transitions, 1082 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:34,034 INFO L231 Difference]: Finished difference. Result has 406 places, 398 transitions, 836 flow [2025-04-29 11:09:34,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=836, PETRI_PLACES=406, PETRI_TRANSITIONS=398} [2025-04-29 11:09:34,035 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -10 predicate places. [2025-04-29 11:09:34,035 INFO L485 AbstractCegarLoop]: Abstraction has has 406 places, 398 transitions, 836 flow [2025-04-29 11:09:34,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.1666666666667) internal successors, (1675), 6 states have internal predecessors, (1675), 0 states have call successors, (0), 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,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:34,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:34,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:09:34,037 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:34,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash -430221496, now seen corresponding path program 1 times [2025-04-29 11:09:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:34,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897532720] [2025-04-29 11:09:34,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:34,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-04-29 11:09:34,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-04-29 11:09:34,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:34,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:34,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:34,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897532720] [2025-04-29 11:09:34,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897532720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:34,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:34,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:34,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629370155] [2025-04-29 11:09:34,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:34,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:34,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:34,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:34,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:34,784 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 417 [2025-04-29 11:09:34,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 398 transitions, 836 flow. Second operand has 6 states, 6 states have (on average 282.6666666666667) internal successors, (1696), 6 states have internal predecessors, (1696), 0 states have call successors, (0), 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,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:34,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 417 [2025-04-29 11:09:34,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:34,971 INFO L116 PetriNetUnfolderBase]: 365/1861 cut-off events. [2025-04-29 11:09:34,971 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:09:34,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1861 events. 365/1861 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9512 event pairs, 364 based on Foata normal form. 0/1741 useless extension candidates. Maximal degree in co-relation 2453. Up to 886 conditions per place. [2025-04-29 11:09:34,977 INFO L140 encePairwiseOnDemand]: 399/417 looper letters, 120 selfloop transitions, 15 changer transitions 0/395 dead transitions. [2025-04-29 11:09:34,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 395 transitions, 1100 flow [2025-04-29 11:09:34,977 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:34,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-04-29 11:09:34,981 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7170263788968825 [2025-04-29 11:09:34,981 INFO L175 Difference]: Start difference. First operand has 406 places, 398 transitions, 836 flow. Second operand 6 states and 1794 transitions. [2025-04-29 11:09:34,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 395 transitions, 1100 flow [2025-04-29 11:09:34,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 403 places, 395 transitions, 1070 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:34,985 INFO L231 Difference]: Finished difference. Result has 403 places, 395 transitions, 830 flow [2025-04-29 11:09:34,986 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=830, PETRI_PLACES=403, PETRI_TRANSITIONS=395} [2025-04-29 11:09:34,987 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -13 predicate places. [2025-04-29 11:09:34,988 INFO L485 AbstractCegarLoop]: Abstraction has has 403 places, 395 transitions, 830 flow [2025-04-29 11:09:34,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.6666666666667) internal successors, (1696), 6 states have internal predecessors, (1696), 0 states have call successors, (0), 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,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:34,989 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:34,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:09:34,990 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:34,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash -532787826, now seen corresponding path program 1 times [2025-04-29 11:09:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:34,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197005927] [2025-04-29 11:09:34,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:34,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:35,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-04-29 11:09:35,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-04-29 11:09:35,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:35,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:35,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:35,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197005927] [2025-04-29 11:09:35,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197005927] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:35,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829530071] [2025-04-29 11:09:35,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:35,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:35,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:35,142 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:35,143 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:35,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-04-29 11:09:35,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-04-29 11:09:35,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:35,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:35,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:09:35,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:35,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:35,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:09:35,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829530071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:35,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:35,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:09:35,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057775621] [2025-04-29 11:09:35,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:35,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:35,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:35,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:35,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:35,704 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 417 [2025-04-29 11:09:35,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 395 transitions, 830 flow. Second operand has 10 states, 10 states have (on average 401.8) internal successors, (4018), 10 states have internal predecessors, (4018), 0 states have call successors, (0), 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,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:35,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 417 [2025-04-29 11:09:35,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:35,807 INFO L116 PetriNetUnfolderBase]: 7/683 cut-off events. [2025-04-29 11:09:35,807 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:35,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 683 events. 7/683 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 385 event pairs, 6 based on Foata normal form. 2/663 useless extension candidates. Maximal degree in co-relation 365. Up to 24 conditions per place. [2025-04-29 11:09:35,809 INFO L140 encePairwiseOnDemand]: 411/417 looper letters, 14 selfloop transitions, 9 changer transitions 0/403 dead transitions. [2025-04-29 11:09:35,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 403 transitions, 894 flow [2025-04-29 11:09:35,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:35,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:35,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3625 transitions. [2025-04-29 11:09:35,815 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9658939515054623 [2025-04-29 11:09:35,815 INFO L175 Difference]: Start difference. First operand has 403 places, 395 transitions, 830 flow. Second operand 9 states and 3625 transitions. [2025-04-29 11:09:35,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 403 transitions, 894 flow [2025-04-29 11:09:35,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 403 transitions, 864 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:35,820 INFO L231 Difference]: Finished difference. Result has 409 places, 401 transitions, 850 flow [2025-04-29 11:09:35,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=850, PETRI_PLACES=409, PETRI_TRANSITIONS=401} [2025-04-29 11:09:35,821 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, -7 predicate places. [2025-04-29 11:09:35,821 INFO L485 AbstractCegarLoop]: Abstraction has has 409 places, 401 transitions, 850 flow [2025-04-29 11:09:35,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 401.8) internal successors, (4018), 10 states have internal predecessors, (4018), 0 states have call successors, (0), 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 L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:35,825 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 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,832 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:36,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:36,029 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:36,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash 946249214, now seen corresponding path program 2 times [2025-04-29 11:09:36,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:36,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009343835] [2025-04-29 11:09:36,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:36,078 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 406 statements into 2 equivalence classes. [2025-04-29 11:09:36,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 88 of 406 statements. [2025-04-29 11:09:36,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:36,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-04-29 11:09:36,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:36,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009343835] [2025-04-29 11:09:36,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009343835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:36,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:36,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:36,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706192678] [2025-04-29 11:09:36,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:36,283 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:36,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:36,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:36,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:36,911 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 325 out of 417 [2025-04-29 11:09:36,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 401 transitions, 850 flow. Second operand has 6 states, 6 states have (on average 332.3333333333333) internal successors, (1994), 6 states have internal predecessors, (1994), 0 states have call successors, (0), 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,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:36,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 325 of 417 [2025-04-29 11:09:36,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:37,221 INFO L116 PetriNetUnfolderBase]: 257/1989 cut-off events. [2025-04-29 11:09:37,221 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:09:37,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2684 conditions, 1989 events. 257/1989 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10068 event pairs, 34 based on Foata normal form. 0/1862 useless extension candidates. Maximal degree in co-relation 2222. Up to 515 conditions per place. [2025-04-29 11:09:37,226 INFO L140 encePairwiseOnDemand]: 388/417 looper letters, 91 selfloop transitions, 75 changer transitions 0/478 dead transitions. [2025-04-29 11:09:37,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 478 transitions, 1336 flow [2025-04-29 11:09:37,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:37,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:37,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2118 transitions. [2025-04-29 11:09:37,231 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8465227817745803 [2025-04-29 11:09:37,231 INFO L175 Difference]: Start difference. First operand has 409 places, 401 transitions, 850 flow. Second operand 6 states and 2118 transitions. [2025-04-29 11:09:37,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 478 transitions, 1336 flow [2025-04-29 11:09:37,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 478 transitions, 1330 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:37,238 INFO L231 Difference]: Finished difference. Result has 417 places, 469 transitions, 1324 flow [2025-04-29 11:09:37,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1324, PETRI_PLACES=417, PETRI_TRANSITIONS=469} [2025-04-29 11:09:37,240 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 1 predicate places. [2025-04-29 11:09:37,240 INFO L485 AbstractCegarLoop]: Abstraction has has 417 places, 469 transitions, 1324 flow [2025-04-29 11:09:37,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 332.3333333333333) internal successors, (1994), 6 states have internal predecessors, (1994), 0 states have call successors, (0), 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,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:37,241 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:09:37,241 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:37,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:37,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2049363515, now seen corresponding path program 1 times [2025-04-29 11:09:37,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:37,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496749496] [2025-04-29 11:09:37,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:37,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:37,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-04-29 11:09:37,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-04-29 11:09:37,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:37,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:37,737 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:37,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:37,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496749496] [2025-04-29 11:09:37,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496749496] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:37,737 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006431180] [2025-04-29 11:09:37,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:37,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:37,739 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:37,741 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:37,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-04-29 11:09:38,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-04-29 11:09:38,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:38,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:38,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 1684 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:09:38,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:38,374 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:38,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:09:38,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006431180] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:38,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:38,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:09:38,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297547454] [2025-04-29 11:09:38,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:38,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:38,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:38,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:38,869 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 417 [2025-04-29 11:09:38,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 469 transitions, 1324 flow. Second operand has 18 states, 18 states have (on average 401.8888888888889) internal successors, (7234), 18 states have internal predecessors, (7234), 0 states have call successors, (0), 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,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:38,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 417 [2025-04-29 11:09:38,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:39,286 INFO L116 PetriNetUnfolderBase]: 166/2139 cut-off events. [2025-04-29 11:09:39,286 INFO L117 PetriNetUnfolderBase]: For 184/191 co-relation queries the response was YES. [2025-04-29 11:09:39,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2890 conditions, 2139 events. 166/2139 cut-off events. For 184/191 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7504 event pairs, 23 based on Foata normal form. 4/2056 useless extension candidates. Maximal degree in co-relation 2033. Up to 208 conditions per place. [2025-04-29 11:09:39,293 INFO L140 encePairwiseOnDemand]: 411/417 looper letters, 19 selfloop transitions, 21 changer transitions 0/487 dead transitions. [2025-04-29 11:09:39,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 487 transitions, 1492 flow [2025-04-29 11:09:39,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:09:39,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:09:39,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 8443 transitions. [2025-04-29 11:09:39,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9641429713372159 [2025-04-29 11:09:39,302 INFO L175 Difference]: Start difference. First operand has 417 places, 469 transitions, 1324 flow. Second operand 21 states and 8443 transitions. [2025-04-29 11:09:39,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 487 transitions, 1492 flow [2025-04-29 11:09:39,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 487 transitions, 1492 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:39,310 INFO L231 Difference]: Finished difference. Result has 442 places, 482 transitions, 1454 flow [2025-04-29 11:09:39,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1454, PETRI_PLACES=442, PETRI_TRANSITIONS=482} [2025-04-29 11:09:39,311 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 26 predicate places. [2025-04-29 11:09:39,311 INFO L485 AbstractCegarLoop]: Abstraction has has 442 places, 482 transitions, 1454 flow [2025-04-29 11:09:39,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 401.8888888888889) internal successors, (7234), 18 states have internal predecessors, (7234), 0 states have call successors, (0), 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,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:39,313 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:09:39,514 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,SelfDestructingSolverStorable10 [2025-04-29 11:09:39,514 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:39,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash 562528603, now seen corresponding path program 2 times [2025-04-29 11:09:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:39,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551534394] [2025-04-29 11:09:39,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:39,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:39,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 867 statements into 2 equivalence classes. [2025-04-29 11:09:39,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 125 of 867 statements. [2025-04-29 11:09:39,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:39,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:39,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2282 trivial. 0 not checked. [2025-04-29 11:09:39,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:39,846 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551534394] [2025-04-29 11:09:39,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551534394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:39,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:39,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:39,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881180020] [2025-04-29 11:09:39,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:39,847 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:39,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:39,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:39,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:40,448 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 417 [2025-04-29 11:09:40,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 482 transitions, 1454 flow. Second operand has 6 states, 6 states have (on average 339.6666666666667) internal successors, (2038), 6 states have internal predecessors, (2038), 0 states have call successors, (0), 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,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:40,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 417 [2025-04-29 11:09:40,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:40,979 INFO L116 PetriNetUnfolderBase]: 227/2306 cut-off events. [2025-04-29 11:09:40,980 INFO L117 PetriNetUnfolderBase]: For 429/468 co-relation queries the response was YES. [2025-04-29 11:09:40,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3628 conditions, 2306 events. 227/2306 cut-off events. For 429/468 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8677 event pairs, 55 based on Foata normal form. 0/2192 useless extension candidates. Maximal degree in co-relation 2566. Up to 564 conditions per place. [2025-04-29 11:09:40,989 INFO L140 encePairwiseOnDemand]: 411/417 looper letters, 142 selfloop transitions, 5 changer transitions 0/481 dead transitions. [2025-04-29 11:09:40,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 481 transitions, 1746 flow [2025-04-29 11:09:40,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:40,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:40,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2069 transitions. [2025-04-29 11:09:40,995 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8269384492406076 [2025-04-29 11:09:40,995 INFO L175 Difference]: Start difference. First operand has 442 places, 482 transitions, 1454 flow. Second operand 6 states and 2069 transitions. [2025-04-29 11:09:40,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 481 transitions, 1746 flow [2025-04-29 11:09:40,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 481 transitions, 1722 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:41,002 INFO L231 Difference]: Finished difference. Result has 440 places, 481 transitions, 1438 flow [2025-04-29 11:09:41,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=476, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1438, PETRI_PLACES=440, PETRI_TRANSITIONS=481} [2025-04-29 11:09:41,003 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 24 predicate places. [2025-04-29 11:09:41,003 INFO L485 AbstractCegarLoop]: Abstraction has has 440 places, 481 transitions, 1438 flow [2025-04-29 11:09:41,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 339.6666666666667) internal successors, (2038), 6 states have internal predecessors, (2038), 0 states have call successors, (0), 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,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:41,004 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,004 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:09:41,005 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:41,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:41,006 INFO L85 PathProgramCache]: Analyzing trace with hash -283520163, now seen corresponding path program 1 times [2025-04-29 11:09:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:41,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825080035] [2025-04-29 11:09:41,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:41,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 918 statements into 1 equivalence classes. [2025-04-29 11:09:41,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 918 of 918 statements. [2025-04-29 11:09:41,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:41,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:09:42,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:42,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825080035] [2025-04-29 11:09:42,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825080035] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:42,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482079] [2025-04-29 11:09:42,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:42,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:42,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:42,222 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:42,223 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:42,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 918 statements into 1 equivalence classes. [2025-04-29 11:09:42,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 918 of 918 statements. [2025-04-29 11:09:42,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:42,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:42,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 3594 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:09:42,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:09:43,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:44,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2282 backedges. 0 proven. 2275 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:09:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482079] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:44,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:09:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367461131] [2025-04-29 11:09:44,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:44,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:44,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:44,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:44,268 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 417 [2025-04-29 11:09:44,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 481 transitions, 1438 flow. Second operand has 23 states, 23 states have (on average 402.0869565217391) internal successors, (9248), 23 states have internal predecessors, (9248), 0 states have call successors, (0), 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,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:44,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 417 [2025-04-29 11:09:44,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:44,918 INFO L116 PetriNetUnfolderBase]: 166/2456 cut-off events. [2025-04-29 11:09:44,919 INFO L117 PetriNetUnfolderBase]: For 301/308 co-relation queries the response was YES. [2025-04-29 11:09:44,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3288 conditions, 2456 events. 166/2456 cut-off events. For 301/308 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7533 event pairs, 23 based on Foata normal form. 3/2373 useless extension candidates. Maximal degree in co-relation 2044. Up to 208 conditions per place. [2025-04-29 11:09:44,926 INFO L140 encePairwiseOnDemand]: 411/417 looper letters, 22 selfloop transitions, 30 changer transitions 0/498 dead transitions. [2025-04-29 11:09:44,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 498 transitions, 1664 flow [2025-04-29 11:09:44,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 12054 transitions. [2025-04-29 11:09:44,934 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9635491606714628 [2025-04-29 11:09:44,934 INFO L175 Difference]: Start difference. First operand has 440 places, 481 transitions, 1438 flow. Second operand 30 states and 12054 transitions. [2025-04-29 11:09:44,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 498 transitions, 1664 flow [2025-04-29 11:09:44,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 498 transitions, 1654 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:44,941 INFO L231 Difference]: Finished difference. Result has 468 places, 491 transitions, 1580 flow [2025-04-29 11:09:44,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1580, PETRI_PLACES=468, PETRI_TRANSITIONS=491} [2025-04-29 11:09:44,942 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 52 predicate places. [2025-04-29 11:09:44,942 INFO L485 AbstractCegarLoop]: Abstraction has has 468 places, 491 transitions, 1580 flow [2025-04-29 11:09:44,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 402.0869565217391) internal successors, (9248), 23 states have internal predecessors, (9248), 0 states have call successors, (0), 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,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:44,945 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2025-04-29 11:09:44,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:09:45,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:45,146 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:45,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:45,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1102135547, now seen corresponding path program 2 times [2025-04-29 11:09:45,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:45,148 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332020043] [2025-04-29 11:09:45,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:45,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:45,271 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1236 statements into 2 equivalence classes. [2025-04-29 11:09:45,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 176 of 1236 statements. [2025-04-29 11:09:45,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:45,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4880 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4880 trivial. 0 not checked. [2025-04-29 11:09:45,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:45,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332020043] [2025-04-29 11:09:45,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332020043] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:45,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:45,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:45,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893755353] [2025-04-29 11:09:45,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:45,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:45,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:45,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:45,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:46,036 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 331 out of 417 [2025-04-29 11:09:46,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 491 transitions, 1580 flow. Second operand has 6 states, 6 states have (on average 341.1666666666667) internal successors, (2047), 6 states have internal predecessors, (2047), 0 states have call successors, (0), 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,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:46,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 331 of 417 [2025-04-29 11:09:46,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:46,846 INFO L116 PetriNetUnfolderBase]: 545/3539 cut-off events. [2025-04-29 11:09:46,846 INFO L117 PetriNetUnfolderBase]: For 915/988 co-relation queries the response was YES. [2025-04-29 11:09:46,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6049 conditions, 3539 events. 545/3539 cut-off events. For 915/988 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16126 event pairs, 93 based on Foata normal form. 16/3390 useless extension candidates. Maximal degree in co-relation 4524. Up to 1089 conditions per place. [2025-04-29 11:09:46,856 INFO L140 encePairwiseOnDemand]: 394/417 looper letters, 155 selfloop transitions, 130 changer transitions 0/628 dead transitions. [2025-04-29 11:09:46,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 628 transitions, 2800 flow [2025-04-29 11:09:46,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:46,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2147 transitions. [2025-04-29 11:09:46,858 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8581135091926458 [2025-04-29 11:09:46,858 INFO L175 Difference]: Start difference. First operand has 468 places, 491 transitions, 1580 flow. Second operand 6 states and 2147 transitions. [2025-04-29 11:09:46,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 628 transitions, 2800 flow [2025-04-29 11:09:46,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 628 transitions, 2754 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:09:46,869 INFO L231 Difference]: Finished difference. Result has 460 places, 620 transitions, 2762 flow [2025-04-29 11:09:46,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=491, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2762, PETRI_PLACES=460, PETRI_TRANSITIONS=620} [2025-04-29 11:09:46,870 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 44 predicate places. [2025-04-29 11:09:46,870 INFO L485 AbstractCegarLoop]: Abstraction has has 460 places, 620 transitions, 2762 flow [2025-04-29 11:09:46,871 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 341.1666666666667) internal successors, (2047), 6 states have internal predecessors, (2047), 0 states have call successors, (0), 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,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:46,871 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:46,871 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:09:46,871 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:46,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash 363049534, now seen corresponding path program 1 times [2025-04-29 11:09:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:46,874 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065695883] [2025-04-29 11:09:46,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:47,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1246 statements into 1 equivalence classes. [2025-04-29 11:09:47,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1246 of 1246 statements. [2025-04-29 11:09:47,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:47,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-04-29 11:09:49,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:49,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065695883] [2025-04-29 11:09:49,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065695883] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:49,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:49,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89559932] [2025-04-29 11:09:49,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:49,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:49,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:49,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:49,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:50,413 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 417 [2025-04-29 11:09:50,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 620 transitions, 2762 flow. Second operand has 6 states, 6 states have (on average 340.5) internal successors, (2043), 6 states have internal predecessors, (2043), 0 states have call successors, (0), 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,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:50,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 417 [2025-04-29 11:09:50,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:51,774 INFO L116 PetriNetUnfolderBase]: 821/4305 cut-off events. [2025-04-29 11:09:51,774 INFO L117 PetriNetUnfolderBase]: For 3285/3511 co-relation queries the response was YES. [2025-04-29 11:09:51,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8907 conditions, 4305 events. 821/4305 cut-off events. For 3285/3511 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22467 event pairs, 74 based on Foata normal form. 76/4206 useless extension candidates. Maximal degree in co-relation 7399. Up to 1348 conditions per place. [2025-04-29 11:09:51,790 INFO L140 encePairwiseOnDemand]: 394/417 looper letters, 276 selfloop transitions, 131 changer transitions 5/758 dead transitions. [2025-04-29 11:09:51,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 758 transitions, 4486 flow [2025-04-29 11:09:51,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:51,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2143 transitions. [2025-04-29 11:09:51,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8565147881694645 [2025-04-29 11:09:51,792 INFO L175 Difference]: Start difference. First operand has 460 places, 620 transitions, 2762 flow. Second operand 6 states and 2143 transitions. [2025-04-29 11:09:51,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 758 transitions, 4486 flow [2025-04-29 11:09:51,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 758 transitions, 4486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:51,805 INFO L231 Difference]: Finished difference. Result has 470 places, 748 transitions, 4242 flow [2025-04-29 11:09:51,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=2762, PETRI_DIFFERENCE_MINUEND_PLACES=460, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4242, PETRI_PLACES=470, PETRI_TRANSITIONS=748} [2025-04-29 11:09:51,806 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 54 predicate places. [2025-04-29 11:09:51,806 INFO L485 AbstractCegarLoop]: Abstraction has has 470 places, 748 transitions, 4242 flow [2025-04-29 11:09:51,806 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 340.5) internal successors, (2043), 6 states have internal predecessors, (2043), 0 states have call successors, (0), 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,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:51,807 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:51,807 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:09:51,807 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:51,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2052275181, now seen corresponding path program 1 times [2025-04-29 11:09:51,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:51,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29248834] [2025-04-29 11:09:51,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:51,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:51,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1247 statements into 1 equivalence classes. [2025-04-29 11:09:52,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1247 of 1247 statements. [2025-04-29 11:09:52,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:52,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2025-04-29 11:09:54,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:54,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29248834] [2025-04-29 11:09:54,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29248834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:54,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:54,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:54,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429562297] [2025-04-29 11:09:54,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:54,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:54,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:54,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:54,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:55,092 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 417 [2025-04-29 11:09:55,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 748 transitions, 4242 flow. Second operand has 6 states, 6 states have (on average 308.3333333333333) internal successors, (1850), 6 states have internal predecessors, (1850), 0 states have call successors, (0), 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,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:55,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 417 [2025-04-29 11:09:55,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:56,920 INFO L116 PetriNetUnfolderBase]: 1308/5634 cut-off events. [2025-04-29 11:09:56,920 INFO L117 PetriNetUnfolderBase]: For 4871/4928 co-relation queries the response was YES. [2025-04-29 11:09:56,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13563 conditions, 5634 events. 1308/5634 cut-off events. For 4871/4928 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33868 event pairs, 369 based on Foata normal form. 11/5400 useless extension candidates. Maximal degree in co-relation 11971. Up to 2589 conditions per place. [2025-04-29 11:09:56,945 INFO L140 encePairwiseOnDemand]: 398/417 looper letters, 356 selfloop transitions, 84 changer transitions 0/827 dead transitions. [2025-04-29 11:09:56,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 827 transitions, 5520 flow [2025-04-29 11:09:56,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1946 transitions. [2025-04-29 11:09:56,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-04-29 11:09:56,947 INFO L175 Difference]: Start difference. First operand has 470 places, 748 transitions, 4242 flow. Second operand 6 states and 1946 transitions. [2025-04-29 11:09:56,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 474 places, 827 transitions, 5520 flow [2025-04-29 11:09:56,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 827 transitions, 5266 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:56,969 INFO L231 Difference]: Finished difference. Result has 479 places, 819 transitions, 4778 flow [2025-04-29 11:09:56,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=417, PETRI_DIFFERENCE_MINUEND_FLOW=3994, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4778, PETRI_PLACES=479, PETRI_TRANSITIONS=819} [2025-04-29 11:09:56,970 INFO L279 CegarLoopForPetriNet]: 416 programPoint places, 63 predicate places. [2025-04-29 11:09:56,970 INFO L485 AbstractCegarLoop]: Abstraction has has 479 places, 819 transitions, 4778 flow [2025-04-29 11:09:56,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.3333333333333) internal successors, (1850), 6 states have internal predecessors, (1850), 0 states have call successors, (0), 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:56,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:56,971 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:56,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:09:56,972 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2025-04-29 11:09:56,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:56,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2133059504, now seen corresponding path program 1 times [2025-04-29 11:09:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:56,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733585696] [2025-04-29 11:09:56,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:56,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:57,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1253 statements into 1 equivalence classes. [2025-04-29 11:09:58,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1253 of 1253 statements. [2025-04-29 11:09:58,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:58,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 316 proven. 3174 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-04-29 11:10:18,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:18,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733585696] [2025-04-29 11:10:18,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733585696] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:18,380 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007210043] [2025-04-29 11:10:18,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:18,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:18,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:18,382 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:10:18,383 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:10:18,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1253 statements into 1 equivalence classes. [2025-04-29 11:10:19,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1253 of 1253 statements. [2025-04-29 11:10:19,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:19,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:19,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 4908 conjuncts, 148 conjuncts are in the unsatisfiable core [2025-04-29 11:10:19,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:10:19,984 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:10:19,986 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:20,135 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 11:10:20,136 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:20,508 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:10:20,508 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 17 treesize of output 21 [2025-04-29 11:10:20,977 INFO L325 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-04-29 11:10:20,978 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-04-29 11:10:22,183 INFO L325 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-04-29 11:10:22,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-04-29 11:10:22,800 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 Killed by 15