./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/02-base_25-malloc_race_cp.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/02-base_25-malloc_race_cp.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 5c24865639a0fb6385d87b52f972ca15b09ce8699a47a6e19f8c040c7561a77b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:07:48,828 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:07:48,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:07:48,890 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:07:48,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:07:48,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:07:48,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:07:48,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:07:48,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:07:48,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:07:48,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:07:48,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:07:48,913 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:07:48,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:07:48,914 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:07:48,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:07:48,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:48,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:48,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:07:48,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:07:48,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:07:48,917 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 -> 5c24865639a0fb6385d87b52f972ca15b09ce8699a47a6e19f8c040c7561a77b [2025-04-29 11:07:49,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:07:49,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:07:49,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:07:49,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:07:49,157 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:07:49,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_25-malloc_race_cp.c [2025-04-29 11:07:50,505 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edcc33b0/b12ab8593ba54703bf5d5e360a25c17c/FLAG32361a0a1 [2025-04-29 11:07:50,711 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:07:50,711 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_25-malloc_race_cp.c [2025-04-29 11:07:50,713 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:07:50,713 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:07:50,713 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:07:50,719 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edcc33b0/b12ab8593ba54703bf5d5e360a25c17c/FLAG32361a0a1 [2025-04-29 11:07:51,554 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2edcc33b0/b12ab8593ba54703bf5d5e360a25c17c [2025-04-29 11:07:51,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:07:51,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:07:51,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:07:51,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:07:51,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:07:51,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f9d93d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51, skipping insertion in model container [2025-04-29 11:07:51,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:07:51,732 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:07:51,743 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:07:51,773 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:07:51,787 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:07:51,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51 WrapperNode [2025-04-29 11:07:51,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:07:51,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:07:51,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:07:51,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:07:51,793 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:07:51" (1/1) ... [2025-04-29 11:07:51,802 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:07:51" (1/1) ... [2025-04-29 11:07:51,817 INFO L138 Inliner]: procedures = 12, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2025-04-29 11:07:51,819 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:07:51,819 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:07:51,819 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:07:51,819 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:07:51,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,826 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,844 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:07:51,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:07:51,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:07:51,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:07:51,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:51,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:07:51,879 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:07:51,882 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:07:51,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:07:51,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:07:51,899 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:07:51,899 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:07:51,900 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:07:51,965 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:07:51,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:07:52,133 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:07:52,133 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:07:52,149 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:07:52,150 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:07:52,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:07:52 BoogieIcfgContainer [2025-04-29 11:07:52,151 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:07:52,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:07:52,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:07:52,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:07:52,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:07:51" (1/3) ... [2025-04-29 11:07:52,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbe9eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:07:52, skipping insertion in model container [2025-04-29 11:07:52,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (2/3) ... [2025-04-29 11:07:52,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbe9eb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:07:52, skipping insertion in model container [2025-04-29 11:07:52,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:07:52" (3/3) ... [2025-04-29 11:07:52,159 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_25-malloc_race_cp.c [2025-04-29 11:07:52,169 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:07:52,171 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_25-malloc_race_cp.c that has 2 procedures, 101 locations, 99 edges, 1 initial locations, 0 loop locations, and 10 error locations. [2025-04-29 11:07:52,171 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:07:52,223 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:07:52,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 100 transitions, 204 flow [2025-04-29 11:07:52,299 INFO L116 PetriNetUnfolderBase]: 0/99 cut-off events. [2025-04-29 11:07:52,302 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 99 events. 0/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:07:52,305 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 100 transitions, 204 flow [2025-04-29 11:07:52,309 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 99 transitions, 201 flow [2025-04-29 11:07:52,314 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:07:52,325 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;@391a7d99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:07:52,325 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:07:52,329 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:07:52,329 INFO L116 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-04-29 11:07:52,329 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:07:52,330 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1204997223, now seen corresponding path program 1 times [2025-04-29 11:07:52,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,341 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957514923] [2025-04-29 11:07:52,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:07:52,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:07:52,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,466 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:07:52,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957514923] [2025-04-29 11:07:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957514923] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59078985] [2025-04-29 11:07:52,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,475 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,529 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 100 [2025-04-29 11:07:52,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 201 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:07:52,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 100 [2025-04-29 11:07:52,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,595 INFO L116 PetriNetUnfolderBase]: 12/230 cut-off events. [2025-04-29 11:07:52,596 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:07:52,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 230 events. 12/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 653 event pairs, 12 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 227. Up to 36 conditions per place. [2025-04-29 11:07:52,599 INFO L140 encePairwiseOnDemand]: 97/100 looper letters, 11 selfloop transitions, 2 changer transitions 0/98 dead transitions. [2025-04-29 11:07:52,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 98 transitions, 225 flow [2025-04-29 11:07:52,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2025-04-29 11:07:52,613 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-04-29 11:07:52,615 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 201 flow. Second operand 3 states and 272 transitions. [2025-04-29 11:07:52,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 98 transitions, 225 flow [2025-04-29 11:07:52,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 98 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:52,624 INFO L231 Difference]: Finished difference. Result has 103 places, 98 transitions, 202 flow [2025-04-29 11:07:52,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=103, PETRI_TRANSITIONS=98} [2025-04-29 11:07:52,629 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 0 predicate places. [2025-04-29 11:07:52,630 INFO L485 AbstractCegarLoop]: Abstraction has has 103 places, 98 transitions, 202 flow [2025-04-29 11:07:52,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:07:52,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,631 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] [2025-04-29 11:07:52,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:07:52,632 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,632 INFO L85 PathProgramCache]: Analyzing trace with hash -942648927, now seen corresponding path program 1 times [2025-04-29 11:07:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,633 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277197165] [2025-04-29 11:07:52,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-29 11:07:52,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 11:07:52,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,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:07:52,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,694 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277197165] [2025-04-29 11:07:52,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277197165] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556026349] [2025-04-29 11:07:52,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,695 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,716 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 100 [2025-04-29 11:07:52,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 98 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:07:52,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 100 [2025-04-29 11:07:52,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,755 INFO L116 PetriNetUnfolderBase]: 9/196 cut-off events. [2025-04-29 11:07:52,758 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 196 events. 9/196 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 517 event pairs, 9 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 210. Up to 30 conditions per place. [2025-04-29 11:07:52,760 INFO L140 encePairwiseOnDemand]: 97/100 looper letters, 11 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-04-29 11:07:52,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 97 transitions, 226 flow [2025-04-29 11:07:52,760 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2025-04-29 11:07:52,763 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9066666666666666 [2025-04-29 11:07:52,763 INFO L175 Difference]: Start difference. First operand has 103 places, 98 transitions, 202 flow. Second operand 3 states and 272 transitions. [2025-04-29 11:07:52,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 97 transitions, 226 flow [2025-04-29 11:07:52,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 97 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:07:52,765 INFO L231 Difference]: Finished difference. Result has 102 places, 97 transitions, 200 flow [2025-04-29 11:07:52,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=102, PETRI_TRANSITIONS=97} [2025-04-29 11:07:52,766 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -1 predicate places. [2025-04-29 11:07:52,766 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 97 transitions, 200 flow [2025-04-29 11:07:52,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:07:52,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,767 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] [2025-04-29 11:07:52,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:07:52,768 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,769 INFO L85 PathProgramCache]: Analyzing trace with hash -563551676, now seen corresponding path program 1 times [2025-04-29 11:07:52,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105487552] [2025-04-29 11:07:52,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-29 11:07:52,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-29 11:07:52,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,829 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:07:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105487552] [2025-04-29 11:07:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105487552] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627315575] [2025-04-29 11:07:52,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,831 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,842 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 100 [2025-04-29 11:07:52,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 97 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:07:52,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 100 [2025-04-29 11:07:52,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,879 INFO L116 PetriNetUnfolderBase]: 8/161 cut-off events. [2025-04-29 11:07:52,880 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:07:52,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 161 events. 8/161 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 398 event pairs, 8 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 163. Up to 25 conditions per place. [2025-04-29 11:07:52,882 INFO L140 encePairwiseOnDemand]: 97/100 looper letters, 9 selfloop transitions, 1 changer transitions 0/95 dead transitions. [2025-04-29 11:07:52,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 216 flow [2025-04-29 11:07:52,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2025-04-29 11:07:52,884 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.92 [2025-04-29 11:07:52,884 INFO L175 Difference]: Start difference. First operand has 102 places, 97 transitions, 200 flow. Second operand 3 states and 276 transitions. [2025-04-29 11:07:52,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 216 flow [2025-04-29 11:07:52,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 95 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:07:52,886 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 194 flow [2025-04-29 11:07:52,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-04-29 11:07:52,887 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -3 predicate places. [2025-04-29 11:07:52,888 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 194 flow [2025-04-29 11:07:52,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 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:07:52,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,888 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] [2025-04-29 11:07:52,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:07:52,889 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1949983540, now seen corresponding path program 1 times [2025-04-29 11:07:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,890 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482968314] [2025-04-29 11:07:52,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:07:52,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:07:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,949 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:07:52,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482968314] [2025-04-29 11:07:52,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482968314] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7724281] [2025-04-29 11:07:52,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 100 [2025-04-29 11:07:52,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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:07:52,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 100 [2025-04-29 11:07:52,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:53,000 INFO L116 PetriNetUnfolderBase]: 16/245 cut-off events. [2025-04-29 11:07:53,000 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:53,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 245 events. 16/245 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 821 event pairs, 7 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 262. Up to 36 conditions per place. [2025-04-29 11:07:53,001 INFO L140 encePairwiseOnDemand]: 96/100 looper letters, 12 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-04-29 11:07:53,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 226 flow [2025-04-29 11:07:53,002 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:53,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 280 transitions. [2025-04-29 11:07:53,002 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-04-29 11:07:53,002 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 194 flow. Second operand 3 states and 280 transitions. [2025-04-29 11:07:53,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 226 flow [2025-04-29 11:07:53,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:53,004 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 203 flow [2025-04-29 11:07:53,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=203, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-04-29 11:07:53,005 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, -3 predicate places. [2025-04-29 11:07:53,005 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 203 flow [2025-04-29 11:07:53,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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:07:53,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:53,006 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] [2025-04-29 11:07:53,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:07:53,006 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:53,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash 896327980, now seen corresponding path program 1 times [2025-04-29 11:07:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:53,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511243205] [2025-04-29 11:07:53,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:53,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:53,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:07:53,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:07:53,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:53,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:53,340 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:07:53,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:53,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511243205] [2025-04-29 11:07:53,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511243205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:53,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:53,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:53,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599447351] [2025-04-29 11:07:53,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:53,342 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:53,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:53,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:53,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:53,437 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 100 [2025-04-29 11:07:53,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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:07:53,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:53,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 100 [2025-04-29 11:07:53,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:53,609 INFO L116 PetriNetUnfolderBase]: 231/841 cut-off events. [2025-04-29 11:07:53,610 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:53,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 841 events. 231/841 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4805 event pairs, 96 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1327. Up to 348 conditions per place. [2025-04-29 11:07:53,614 INFO L140 encePairwiseOnDemand]: 84/100 looper letters, 51 selfloop transitions, 41 changer transitions 0/159 dead transitions. [2025-04-29 11:07:53,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 159 transitions, 515 flow [2025-04-29 11:07:53,615 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 525 transitions. [2025-04-29 11:07:53,616 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-04-29 11:07:53,616 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 203 flow. Second operand 6 states and 525 transitions. [2025-04-29 11:07:53,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 159 transitions, 515 flow [2025-04-29 11:07:53,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 159 transitions, 515 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:53,619 INFO L231 Difference]: Finished difference. Result has 109 places, 137 transitions, 461 flow [2025-04-29 11:07:53,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=109, PETRI_TRANSITIONS=137} [2025-04-29 11:07:53,619 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 6 predicate places. [2025-04-29 11:07:53,619 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 137 transitions, 461 flow [2025-04-29 11:07:53,620 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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:07:53,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:53,620 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:07:53,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:07:53,620 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:53,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:53,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1506504073, now seen corresponding path program 1 times [2025-04-29 11:07:53,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:53,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265029972] [2025-04-29 11:07:53,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:53,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:07:53,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:07:53,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:53,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:53,850 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:07:53,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:53,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265029972] [2025-04-29 11:07:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265029972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:53,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:53,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997699182] [2025-04-29 11:07:53,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:53,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:53,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:53,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:53,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:53,967 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 100 [2025-04-29 11:07:53,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 137 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:07:53,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:53,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 100 [2025-04-29 11:07:53,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,167 INFO L116 PetriNetUnfolderBase]: 285/1130 cut-off events. [2025-04-29 11:07:54,167 INFO L117 PetriNetUnfolderBase]: For 355/425 co-relation queries the response was YES. [2025-04-29 11:07:54,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2398 conditions, 1130 events. 285/1130 cut-off events. For 355/425 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7609 event pairs, 29 based on Foata normal form. 31/1127 useless extension candidates. Maximal degree in co-relation 2361. Up to 272 conditions per place. [2025-04-29 11:07:54,174 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 71 selfloop transitions, 48 changer transitions 0/212 dead transitions. [2025-04-29 11:07:54,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 212 transitions, 963 flow [2025-04-29 11:07:54,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 555 transitions. [2025-04-29 11:07:54,177 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.925 [2025-04-29 11:07:54,177 INFO L175 Difference]: Start difference. First operand has 109 places, 137 transitions, 461 flow. Second operand 6 states and 555 transitions. [2025-04-29 11:07:54,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 212 transitions, 963 flow [2025-04-29 11:07:54,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 212 transitions, 963 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:54,186 INFO L231 Difference]: Finished difference. Result has 119 places, 183 transitions, 867 flow [2025-04-29 11:07:54,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=867, PETRI_PLACES=119, PETRI_TRANSITIONS=183} [2025-04-29 11:07:54,189 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 16 predicate places. [2025-04-29 11:07:54,189 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 183 transitions, 867 flow [2025-04-29 11:07:54,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 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:07:54,189 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,190 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:07:54,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:07:54,190 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:54,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,191 INFO L85 PathProgramCache]: Analyzing trace with hash 220597733, now seen corresponding path program 1 times [2025-04-29 11:07:54,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717148863] [2025-04-29 11:07:54,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:07:54,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:07:54,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,265 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:07:54,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,265 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717148863] [2025-04-29 11:07:54,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717148863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:07:54,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400035249] [2025-04-29 11:07:54,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,266 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:54,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:54,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:54,269 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 100 [2025-04-29 11:07:54,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 183 transitions, 867 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:07:54,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:54,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 100 [2025-04-29 11:07:54,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,309 INFO L116 PetriNetUnfolderBase]: 39/282 cut-off events. [2025-04-29 11:07:54,309 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-29 11:07:54,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 282 events. 39/282 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 966 event pairs, 4 based on Foata normal form. 2/271 useless extension candidates. Maximal degree in co-relation 499. Up to 64 conditions per place. [2025-04-29 11:07:54,311 INFO L140 encePairwiseOnDemand]: 96/100 looper letters, 2 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-04-29 11:07:54,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 405 flow [2025-04-29 11:07:54,312 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:54,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2025-04-29 11:07:54,313 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9666666666666667 [2025-04-29 11:07:54,313 INFO L175 Difference]: Start difference. First operand has 119 places, 183 transitions, 867 flow. Second operand 3 states and 290 transitions. [2025-04-29 11:07:54,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 405 flow [2025-04-29 11:07:54,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 116 transitions, 355 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-04-29 11:07:54,318 INFO L231 Difference]: Finished difference. Result has 112 places, 116 transitions, 351 flow [2025-04-29 11:07:54,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=112, PETRI_TRANSITIONS=116} [2025-04-29 11:07:54,319 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 9 predicate places. [2025-04-29 11:07:54,319 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 116 transitions, 351 flow [2025-04-29 11:07:54,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:07:54,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,320 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] [2025-04-29 11:07:54,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:07:54,320 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:54,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1414182194, now seen corresponding path program 1 times [2025-04-29 11:07:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44391352] [2025-04-29 11:07:54,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:07:54,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:07:54,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,559 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:07:54,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44391352] [2025-04-29 11:07:54,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44391352] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:54,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231644309] [2025-04-29 11:07:54,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,560 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:54,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:54,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:54,630 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 100 [2025-04-29 11:07:54,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 116 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 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:07:54,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:54,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 100 [2025-04-29 11:07:54,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,716 INFO L116 PetriNetUnfolderBase]: 93/478 cut-off events. [2025-04-29 11:07:54,717 INFO L117 PetriNetUnfolderBase]: For 90/102 co-relation queries the response was YES. [2025-04-29 11:07:54,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 478 events. 93/478 cut-off events. For 90/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2161 event pairs, 20 based on Foata normal form. 0/452 useless extension candidates. Maximal degree in co-relation 918. Up to 197 conditions per place. [2025-04-29 11:07:54,721 INFO L140 encePairwiseOnDemand]: 89/100 looper letters, 46 selfloop transitions, 22 changer transitions 0/137 dead transitions. [2025-04-29 11:07:54,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 137 transitions, 561 flow [2025-04-29 11:07:54,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:54,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:54,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 487 transitions. [2025-04-29 11:07:54,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8116666666666666 [2025-04-29 11:07:54,724 INFO L175 Difference]: Start difference. First operand has 112 places, 116 transitions, 351 flow. Second operand 6 states and 487 transitions. [2025-04-29 11:07:54,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 137 transitions, 561 flow [2025-04-29 11:07:54,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 137 transitions, 557 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:54,730 INFO L231 Difference]: Finished difference. Result has 121 places, 137 transitions, 529 flow [2025-04-29 11:07:54,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=529, PETRI_PLACES=121, PETRI_TRANSITIONS=137} [2025-04-29 11:07:54,731 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 18 predicate places. [2025-04-29 11:07:54,731 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 137 transitions, 529 flow [2025-04-29 11:07:54,731 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.33333333333333) internal successors, (452), 6 states have internal predecessors, (452), 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:07:54,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,731 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] [2025-04-29 11:07:54,732 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:07:54,732 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:54,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2065330097, now seen corresponding path program 1 times [2025-04-29 11:07:54,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827780086] [2025-04-29 11:07:54,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:07:54,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:07:54,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:54,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827780086] [2025-04-29 11:07:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827780086] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631029631] [2025-04-29 11:07:54,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:54,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:55,020 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 100 [2025-04-29 11:07:55,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 137 transitions, 529 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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:07:55,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:55,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 100 [2025-04-29 11:07:55,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:55,151 INFO L116 PetriNetUnfolderBase]: 195/731 cut-off events. [2025-04-29 11:07:55,151 INFO L117 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2025-04-29 11:07:55,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1826 conditions, 731 events. 195/731 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4000 event pairs, 12 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 1782. Up to 295 conditions per place. [2025-04-29 11:07:55,155 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 56 selfloop transitions, 52 changer transitions 13/194 dead transitions. [2025-04-29 11:07:55,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 194 transitions, 1036 flow [2025-04-29 11:07:55,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:55,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-04-29 11:07:55,184 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.885 [2025-04-29 11:07:55,184 INFO L175 Difference]: Start difference. First operand has 121 places, 137 transitions, 529 flow. Second operand 6 states and 531 transitions. [2025-04-29 11:07:55,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 194 transitions, 1036 flow [2025-04-29 11:07:55,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 194 transitions, 998 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:55,189 INFO L231 Difference]: Finished difference. Result has 131 places, 177 transitions, 944 flow [2025-04-29 11:07:55,190 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=131, PETRI_TRANSITIONS=177} [2025-04-29 11:07:55,190 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 28 predicate places. [2025-04-29 11:07:55,190 INFO L485 AbstractCegarLoop]: Abstraction has has 131 places, 177 transitions, 944 flow [2025-04-29 11:07:55,191 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 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:07:55,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:55,191 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] [2025-04-29 11:07:55,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:07:55,191 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:55,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1186795928, now seen corresponding path program 1 times [2025-04-29 11:07:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:55,192 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147379842] [2025-04-29 11:07:55,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:55,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:07:55,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:07:55,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:55,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:55,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:55,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:55,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147379842] [2025-04-29 11:07:55,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147379842] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:55,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:55,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:07:55,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679124827] [2025-04-29 11:07:55,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:55,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:07:55,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:55,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:07:55,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:07:55,801 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 100 [2025-04-29 11:07:55,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 177 transitions, 944 flow. Second operand has 12 states, 12 states have (on average 64.25) internal successors, (771), 12 states have internal predecessors, (771), 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:07:55,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:55,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 100 [2025-04-29 11:07:55,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:56,140 INFO L116 PetriNetUnfolderBase]: 189/693 cut-off events. [2025-04-29 11:07:56,141 INFO L117 PetriNetUnfolderBase]: For 730/770 co-relation queries the response was YES. [2025-04-29 11:07:56,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 693 events. 189/693 cut-off events. For 730/770 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3787 event pairs, 18 based on Foata normal form. 21/707 useless extension candidates. Maximal degree in co-relation 2145. Up to 193 conditions per place. [2025-04-29 11:07:56,145 INFO L140 encePairwiseOnDemand]: 85/100 looper letters, 115 selfloop transitions, 39 changer transitions 20/231 dead transitions. [2025-04-29 11:07:56,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 231 transitions, 1676 flow [2025-04-29 11:07:56,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:07:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:07:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 942 transitions. [2025-04-29 11:07:56,149 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6728571428571428 [2025-04-29 11:07:56,149 INFO L175 Difference]: Start difference. First operand has 131 places, 177 transitions, 944 flow. Second operand 14 states and 942 transitions. [2025-04-29 11:07:56,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 231 transitions, 1676 flow [2025-04-29 11:07:56,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 231 transitions, 1625 flow, removed 18 selfloop flow, removed 3 redundant places. [2025-04-29 11:07:56,160 INFO L231 Difference]: Finished difference. Result has 147 places, 185 transitions, 1088 flow [2025-04-29 11:07:56,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1088, PETRI_PLACES=147, PETRI_TRANSITIONS=185} [2025-04-29 11:07:56,160 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 44 predicate places. [2025-04-29 11:07:56,161 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 185 transitions, 1088 flow [2025-04-29 11:07:56,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 64.25) internal successors, (771), 12 states have internal predecessors, (771), 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:07:56,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:56,161 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] [2025-04-29 11:07:56,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:07:56,161 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:56,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1707877613, now seen corresponding path program 1 times [2025-04-29 11:07:56,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:56,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843414988] [2025-04-29 11:07:56,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:56,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:56,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:07:56,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:07:56,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:56,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:56,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:56,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:56,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843414988] [2025-04-29 11:07:56,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843414988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:56,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:56,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:07:56,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909756889] [2025-04-29 11:07:56,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:56,468 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:07:56,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:56,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:07:56,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:07:56,857 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 100 [2025-04-29 11:07:56,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 185 transitions, 1088 flow. Second operand has 12 states, 12 states have (on average 70.75) internal successors, (849), 12 states have internal predecessors, (849), 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:07:56,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:56,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 100 [2025-04-29 11:07:56,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:57,216 INFO L116 PetriNetUnfolderBase]: 175/635 cut-off events. [2025-04-29 11:07:57,216 INFO L117 PetriNetUnfolderBase]: For 1067/1101 co-relation queries the response was YES. [2025-04-29 11:07:57,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 635 events. 175/635 cut-off events. For 1067/1101 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3312 event pairs, 4 based on Foata normal form. 23/656 useless extension candidates. Maximal degree in co-relation 2216. Up to 126 conditions per place. [2025-04-29 11:07:57,220 INFO L140 encePairwiseOnDemand]: 82/100 looper letters, 87 selfloop transitions, 68 changer transitions 11/231 dead transitions. [2025-04-29 11:07:57,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 231 transitions, 1793 flow [2025-04-29 11:07:57,221 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:07:57,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:07:57,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 983 transitions. [2025-04-29 11:07:57,223 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7561538461538462 [2025-04-29 11:07:57,223 INFO L175 Difference]: Start difference. First operand has 147 places, 185 transitions, 1088 flow. Second operand 13 states and 983 transitions. [2025-04-29 11:07:57,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 231 transitions, 1793 flow [2025-04-29 11:07:57,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 231 transitions, 1751 flow, removed 3 selfloop flow, removed 9 redundant places. [2025-04-29 11:07:57,234 INFO L231 Difference]: Finished difference. Result has 154 places, 193 transitions, 1380 flow [2025-04-29 11:07:57,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1380, PETRI_PLACES=154, PETRI_TRANSITIONS=193} [2025-04-29 11:07:57,235 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 51 predicate places. [2025-04-29 11:07:57,235 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 193 transitions, 1380 flow [2025-04-29 11:07:57,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 70.75) internal successors, (849), 12 states have internal predecessors, (849), 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:07:57,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:57,236 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] [2025-04-29 11:07:57,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:07:57,236 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:57,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash 441260473, now seen corresponding path program 1 times [2025-04-29 11:07:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:57,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417800988] [2025-04-29 11:07:57,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:57,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:57,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:07:57,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:07:57,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:57,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:57,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:57,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417800988] [2025-04-29 11:07:57,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417800988] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:57,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:57,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:07:57,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115762181] [2025-04-29 11:07:57,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:57,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:07:57,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:57,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:07:57,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:07:57,849 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 100 [2025-04-29 11:07:57,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 193 transitions, 1380 flow. Second operand has 12 states, 12 states have (on average 64.66666666666667) internal successors, (776), 12 states have internal predecessors, (776), 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:07:57,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:57,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 100 [2025-04-29 11:07:57,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:58,216 INFO L116 PetriNetUnfolderBase]: 170/656 cut-off events. [2025-04-29 11:07:58,216 INFO L117 PetriNetUnfolderBase]: For 1960/2028 co-relation queries the response was YES. [2025-04-29 11:07:58,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 656 events. 170/656 cut-off events. For 1960/2028 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3536 event pairs, 15 based on Foata normal form. 43/693 useless extension candidates. Maximal degree in co-relation 2526. Up to 192 conditions per place. [2025-04-29 11:07:58,219 INFO L140 encePairwiseOnDemand]: 86/100 looper letters, 122 selfloop transitions, 37 changer transitions 9/226 dead transitions. [2025-04-29 11:07:58,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 226 transitions, 2074 flow [2025-04-29 11:07:58,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:07:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:07:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 998 transitions. [2025-04-29 11:07:58,221 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6653333333333333 [2025-04-29 11:07:58,222 INFO L175 Difference]: Start difference. First operand has 154 places, 193 transitions, 1380 flow. Second operand 15 states and 998 transitions. [2025-04-29 11:07:58,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 226 transitions, 2074 flow [2025-04-29 11:07:58,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 226 transitions, 2044 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-29 11:07:58,233 INFO L231 Difference]: Finished difference. Result has 162 places, 191 transitions, 1408 flow [2025-04-29 11:07:58,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1350, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1408, PETRI_PLACES=162, PETRI_TRANSITIONS=191} [2025-04-29 11:07:58,234 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 59 predicate places. [2025-04-29 11:07:58,234 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 191 transitions, 1408 flow [2025-04-29 11:07:58,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 64.66666666666667) internal successors, (776), 12 states have internal predecessors, (776), 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:07:58,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:58,235 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] [2025-04-29 11:07:58,235 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:07:58,236 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:58,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:58,236 INFO L85 PathProgramCache]: Analyzing trace with hash -374705953, now seen corresponding path program 2 times [2025-04-29 11:07:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:58,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647557616] [2025-04-29 11:07:58,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:07:58,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:58,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-04-29 11:07:58,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 71 of 73 statements. [2025-04-29 11:07:58,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:07:58,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:58,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647557616] [2025-04-29 11:07:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647557616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:07:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606568768] [2025-04-29 11:07:58,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:58,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:07:58,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:58,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:07:58,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:07:58,846 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 100 [2025-04-29 11:07:58,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 191 transitions, 1408 flow. Second operand has 12 states, 12 states have (on average 64.66666666666667) internal successors, (776), 12 states have internal predecessors, (776), 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:07:58,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:58,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 100 [2025-04-29 11:07:58,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:59,181 INFO L116 PetriNetUnfolderBase]: 167/651 cut-off events. [2025-04-29 11:07:59,182 INFO L117 PetriNetUnfolderBase]: For 2165/2215 co-relation queries the response was YES. [2025-04-29 11:07:59,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 651 events. 167/651 cut-off events. For 2165/2215 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3527 event pairs, 15 based on Foata normal form. 28/673 useless extension candidates. Maximal degree in co-relation 2594. Up to 192 conditions per place. [2025-04-29 11:07:59,185 INFO L140 encePairwiseOnDemand]: 86/100 looper letters, 122 selfloop transitions, 35 changer transitions 10/225 dead transitions. [2025-04-29 11:07:59,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 225 transitions, 2110 flow [2025-04-29 11:07:59,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:07:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:07:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1060 transitions. [2025-04-29 11:07:59,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6625 [2025-04-29 11:07:59,187 INFO L175 Difference]: Start difference. First operand has 162 places, 191 transitions, 1408 flow. Second operand 16 states and 1060 transitions. [2025-04-29 11:07:59,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 225 transitions, 2110 flow [2025-04-29 11:07:59,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 225 transitions, 2026 flow, removed 5 selfloop flow, removed 14 redundant places. [2025-04-29 11:07:59,198 INFO L231 Difference]: Finished difference. Result has 164 places, 189 transitions, 1384 flow [2025-04-29 11:07:59,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1384, PETRI_PLACES=164, PETRI_TRANSITIONS=189} [2025-04-29 11:07:59,198 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 61 predicate places. [2025-04-29 11:07:59,199 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 189 transitions, 1384 flow [2025-04-29 11:07:59,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 64.66666666666667) internal successors, (776), 12 states have internal predecessors, (776), 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:07:59,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:59,199 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] [2025-04-29 11:07:59,199 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:07:59,199 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:59,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:59,200 INFO L85 PathProgramCache]: Analyzing trace with hash -905669635, now seen corresponding path program 3 times [2025-04-29 11:07:59,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:59,200 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745374420] [2025-04-29 11:07:59,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:07:59,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:59,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 2 equivalence classes. [2025-04-29 11:07:59,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 71 of 73 statements. [2025-04-29 11:07:59,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:07:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:59,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:59,425 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745374420] [2025-04-29 11:07:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745374420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:59,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 11:07:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244730259] [2025-04-29 11:07:59,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:59,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:07:59,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:59,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:07:59,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:07:59,696 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 100 [2025-04-29 11:07:59,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 189 transitions, 1384 flow. Second operand has 12 states, 12 states have (on average 64.66666666666667) internal successors, (776), 12 states have internal predecessors, (776), 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:07:59,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:59,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 100 [2025-04-29 11:07:59,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:59,977 INFO L116 PetriNetUnfolderBase]: 165/642 cut-off events. [2025-04-29 11:07:59,978 INFO L117 PetriNetUnfolderBase]: For 2087/2119 co-relation queries the response was YES. [2025-04-29 11:07:59,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2586 conditions, 642 events. 165/642 cut-off events. For 2087/2119 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3426 event pairs, 15 based on Foata normal form. 13/649 useless extension candidates. Maximal degree in co-relation 2555. Up to 192 conditions per place. [2025-04-29 11:07:59,982 INFO L140 encePairwiseOnDemand]: 86/100 looper letters, 118 selfloop transitions, 34 changer transitions 10/220 dead transitions. [2025-04-29 11:07:59,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 220 transitions, 2052 flow [2025-04-29 11:07:59,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:07:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:07:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1118 transitions. [2025-04-29 11:07:59,985 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6576470588235294 [2025-04-29 11:07:59,985 INFO L175 Difference]: Start difference. First operand has 164 places, 189 transitions, 1384 flow. Second operand 17 states and 1118 transitions. [2025-04-29 11:07:59,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 220 transitions, 2052 flow [2025-04-29 11:07:59,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 220 transitions, 1968 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-04-29 11:07:59,997 INFO L231 Difference]: Finished difference. Result has 161 places, 184 transitions, 1331 flow [2025-04-29 11:07:59,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=100, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1331, PETRI_PLACES=161, PETRI_TRANSITIONS=184} [2025-04-29 11:07:59,999 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 58 predicate places. [2025-04-29 11:07:59,999 INFO L485 AbstractCegarLoop]: Abstraction has has 161 places, 184 transitions, 1331 flow [2025-04-29 11:07:59,999 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 64.66666666666667) internal successors, (776), 12 states have internal predecessors, (776), 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:07:59,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:59,999 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] [2025-04-29 11:08:00,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:08:00,000 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:08:00,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2021062055, now seen corresponding path program 1 times [2025-04-29 11:08:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:00,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598847156] [2025-04-29 11:08:00,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:00,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-29 11:08:00,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-29 11:08:00,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:00,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:00,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:00,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-04-29 11:08:00,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-04-29 11:08:00,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:00,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:00,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:00,057 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:00,058 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-29 11:08:00,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-29 11:08:00,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-29 11:08:00,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-29 11:08:00,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-29 11:08:00,059 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-29 11:08:00,060 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-29 11:08:00,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:08:00,061 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:00,121 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:00,121 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:00,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:00 BasicIcfg [2025-04-29 11:08:00,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:00,127 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:00,127 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:00,127 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:00,128 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:07:52" (3/4) ... [2025-04-29 11:08:00,128 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:00,183 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-29 11:08:00,209 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:00,210 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:00,210 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:00,210 INFO L158 Benchmark]: Toolchain (without parser) took 8653.78ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 112.0MB in the beginning and 427.7MB in the end (delta: -315.6MB). Peak memory consumption was 269.0MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,211 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:00,211 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.79ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.24ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:00,211 INFO L158 Benchmark]: Boogie Preprocessor took 28.21ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.3MB in the end (delta: 979.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:00,211 INFO L158 Benchmark]: RCFGBuilder took 300.05ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 79.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,211 INFO L158 Benchmark]: TraceAbstraction took 7974.33ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 78.7MB in the beginning and 173.8MB in the end (delta: -95.1MB). Peak memory consumption was 227.1MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,212 INFO L158 Benchmark]: Witness Printer took 82.77ms. Allocated memory is still 469.8MB. Free memory was 173.8MB in the beginning and 427.7MB in the end (delta: -253.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,212 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.79ms. Allocated memory is still 142.6MB. Free memory was 112.0MB in the beginning and 97.8MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.24ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 96.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.21ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 95.3MB in the end (delta: 979.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 300.05ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 79.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7974.33ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 78.7MB in the beginning and 173.8MB in the end (delta: -95.1MB). Peak memory consumption was 227.1MB. Max. memory is 16.1GB. * Witness Printer took 82.77ms. Allocated memory is still 469.8MB. Free memory was 173.8MB in the beginning and 427.7MB in the end (delta: -253.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 38]: Data race detected Data race detected The following path leads to a data race: [L12] 0 int *x; VAL [x={0:0}] [L13] 0 int *y; VAL [x={0:0}, y={0:0}] [L15] 0 pthread_mutex_t m = PTHREAD_MUTEX_INITIALIZER; VAL [m={1:0}, x={0:0}, y={0:0}] [L26] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L27] 0 int *z; VAL [m={1:0}, x={0:0}, y={0:0}] [L29] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L30] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L31] 0 z = y VAL [m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L33] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L36] EXPR 0 *x VAL [\at(arg, Pre)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L36] EXPR 0 \read(*x) VAL [\at(arg, Pre)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L36] 0 printf("%d\n",*x) VAL [\at(arg, Pre)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L19] EXPR 1 *x VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L19] 1 *x = 3 VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L38] EXPR 0 \read(*z) VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] [L20] EXPR 1 *y VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L20] 1 *y = 8 VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L38] 0 printf("%d\n",*z) VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}, z={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *y = 8 [20] * C: x = malloc(sizeof(int)) [29] * C: *x = 3 [19] * C: y = malloc(sizeof(int)) [30] * C: *x = 3 [19] * C: *x = 3 [19] * C: *x = 3 [19] and C: printf("%d\n",*z) [38] - UnprovableResult [Line: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 30]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 31]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 134 locations, 132 edges, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1685 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1367 mSDsluCounter, 1529 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1472 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5902 IncrementalHoareTripleChecker+Invalid, 6163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 57 mSDtfsCounter, 5902 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1408occurred in iteration=12, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 776 NumberOfCodeBlocks, 772 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 688 ConstructedInterpolants, 0 QuantifiedInterpolants, 2810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:08:00,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)