./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.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_13-arraycollapse_nr.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 aa1019154e40d47bb37715d3eeac2054a52cf6d54f3dc9d5d7f27932730291e6 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:24,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:24,842 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:24,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:24,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:24,866 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:24,867 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:24,867 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:24,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:24,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:24,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:24,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:24,867 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:24,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:24,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:24,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:24,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:24,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:24,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:24,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:24,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:24,870 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:24,871 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:24,871 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:24,871 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 -> aa1019154e40d47bb37715d3eeac2054a52cf6d54f3dc9d5d7f27932730291e6 [2025-04-29 11:09:25,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:25,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:25,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:25,101 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:25,101 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:25,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.c [2025-04-29 11:09:26,419 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c8b3008/23ea5cc0b6474b55be4cb6e009847d6d/FLAG44d93c31c [2025-04-29 11:09:26,633 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:26,633 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/09-regions_13-arraycollapse_nr.c [2025-04-29 11:09:26,635 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:26,635 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:26,635 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:26,639 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c8b3008/23ea5cc0b6474b55be4cb6e009847d6d/FLAG44d93c31c [2025-04-29 11:09:27,469 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76c8b3008/23ea5cc0b6474b55be4cb6e009847d6d [2025-04-29 11:09:27,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:27,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:27,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:27,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:27,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:27,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:27" (1/1) ... [2025-04-29 11:09:27,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21693bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:27, skipping insertion in model container [2025-04-29 11:09:27,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:27" (1/1) ... [2025-04-29 11:09:27,485 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:27,671 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:27,687 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:27,716 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:27,733 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:27,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:27 WrapperNode [2025-04-29 11:09:27,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:27,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:27,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:27,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:27,740 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:27" (1/1) ... [2025-04-29 11:09:27,753 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:27" (1/1) ... [2025-04-29 11:09:27,801 INFO L138 Inliner]: procedures = 20, calls = 55, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 374 [2025-04-29 11:09:27,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:27,802 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:27,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:27,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:27,807 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:27" (1/1) ... [2025-04-29 11:09:27,808 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:27" (1/1) ... [2025-04-29 11:09:27,822 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:27" (1/1) ... [2025-04-29 11:09:27,823 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:27" (1/1) ... [2025-04-29 11:09:27,860 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:27" (1/1) ... [2025-04-29 11:09:27,861 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:27" (1/1) ... [2025-04-29 11:09:27,863 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:27" (1/1) ... [2025-04-29 11:09:27,865 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:27" (1/1) ... [2025-04-29 11:09:27,866 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:27" (1/1) ... [2025-04-29 11:09:27,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:27,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:27,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:27,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:27,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:27" (1/1) ... [2025-04-29 11:09:27,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:27,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:27,902 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:27,907 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:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:27,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:09:27,921 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:27,921 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:27,922 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:28,012 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:28,014 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:28,550 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:28,551 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:28,576 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:28,577 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:09:28,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:28 BoogieIcfgContainer [2025-04-29 11:09:28,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:28,579 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:28,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:28,583 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:28,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:27" (1/3) ... [2025-04-29 11:09:28,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366c6855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:28, skipping insertion in model container [2025-04-29 11:09:28,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:27" (2/3) ... [2025-04-29 11:09:28,585 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366c6855 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:28, skipping insertion in model container [2025-04-29 11:09:28,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:28" (3/3) ... [2025-04-29 11:09:28,586 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.c [2025-04-29 11:09:28,597 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:28,599 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.c that has 2 procedures, 445 locations, 447 edges, 1 initial locations, 1 loop locations, and 30 error locations. [2025-04-29 11:09:28,600 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:28,722 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:09:28,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 448 places, 448 transitions, 900 flow [2025-04-29 11:09:28,866 INFO L116 PetriNetUnfolderBase]: 4/447 cut-off events. [2025-04-29 11:09:28,868 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:28,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451 conditions, 447 events. 4/447 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 364 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 319. Up to 2 conditions per place. [2025-04-29 11:09:28,871 INFO L82 GeneralOperation]: Start removeDead. Operand has 448 places, 448 transitions, 900 flow [2025-04-29 11:09:28,876 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 447 places, 447 transitions, 897 flow [2025-04-29 11:09:28,881 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:28,891 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;@727d9e8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:28,893 INFO L341 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-04-29 11:09:28,902 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:28,902 INFO L116 PetriNetUnfolderBase]: 1/62 cut-off events. [2025-04-29 11:09:28,902 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:28,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:28,903 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:28,903 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:28,907 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:28,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1773182550, now seen corresponding path program 1 times [2025-04-29 11:09:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:28,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670448482] [2025-04-29 11:09:28,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:28,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:09:29,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:09:29,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:29,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:29,506 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,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:29,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670448482] [2025-04-29 11:09:29,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670448482] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:29,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:29,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:29,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943463515] [2025-04-29 11:09:29,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:29,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:29,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:29,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:29,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:30,265 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 448 [2025-04-29 11:09:30,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 447 transitions, 897 flow. Second operand has 6 states, 6 states have (on average 309.3333333333333) internal successors, (1856), 6 states have internal predecessors, (1856), 0 states have call successors, (0), 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,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:30,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 448 [2025-04-29 11:09:30,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:30,633 INFO L116 PetriNetUnfolderBase]: 365/1793 cut-off events. [2025-04-29 11:09:30,634 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:30,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2659 conditions, 1793 events. 365/1793 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9408 event pairs, 364 based on Foata normal form. 12/1667 useless extension candidates. Maximal degree in co-relation 2247. Up to 842 conditions per place. [2025-04-29 11:09:30,642 INFO L140 encePairwiseOnDemand]: 421/448 looper letters, 113 selfloop transitions, 20 changer transitions 2/440 dead transitions. [2025-04-29 11:09:30,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 440 transitions, 1149 flow [2025-04-29 11:09:30,643 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1988 transitions. [2025-04-29 11:09:30,659 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7395833333333334 [2025-04-29 11:09:30,660 INFO L175 Difference]: Start difference. First operand has 447 places, 447 transitions, 897 flow. Second operand 6 states and 1988 transitions. [2025-04-29 11:09:30,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 440 transitions, 1149 flow [2025-04-29 11:09:30,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 440 transitions, 1148 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:30,700 INFO L231 Difference]: Finished difference. Result has 447 places, 438 transitions, 918 flow [2025-04-29 11:09:30,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=918, PETRI_PLACES=447, PETRI_TRANSITIONS=438} [2025-04-29 11:09:30,705 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, 0 predicate places. [2025-04-29 11:09:30,706 INFO L485 AbstractCegarLoop]: Abstraction has has 447 places, 438 transitions, 918 flow [2025-04-29 11:09:30,707 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.3333333333333) internal successors, (1856), 6 states have internal predecessors, (1856), 0 states have call successors, (0), 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,707 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:30,707 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:30,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:30,708 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:30,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:30,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1784118188, now seen corresponding path program 1 times [2025-04-29 11:09:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:30,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932390148] [2025-04-29 11:09:30,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:30,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:09:30,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:09:30,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:30,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:31,012 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,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:31,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932390148] [2025-04-29 11:09:31,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932390148] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:31,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:31,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:31,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265184561] [2025-04-29 11:09:31,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:31,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:31,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:31,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:31,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 448 [2025-04-29 11:09:31,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 438 transitions, 918 flow. Second operand has 6 states, 6 states have (on average 309.3333333333333) internal successors, (1856), 6 states have internal predecessors, (1856), 0 states have call successors, (0), 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,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:31,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 448 [2025-04-29 11:09:31,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:31,948 INFO L116 PetriNetUnfolderBase]: 365/1787 cut-off events. [2025-04-29 11:09:31,949 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:31,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2673 conditions, 1787 events. 365/1787 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9369 event pairs, 364 based on Foata normal form. 0/1655 useless extension candidates. Maximal degree in co-relation 2333. Up to 842 conditions per place. [2025-04-29 11:09:31,954 INFO L140 encePairwiseOnDemand]: 424/448 looper letters, 113 selfloop transitions, 20 changer transitions 0/434 dead transitions. [2025-04-29 11:09:31,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 434 transitions, 1176 flow [2025-04-29 11:09:31,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1985 transitions. [2025-04-29 11:09:31,958 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7384672619047619 [2025-04-29 11:09:31,958 INFO L175 Difference]: Start difference. First operand has 447 places, 438 transitions, 918 flow. Second operand 6 states and 1985 transitions. [2025-04-29 11:09:31,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 434 transitions, 1176 flow [2025-04-29 11:09:31,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 434 transitions, 1136 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:31,963 INFO L231 Difference]: Finished difference. Result has 441 places, 434 transitions, 910 flow [2025-04-29 11:09:31,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=441, PETRI_TRANSITIONS=434} [2025-04-29 11:09:31,965 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -6 predicate places. [2025-04-29 11:09:31,965 INFO L485 AbstractCegarLoop]: Abstraction has has 441 places, 434 transitions, 910 flow [2025-04-29 11:09:31,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.3333333333333) internal successors, (1856), 6 states have internal predecessors, (1856), 0 states have call successors, (0), 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,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:31,966 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:31,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:09:31,966 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:31,966 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash 151834827, now seen corresponding path program 1 times [2025-04-29 11:09:31,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:31,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360684544] [2025-04-29 11:09:31,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:31,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:31,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:09:31,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:09:31,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:31,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:32,267 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,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:32,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360684544] [2025-04-29 11:09:32,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360684544] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:32,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:32,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:32,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147263100] [2025-04-29 11:09:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:32,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:32,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:32,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:32,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:32,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 448 [2025-04-29 11:09:32,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 434 transitions, 910 flow. Second operand has 6 states, 6 states have (on average 311.8333333333333) internal successors, (1871), 6 states have internal predecessors, (1871), 0 states have call successors, (0), 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,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:32,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 448 [2025-04-29 11:09:32,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:33,088 INFO L116 PetriNetUnfolderBase]: 391/1876 cut-off events. [2025-04-29 11:09:33,089 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:09:33,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2816 conditions, 1876 events. 391/1876 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10144 event pairs, 390 based on Foata normal form. 0/1738 useless extension candidates. Maximal degree in co-relation 2460. Up to 911 conditions per place. [2025-04-29 11:09:33,094 INFO L140 encePairwiseOnDemand]: 442/448 looper letters, 130 selfloop transitions, 5 changer transitions 0/433 dead transitions. [2025-04-29 11:09:33,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 433 transitions, 1178 flow [2025-04-29 11:09:33,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1990 transitions. [2025-04-29 11:09:33,098 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7403273809523809 [2025-04-29 11:09:33,098 INFO L175 Difference]: Start difference. First operand has 441 places, 434 transitions, 910 flow. Second operand 6 states and 1990 transitions. [2025-04-29 11:09:33,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 433 transitions, 1178 flow [2025-04-29 11:09:33,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 433 transitions, 1138 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:33,102 INFO L231 Difference]: Finished difference. Result has 440 places, 433 transitions, 878 flow [2025-04-29 11:09:33,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=878, PETRI_PLACES=440, PETRI_TRANSITIONS=433} [2025-04-29 11:09:33,104 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -7 predicate places. [2025-04-29 11:09:33,104 INFO L485 AbstractCegarLoop]: Abstraction has has 440 places, 433 transitions, 878 flow [2025-04-29 11:09:33,105 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.8333333333333) internal successors, (1871), 6 states have internal predecessors, (1871), 0 states have call successors, (0), 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,105 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:33,105 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:33,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:33,105 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:33,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:33,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2146545842, now seen corresponding path program 1 times [2025-04-29 11:09:33,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:33,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714567134] [2025-04-29 11:09:33,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:33,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:33,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-29 11:09:33,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-29 11:09:33,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:33,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:33,164 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,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:33,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714567134] [2025-04-29 11:09:33,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714567134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:33,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:33,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:33,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229894127] [2025-04-29 11:09:33,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:33,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:33,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:33,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:33,190 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 434 out of 448 [2025-04-29 11:09:33,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 433 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 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,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:33,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 434 of 448 [2025-04-29 11:09:33,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:33,240 INFO L116 PetriNetUnfolderBase]: 7/618 cut-off events. [2025-04-29 11:09:33,240 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:33,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 618 events. 7/618 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 623 event pairs, 6 based on Foata normal form. 1/583 useless extension candidates. Maximal degree in co-relation 496. Up to 24 conditions per place. [2025-04-29 11:09:33,242 INFO L140 encePairwiseOnDemand]: 445/448 looper letters, 10 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2025-04-29 11:09:33,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 434 transitions, 904 flow [2025-04-29 11:09:33,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:33,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:33,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1315 transitions. [2025-04-29 11:09:33,245 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9784226190476191 [2025-04-29 11:09:33,245 INFO L175 Difference]: Start difference. First operand has 440 places, 433 transitions, 878 flow. Second operand 3 states and 1315 transitions. [2025-04-29 11:09:33,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 434 transitions, 904 flow [2025-04-29 11:09:33,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:33,252 INFO L231 Difference]: Finished difference. Result has 438 places, 434 transitions, 880 flow [2025-04-29 11:09:33,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=438, PETRI_TRANSITIONS=434} [2025-04-29 11:09:33,253 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -9 predicate places. [2025-04-29 11:09:33,253 INFO L485 AbstractCegarLoop]: Abstraction has has 438 places, 434 transitions, 880 flow [2025-04-29 11:09:33,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 435.3333333333333) internal successors, (1306), 3 states have internal predecessors, (1306), 0 states have call successors, (0), 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,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:33,254 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:33,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:09:33,254 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:33,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:33,254 INFO L85 PathProgramCache]: Analyzing trace with hash -723952799, now seen corresponding path program 1 times [2025-04-29 11:09:33,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:33,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034438648] [2025-04-29 11:09:33,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:33,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:33,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-29 11:09:33,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-29 11:09:33,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:33,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:33,694 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,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:33,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034438648] [2025-04-29 11:09:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034438648] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:33,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:33,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793343288] [2025-04-29 11:09:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:33,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:33,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:33,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:33,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:34,405 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 351 out of 448 [2025-04-29 11:09:34,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 434 transitions, 880 flow. Second operand has 6 states, 6 states have (on average 355.8333333333333) internal successors, (2135), 6 states have internal predecessors, (2135), 0 states have call successors, (0), 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,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:34,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 351 of 448 [2025-04-29 11:09:34,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:34,575 INFO L116 PetriNetUnfolderBase]: 55/859 cut-off events. [2025-04-29 11:09:34,575 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-29 11:09:34,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 859 events. 55/859 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2249 event pairs, 54 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 924. Up to 227 conditions per place. [2025-04-29 11:09:34,578 INFO L140 encePairwiseOnDemand]: 442/448 looper letters, 89 selfloop transitions, 5 changer transitions 0/433 dead transitions. [2025-04-29 11:09:34,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 433 transitions, 1066 flow [2025-04-29 11:09:34,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:34,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2200 transitions. [2025-04-29 11:09:34,583 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8184523809523809 [2025-04-29 11:09:34,584 INFO L175 Difference]: Start difference. First operand has 438 places, 434 transitions, 880 flow. Second operand 6 states and 2200 transitions. [2025-04-29 11:09:34,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 433 transitions, 1066 flow [2025-04-29 11:09:34,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 433 transitions, 1064 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:34,588 INFO L231 Difference]: Finished difference. Result has 441 places, 433 transitions, 886 flow [2025-04-29 11:09:34,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=886, PETRI_PLACES=441, PETRI_TRANSITIONS=433} [2025-04-29 11:09:34,589 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -6 predicate places. [2025-04-29 11:09:34,589 INFO L485 AbstractCegarLoop]: Abstraction has has 441 places, 433 transitions, 886 flow [2025-04-29 11:09:34,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 355.8333333333333) internal successors, (2135), 6 states have internal predecessors, (2135), 0 states have call successors, (0), 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,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:34,590 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:34,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:09:34,590 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:34,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:34,591 INFO L85 PathProgramCache]: Analyzing trace with hash 763058454, now seen corresponding path program 1 times [2025-04-29 11:09:34,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:34,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178979068] [2025-04-29 11:09:34,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:34,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:34,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-04-29 11:09:34,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-04-29 11:09:34,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:34,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:35,003 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:35,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:35,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178979068] [2025-04-29 11:09:35,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178979068] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:35,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:35,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:35,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010046468] [2025-04-29 11:09:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:35,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:35,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:35,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:35,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:35,636 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 448 [2025-04-29 11:09:35,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 433 transitions, 886 flow. Second operand has 6 states, 6 states have (on average 338.5) internal successors, (2031), 6 states have internal predecessors, (2031), 0 states have call successors, (0), 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,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:35,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 448 [2025-04-29 11:09:35,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:35,784 INFO L116 PetriNetUnfolderBase]: 37/772 cut-off events. [2025-04-29 11:09:35,784 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:09:35,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 772 events. 37/772 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1726 event pairs, 36 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 792. Up to 198 conditions per place. [2025-04-29 11:09:35,787 INFO L140 encePairwiseOnDemand]: 430/448 looper letters, 93 selfloop transitions, 15 changer transitions 0/430 dead transitions. [2025-04-29 11:09:35,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 430 transitions, 1096 flow [2025-04-29 11:09:35,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:35,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:35,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2115 transitions. [2025-04-29 11:09:35,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7868303571428571 [2025-04-29 11:09:35,791 INFO L175 Difference]: Start difference. First operand has 441 places, 433 transitions, 886 flow. Second operand 6 states and 2115 transitions. [2025-04-29 11:09:35,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 430 transitions, 1096 flow [2025-04-29 11:09:35,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 430 transitions, 1086 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:35,796 INFO L231 Difference]: Finished difference. Result has 438 places, 430 transitions, 900 flow [2025-04-29 11:09:35,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=438, PETRI_TRANSITIONS=430} [2025-04-29 11:09:35,798 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -9 predicate places. [2025-04-29 11:09:35,798 INFO L485 AbstractCegarLoop]: Abstraction has has 438 places, 430 transitions, 900 flow [2025-04-29 11:09:35,799 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 338.5) internal successors, (2031), 6 states have internal predecessors, (2031), 0 states have call successors, (0), 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,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:35,800 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:35,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:09:35,800 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:35,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:35,800 INFO L85 PathProgramCache]: Analyzing trace with hash 624354266, now seen corresponding path program 1 times [2025-04-29 11:09:35,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:35,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981942262] [2025-04-29 11:09:35,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:35,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:35,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-04-29 11:09:35,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-04-29 11:09:35,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:35,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:36,126 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:36,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:36,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981942262] [2025-04-29 11:09:36,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981942262] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:36,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:36,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:36,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912406680] [2025-04-29 11:09:36,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:36,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:36,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:36,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:36,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:36,656 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 448 [2025-04-29 11:09:36,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 430 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 302.1666666666667) internal successors, (1813), 6 states have internal predecessors, (1813), 0 states have call successors, (0), 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,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:36,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 448 [2025-04-29 11:09:36,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:36,876 INFO L116 PetriNetUnfolderBase]: 365/1885 cut-off events. [2025-04-29 11:09:36,876 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:09:36,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1885 events. 365/1885 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9391 event pairs, 364 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2485. Up to 898 conditions per place. [2025-04-29 11:09:36,881 INFO L140 encePairwiseOnDemand]: 430/448 looper letters, 131 selfloop transitions, 15 changer transitions 0/427 dead transitions. [2025-04-29 11:09:36,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 427 transitions, 1186 flow [2025-04-29 11:09:36,881 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1925 transitions. [2025-04-29 11:09:36,884 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7161458333333334 [2025-04-29 11:09:36,884 INFO L175 Difference]: Start difference. First operand has 438 places, 430 transitions, 900 flow. Second operand 6 states and 1925 transitions. [2025-04-29 11:09:36,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 427 transitions, 1186 flow [2025-04-29 11:09:36,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 427 transitions, 1156 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:36,890 INFO L231 Difference]: Finished difference. Result has 435 places, 427 transitions, 894 flow [2025-04-29 11:09:36,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=435, PETRI_TRANSITIONS=427} [2025-04-29 11:09:36,891 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -12 predicate places. [2025-04-29 11:09:36,891 INFO L485 AbstractCegarLoop]: Abstraction has has 435 places, 427 transitions, 894 flow [2025-04-29 11:09:36,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 302.1666666666667) internal successors, (1813), 6 states have internal predecessors, (1813), 0 states have call successors, (0), 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,892 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:36,893 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:36,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:09:36,893 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:36,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:36,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1169718799, now seen corresponding path program 1 times [2025-04-29 11:09:36,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:36,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013441862] [2025-04-29 11:09:36,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:36,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-04-29 11:09:36,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-04-29 11:09:36,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:36,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:09:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:37,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013441862] [2025-04-29 11:09:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013441862] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:37,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:37,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:37,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164643671] [2025-04-29 11:09:37,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:37,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:37,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:37,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:37,633 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 448 [2025-04-29 11:09:37,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 427 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 305.6666666666667) internal successors, (1834), 6 states have internal predecessors, (1834), 0 states have call successors, (0), 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,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:37,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 448 [2025-04-29 11:09:37,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:37,828 INFO L116 PetriNetUnfolderBase]: 365/1881 cut-off events. [2025-04-29 11:09:37,828 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:09:37,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1881 events. 365/1881 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9329 event pairs, 364 based on Foata normal form. 0/1761 useless extension candidates. Maximal degree in co-relation 2481. Up to 894 conditions per place. [2025-04-29 11:09:37,833 INFO L140 encePairwiseOnDemand]: 430/448 looper letters, 128 selfloop transitions, 15 changer transitions 0/424 dead transitions. [2025-04-29 11:09:37,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 424 transitions, 1174 flow [2025-04-29 11:09:37,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1940 transitions. [2025-04-29 11:09:37,837 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7217261904761905 [2025-04-29 11:09:37,837 INFO L175 Difference]: Start difference. First operand has 435 places, 427 transitions, 894 flow. Second operand 6 states and 1940 transitions. [2025-04-29 11:09:37,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 424 transitions, 1174 flow [2025-04-29 11:09:37,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 424 transitions, 1144 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:37,842 INFO L231 Difference]: Finished difference. Result has 432 places, 424 transitions, 888 flow [2025-04-29 11:09:37,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=888, PETRI_PLACES=432, PETRI_TRANSITIONS=424} [2025-04-29 11:09:37,846 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -15 predicate places. [2025-04-29 11:09:37,846 INFO L485 AbstractCegarLoop]: Abstraction has has 432 places, 424 transitions, 888 flow [2025-04-29 11:09:37,847 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 305.6666666666667) internal successors, (1834), 6 states have internal predecessors, (1834), 0 states have call successors, (0), 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,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:37,847 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:37,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:09:37,847 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:37,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1021686053, now seen corresponding path program 1 times [2025-04-29 11:09:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:37,849 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358836157] [2025-04-29 11:09:37,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:37,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-04-29 11:09:37,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-04-29 11:09:37,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:37,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:09:37,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:37,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358836157] [2025-04-29 11:09:37,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358836157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:37,996 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121751289] [2025-04-29 11:09:37,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:37,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:37,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:37,998 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:38,000 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:38,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-04-29 11:09:38,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-04-29 11:09:38,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:38,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:38,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:09:38,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:38,313 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:09:38,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:09:38,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121751289] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:38,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:09:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975345354] [2025-04-29 11:09:38,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:38,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:09:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:09:38,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:09:38,570 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 448 [2025-04-29 11:09:38,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 424 transitions, 888 flow. Second operand has 10 states, 10 states have (on average 432.8) internal successors, (4328), 10 states have internal predecessors, (4328), 0 states have call successors, (0), 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,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:38,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 448 [2025-04-29 11:09:38,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:38,683 INFO L116 PetriNetUnfolderBase]: 7/712 cut-off events. [2025-04-29 11:09:38,683 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:38,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 712 events. 7/712 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 389 event pairs, 6 based on Foata normal form. 2/692 useless extension candidates. Maximal degree in co-relation 394. Up to 24 conditions per place. [2025-04-29 11:09:38,685 INFO L140 encePairwiseOnDemand]: 442/448 looper letters, 14 selfloop transitions, 9 changer transitions 0/432 dead transitions. [2025-04-29 11:09:38,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 432 transitions, 952 flow [2025-04-29 11:09:38,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:09:38,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:09:38,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3904 transitions. [2025-04-29 11:09:38,690 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9682539682539683 [2025-04-29 11:09:38,690 INFO L175 Difference]: Start difference. First operand has 432 places, 424 transitions, 888 flow. Second operand 9 states and 3904 transitions. [2025-04-29 11:09:38,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 432 transitions, 952 flow [2025-04-29 11:09:38,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 432 transitions, 922 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:38,695 INFO L231 Difference]: Finished difference. Result has 438 places, 430 transitions, 908 flow [2025-04-29 11:09:38,696 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=908, PETRI_PLACES=438, PETRI_TRANSITIONS=430} [2025-04-29 11:09:38,697 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -9 predicate places. [2025-04-29 11:09:38,697 INFO L485 AbstractCegarLoop]: Abstraction has has 438 places, 430 transitions, 908 flow [2025-04-29 11:09:38,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 432.8) internal successors, (4328), 10 states have internal predecessors, (4328), 0 states have call successors, (0), 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,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:38,699 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:38,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:38,899 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:38,900 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:38,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:38,901 INFO L85 PathProgramCache]: Analyzing trace with hash -511288629, now seen corresponding path program 2 times [2025-04-29 11:09:38,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:38,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709970912] [2025-04-29 11:09:38,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:38,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 406 statements into 2 equivalence classes. [2025-04-29 11:09:38,960 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:38,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:38,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-04-29 11:09:39,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:39,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709970912] [2025-04-29 11:09:39,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709970912] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:39,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:39,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597230406] [2025-04-29 11:09:39,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:39,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:39,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:39,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:39,888 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 448 [2025-04-29 11:09:39,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 430 transitions, 908 flow. Second operand has 6 states, 6 states have (on average 355.3333333333333) internal successors, (2132), 6 states have internal predecessors, (2132), 0 states have call successors, (0), 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,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:39,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 448 [2025-04-29 11:09:39,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:40,336 INFO L116 PetriNetUnfolderBase]: 257/2018 cut-off events. [2025-04-29 11:09:40,336 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:09:40,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2721 conditions, 2018 events. 257/2018 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10031 event pairs, 36 based on Foata normal form. 0/1891 useless extension candidates. Maximal degree in co-relation 2259. Up to 523 conditions per place. [2025-04-29 11:09:40,342 INFO L140 encePairwiseOnDemand]: 419/448 looper letters, 99 selfloop transitions, 75 changer transitions 0/507 dead transitions. [2025-04-29 11:09:40,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 507 transitions, 1410 flow [2025-04-29 11:09:40,342 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:40,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2264 transitions. [2025-04-29 11:09:40,346 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8422619047619048 [2025-04-29 11:09:40,346 INFO L175 Difference]: Start difference. First operand has 438 places, 430 transitions, 908 flow. Second operand 6 states and 2264 transitions. [2025-04-29 11:09:40,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 507 transitions, 1410 flow [2025-04-29 11:09:40,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 507 transitions, 1404 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:40,353 INFO L231 Difference]: Finished difference. Result has 446 places, 498 transitions, 1382 flow [2025-04-29 11:09:40,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1382, PETRI_PLACES=446, PETRI_TRANSITIONS=498} [2025-04-29 11:09:40,355 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, -1 predicate places. [2025-04-29 11:09:40,355 INFO L485 AbstractCegarLoop]: Abstraction has has 446 places, 498 transitions, 1382 flow [2025-04-29 11:09:40,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 355.3333333333333) internal successors, (2132), 6 states have internal predecessors, (2132), 0 states have call successors, (0), 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,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:40,356 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:40,356 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:09:40,357 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:40,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1667843070, now seen corresponding path program 1 times [2025-04-29 11:09:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:40,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774226773] [2025-04-29 11:09:40,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:40,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:40,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-04-29 11:09:40,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-04-29 11:09:40,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:40,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:40,825 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:09:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:40,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774226773] [2025-04-29 11:09:40,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774226773] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:40,825 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429160588] [2025-04-29 11:09:40,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:40,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:40,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:40,827 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:40,829 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:41,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-04-29 11:09:41,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-04-29 11:09:41,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:41,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:41,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1798 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:09:41,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:41,484 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:09:41,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 357 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:09:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429160588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:41,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:41,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-29 11:09:41,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783252475] [2025-04-29 11:09:41,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:41,796 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:09:41,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:41,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:09:41,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:09:41,910 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 448 [2025-04-29 11:09:41,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 498 transitions, 1382 flow. Second operand has 18 states, 18 states have (on average 432.8888888888889) internal successors, (7792), 18 states have internal predecessors, (7792), 0 states have call successors, (0), 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,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:41,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 448 [2025-04-29 11:09:41,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:42,318 INFO L116 PetriNetUnfolderBase]: 158/2153 cut-off events. [2025-04-29 11:09:42,318 INFO L117 PetriNetUnfolderBase]: For 184/198 co-relation queries the response was YES. [2025-04-29 11:09:42,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2882 conditions, 2153 events. 158/2153 cut-off events. For 184/198 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7396 event pairs, 23 based on Foata normal form. 4/2070 useless extension candidates. Maximal degree in co-relation 2025. Up to 208 conditions per place. [2025-04-29 11:09:42,325 INFO L140 encePairwiseOnDemand]: 442/448 looper letters, 19 selfloop transitions, 21 changer transitions 0/516 dead transitions. [2025-04-29 11:09:42,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 516 transitions, 1550 flow [2025-04-29 11:09:42,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:09:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:09:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9094 transitions. [2025-04-29 11:09:42,334 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.966624149659864 [2025-04-29 11:09:42,334 INFO L175 Difference]: Start difference. First operand has 446 places, 498 transitions, 1382 flow. Second operand 21 states and 9094 transitions. [2025-04-29 11:09:42,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 516 transitions, 1550 flow [2025-04-29 11:09:42,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 516 transitions, 1550 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:42,341 INFO L231 Difference]: Finished difference. Result has 471 places, 511 transitions, 1512 flow [2025-04-29 11:09:42,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1512, PETRI_PLACES=471, PETRI_TRANSITIONS=511} [2025-04-29 11:09:42,343 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, 24 predicate places. [2025-04-29 11:09:42,343 INFO L485 AbstractCegarLoop]: Abstraction has has 471 places, 511 transitions, 1512 flow [2025-04-29 11:09:42,345 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 432.8888888888889) internal successors, (7792), 18 states have internal predecessors, (7792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:42,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:42,345 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] [2025-04-29 11:09:42,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:42,546 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:42,546 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:42,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:42,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1559679154, now seen corresponding path program 2 times [2025-04-29 11:09:42,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:42,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95069560] [2025-04-29 11:09:42,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:42,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 896 statements into 2 equivalence classes. [2025-04-29 11:09:42,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 896 statements. [2025-04-29 11:09:42,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:42,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:42,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2527 trivial. 0 not checked. [2025-04-29 11:09:42,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:42,964 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95069560] [2025-04-29 11:09:42,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95069560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:42,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:42,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:42,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312297794] [2025-04-29 11:09:42,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:42,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:42,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:42,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:42,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:43,562 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 448 [2025-04-29 11:09:43,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 471 places, 511 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:43,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:43,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 448 [2025-04-29 11:09:43,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:43,979 INFO L116 PetriNetUnfolderBase]: 212/2320 cut-off events. [2025-04-29 11:09:43,979 INFO L117 PetriNetUnfolderBase]: For 431/471 co-relation queries the response was YES. [2025-04-29 11:09:43,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 2320 events. 212/2320 cut-off events. For 431/471 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8713 event pairs, 55 based on Foata normal form. 0/2206 useless extension candidates. Maximal degree in co-relation 2573. Up to 572 conditions per place. [2025-04-29 11:09:43,988 INFO L140 encePairwiseOnDemand]: 442/448 looper letters, 150 selfloop transitions, 5 changer transitions 0/510 dead transitions. [2025-04-29 11:09:43,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 475 places, 510 transitions, 1820 flow [2025-04-29 11:09:43,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2215 transitions. [2025-04-29 11:09:43,991 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8240327380952381 [2025-04-29 11:09:43,991 INFO L175 Difference]: Start difference. First operand has 471 places, 511 transitions, 1512 flow. Second operand 6 states and 2215 transitions. [2025-04-29 11:09:43,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 475 places, 510 transitions, 1820 flow [2025-04-29 11:09:43,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 510 transitions, 1796 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:09:43,998 INFO L231 Difference]: Finished difference. Result has 469 places, 510 transitions, 1496 flow [2025-04-29 11:09:43,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=505, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1496, PETRI_PLACES=469, PETRI_TRANSITIONS=510} [2025-04-29 11:09:43,999 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, 22 predicate places. [2025-04-29 11:09:43,999 INFO L485 AbstractCegarLoop]: Abstraction has has 469 places, 510 transitions, 1496 flow [2025-04-29 11:09:44,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 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,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:44,001 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, 1, 1, 1, 1, 1, 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,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:09:44,001 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:44,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:44,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1692736745, now seen corresponding path program 1 times [2025-04-29 11:09:44,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:44,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271965688] [2025-04-29 11:09:44,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:44,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 947 statements into 1 equivalence classes. [2025-04-29 11:09:44,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 947 of 947 statements. [2025-04-29 11:09:44,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:44,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2527 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-29 11:09:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:45,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271965688] [2025-04-29 11:09:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271965688] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:09:45,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139937378] [2025-04-29 11:09:45,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:45,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:09:45,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:45,229 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:45,231 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:45,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 947 statements into 1 equivalence classes. [2025-04-29 11:09:45,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 947 of 947 statements. [2025-04-29 11:09:45,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:45,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:45,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 3708 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:09:45,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:09:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2527 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-29 11:09:46,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:09:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2527 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-04-29 11:09:47,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139937378] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:09:47,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:09:47,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-04-29 11:09:47,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114822128] [2025-04-29 11:09:47,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:09:47,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:09:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:47,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:09:47,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:09:47,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 448 [2025-04-29 11:09:47,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 469 places, 510 transitions, 1496 flow. Second operand has 23 states, 23 states have (on average 433.0869565217391) internal successors, (9961), 23 states have internal predecessors, (9961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:47,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:47,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 448 [2025-04-29 11:09:47,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:47,940 INFO L116 PetriNetUnfolderBase]: 165/2484 cut-off events. [2025-04-29 11:09:47,940 INFO L117 PetriNetUnfolderBase]: For 301/308 co-relation queries the response was YES. [2025-04-29 11:09:47,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3315 conditions, 2484 events. 165/2484 cut-off events. For 301/308 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7500 event pairs, 23 based on Foata normal form. 3/2401 useless extension candidates. Maximal degree in co-relation 2071. Up to 208 conditions per place. [2025-04-29 11:09:47,946 INFO L140 encePairwiseOnDemand]: 442/448 looper letters, 22 selfloop transitions, 30 changer transitions 0/527 dead transitions. [2025-04-29 11:09:47,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 527 transitions, 1722 flow [2025-04-29 11:09:47,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-29 11:09:47,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-29 11:09:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 12984 transitions. [2025-04-29 11:09:47,957 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9660714285714286 [2025-04-29 11:09:47,957 INFO L175 Difference]: Start difference. First operand has 469 places, 510 transitions, 1496 flow. Second operand 30 states and 12984 transitions. [2025-04-29 11:09:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 527 transitions, 1722 flow [2025-04-29 11:09:47,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 527 transitions, 1712 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:09:47,964 INFO L231 Difference]: Finished difference. Result has 497 places, 520 transitions, 1638 flow [2025-04-29 11:09:47,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1638, PETRI_PLACES=497, PETRI_TRANSITIONS=520} [2025-04-29 11:09:47,965 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, 50 predicate places. [2025-04-29 11:09:47,965 INFO L485 AbstractCegarLoop]: Abstraction has has 497 places, 520 transitions, 1638 flow [2025-04-29 11:09:47,967 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 433.0869565217391) internal successors, (9961), 23 states have internal predecessors, (9961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:47,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:47,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:47,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:09:48,168 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:48,168 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:48,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:48,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1522166992, now seen corresponding path program 2 times [2025-04-29 11:09:48,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:48,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801473538] [2025-04-29 11:09:48,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:09:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:48,293 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1265 statements into 2 equivalence classes. [2025-04-29 11:09:48,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 205 of 1265 statements. [2025-04-29 11:09:48,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:09:48,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5380 trivial. 0 not checked. [2025-04-29 11:09:48,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:48,597 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801473538] [2025-04-29 11:09:48,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801473538] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:48,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:48,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:48,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442297524] [2025-04-29 11:09:48,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:48,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:48,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:48,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:48,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:49,096 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 448 [2025-04-29 11:09:49,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 520 transitions, 1638 flow. Second operand has 6 states, 6 states have (on average 365.5) internal successors, (2193), 6 states have internal predecessors, (2193), 0 states have call successors, (0), 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:49,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:49,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 448 [2025-04-29 11:09:49,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:50,247 INFO L116 PetriNetUnfolderBase]: 530/3553 cut-off events. [2025-04-29 11:09:50,247 INFO L117 PetriNetUnfolderBase]: For 917/992 co-relation queries the response was YES. [2025-04-29 11:09:50,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 3553 events. 530/3553 cut-off events. For 917/992 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16099 event pairs, 93 based on Foata normal form. 16/3404 useless extension candidates. Maximal degree in co-relation 4531. Up to 1097 conditions per place. [2025-04-29 11:09:50,257 INFO L140 encePairwiseOnDemand]: 425/448 looper letters, 163 selfloop transitions, 130 changer transitions 0/657 dead transitions. [2025-04-29 11:09:50,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 657 transitions, 2874 flow [2025-04-29 11:09:50,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2293 transitions. [2025-04-29 11:09:50,259 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8530505952380952 [2025-04-29 11:09:50,259 INFO L175 Difference]: Start difference. First operand has 497 places, 520 transitions, 1638 flow. Second operand 6 states and 2293 transitions. [2025-04-29 11:09:50,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 502 places, 657 transitions, 2874 flow [2025-04-29 11:09:50,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 657 transitions, 2828 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-04-29 11:09:50,268 INFO L231 Difference]: Finished difference. Result has 489 places, 649 transitions, 2820 flow [2025-04-29 11:09:50,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=1592, PETRI_DIFFERENCE_MINUEND_PLACES=479, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2820, PETRI_PLACES=489, PETRI_TRANSITIONS=649} [2025-04-29 11:09:50,269 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, 42 predicate places. [2025-04-29 11:09:50,269 INFO L485 AbstractCegarLoop]: Abstraction has has 489 places, 649 transitions, 2820 flow [2025-04-29 11:09:50,269 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 365.5) internal successors, (2193), 6 states have internal predecessors, (2193), 0 states have call successors, (0), 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,269 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:50,270 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, 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:50,270 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:09:50,270 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:50,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:50,272 INFO L85 PathProgramCache]: Analyzing trace with hash 772690447, now seen corresponding path program 1 times [2025-04-29 11:09:50,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:50,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135063320] [2025-04-29 11:09:50,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:50,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:50,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1275 statements into 1 equivalence classes. [2025-04-29 11:09:50,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1275 of 1275 statements. [2025-04-29 11:09:50,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:50,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,348 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5380 trivial. 0 not checked. [2025-04-29 11:09:53,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135063320] [2025-04-29 11:09:53,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135063320] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:53,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:53,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603783958] [2025-04-29 11:09:53,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,350 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:53,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:53,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:53,843 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 448 [2025-04-29 11:09:53,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 649 transitions, 2820 flow. Second operand has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 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:53,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:53,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 448 [2025-04-29 11:09:53,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:55,294 INFO L116 PetriNetUnfolderBase]: 806/4319 cut-off events. [2025-04-29 11:09:55,294 INFO L117 PetriNetUnfolderBase]: For 3234/3396 co-relation queries the response was YES. [2025-04-29 11:09:55,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8915 conditions, 4319 events. 806/4319 cut-off events. For 3234/3396 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22300 event pairs, 74 based on Foata normal form. 76/4220 useless extension candidates. Maximal degree in co-relation 7407. Up to 1357 conditions per place. [2025-04-29 11:09:55,314 INFO L140 encePairwiseOnDemand]: 425/448 looper letters, 285 selfloop transitions, 131 changer transitions 5/787 dead transitions. [2025-04-29 11:09:55,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 787 transitions, 4562 flow [2025-04-29 11:09:55,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:09:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:09:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2284 transitions. [2025-04-29 11:09:55,315 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8497023809523809 [2025-04-29 11:09:55,315 INFO L175 Difference]: Start difference. First operand has 489 places, 649 transitions, 2820 flow. Second operand 6 states and 2284 transitions. [2025-04-29 11:09:55,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 787 transitions, 4562 flow [2025-04-29 11:09:55,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 494 places, 787 transitions, 4562 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:09:55,329 INFO L231 Difference]: Finished difference. Result has 499 places, 777 transitions, 4300 flow [2025-04-29 11:09:55,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=2820, PETRI_DIFFERENCE_MINUEND_PLACES=489, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4300, PETRI_PLACES=499, PETRI_TRANSITIONS=777} [2025-04-29 11:09:55,330 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, 52 predicate places. [2025-04-29 11:09:55,330 INFO L485 AbstractCegarLoop]: Abstraction has has 499 places, 777 transitions, 4300 flow [2025-04-29 11:09:55,331 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 364.0) internal successors, (2184), 6 states have internal predecessors, (2184), 0 states have call successors, (0), 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,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:55,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:55,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:09:55,331 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:09:55,334 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1909190795, now seen corresponding path program 1 times [2025-04-29 11:09:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:55,334 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004362750] [2025-04-29 11:09:55,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:55,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:55,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes. [2025-04-29 11:09:55,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements. [2025-04-29 11:09:55,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:55,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5380 trivial. 0 not checked. [2025-04-29 11:09:58,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:58,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004362750] [2025-04-29 11:09:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004362750] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:58,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:58,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:09:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452229175] [2025-04-29 11:09:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:58,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:09:58,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:58,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:09:58,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:09:58,563 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 448 [2025-04-29 11:09:58,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 499 places, 777 transitions, 4300 flow. Second operand has 6 states, 6 states have (on average 332.6666666666667) internal successors, (1996), 6 states have internal predecessors, (1996), 0 states have call successors, (0), 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:58,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:58,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 448 [2025-04-29 11:09:58,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:00,472 INFO L116 PetriNetUnfolderBase]: 1308/5663 cut-off events. [2025-04-29 11:10:00,472 INFO L117 PetriNetUnfolderBase]: For 4858/4915 co-relation queries the response was YES. [2025-04-29 11:10:00,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13600 conditions, 5663 events. 1308/5663 cut-off events. For 4858/4915 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33846 event pairs, 369 based on Foata normal form. 11/5429 useless extension candidates. Maximal degree in co-relation 12008. Up to 2597 conditions per place. [2025-04-29 11:10:00,496 INFO L140 encePairwiseOnDemand]: 429/448 looper letters, 364 selfloop transitions, 84 changer transitions 0/856 dead transitions. [2025-04-29 11:10:00,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 503 places, 856 transitions, 5594 flow [2025-04-29 11:10:00,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2092 transitions. [2025-04-29 11:10:00,498 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7782738095238095 [2025-04-29 11:10:00,498 INFO L175 Difference]: Start difference. First operand has 499 places, 777 transitions, 4300 flow. Second operand 6 states and 2092 transitions. [2025-04-29 11:10:00,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 503 places, 856 transitions, 5594 flow [2025-04-29 11:10:00,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 856 transitions, 5340 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:00,519 INFO L231 Difference]: Finished difference. Result has 508 places, 848 transitions, 4836 flow [2025-04-29 11:10:00,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=448, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=498, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=777, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4836, PETRI_PLACES=508, PETRI_TRANSITIONS=848} [2025-04-29 11:10:00,520 INFO L279 CegarLoopForPetriNet]: 447 programPoint places, 61 predicate places. [2025-04-29 11:10:00,520 INFO L485 AbstractCegarLoop]: Abstraction has has 508 places, 848 transitions, 4836 flow [2025-04-29 11:10:00,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 332.6666666666667) internal successors, (1996), 6 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:10:00,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:00,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:00,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:10:00,521 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-04-29 11:10:00,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:00,524 INFO L85 PathProgramCache]: Analyzing trace with hash -696742108, now seen corresponding path program 1 times [2025-04-29 11:10:00,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:00,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023153991] [2025-04-29 11:10:00,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:00,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:00,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. [2025-04-29 11:10:03,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1282 of 1282 statements. [2025-04-29 11:10:03,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:03,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:25,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 175 proven. 2471 refuted. 0 times theorem prover too weak. 2734 trivial. 0 not checked. [2025-04-29 11:10:25,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:25,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023153991] [2025-04-29 11:10:25,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023153991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:10:25,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118658794] [2025-04-29 11:10:25,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:25,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:10:25,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:25,082 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:25,083 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:25,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1282 statements into 1 equivalence classes. Killed by 15