./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 dbd0a32f8466e9a1ac86b6dfec2b7453fe6f40d8d953742d93d3d05c5ad7b7af --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:40:32,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:40:32,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:40:32,116 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:40:32,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:40:32,139 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:40:32,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:40:32,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:40:32,142 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:40:32,142 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:40:32,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:40:32,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:40:32,143 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:40:32,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:40:32,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:40:32,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:40:32,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:40:32,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:40:32,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:40:32,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:40:32,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:40:32,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:40:32,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:40:32,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:40:32,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:32,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:40:32,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:40:32,148 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-jdk21/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 -> dbd0a32f8466e9a1ac86b6dfec2b7453fe6f40d8d953742d93d3d05c5ad7b7af [2025-02-08 05:40:32,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:40:32,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:40:32,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:40:32,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:40:32,435 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:40:32,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c [2025-02-08 05:40:33,774 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed65483e1/fd4645538090486bbd98dae14163b40f/FLAG519b056c8 [2025-02-08 05:40:34,045 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:40:34,045 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-min-le-max.wvr.c [2025-02-08 05:40:34,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed65483e1/fd4645538090486bbd98dae14163b40f/FLAG519b056c8 [2025-02-08 05:40:34,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed65483e1/fd4645538090486bbd98dae14163b40f [2025-02-08 05:40:34,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:40:34,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:40:34,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:34,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:40:34,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:40:34,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c922ead and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34, skipping insertion in model container [2025-02-08 05:40:34,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:40:34,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:34,581 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:40:34,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:40:34,631 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:40:34,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34 WrapperNode [2025-02-08 05:40:34,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:40:34,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:34,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:40:34,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:40:34,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,670 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-02-08 05:40:34,671 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:40:34,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:40:34,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:40:34,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:40:34,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,692 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:40:34,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:40:34,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:40:34,698 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:40:34,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (1/1) ... [2025-02-08 05:40:34,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:40:34,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:40:34,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:40:34,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:40:34,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:40:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:40:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:40:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:40:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:40:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-08 05:40:34,758 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-08 05:40:34,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:40:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:40:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:40:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:40:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:40:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:40:34,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:40:34,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:40:34,761 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:40:34,869 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:40:34,872 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:40:35,345 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:40:35,346 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:40:35,508 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:40:35,508 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:40:35,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:35 BoogieIcfgContainer [2025-02-08 05:40:35,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:40:35,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:40:35,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:40:35,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:40:35,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:40:34" (1/3) ... [2025-02-08 05:40:35,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f0d15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:35, skipping insertion in model container [2025-02-08 05:40:35,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:40:34" (2/3) ... [2025-02-08 05:40:35,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f0d15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:40:35, skipping insertion in model container [2025-02-08 05:40:35,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:35" (3/3) ... [2025-02-08 05:40:35,520 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-le-max.wvr.c [2025-02-08 05:40:35,534 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:40:35,537 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-le-max.wvr.c that has 4 procedures, 210 locations, 1 initial locations, 3 loop locations, and 29 error locations. [2025-02-08 05:40:35,537 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:40:35,619 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:40:35,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 219 places, 218 transitions, 457 flow [2025-02-08 05:40:35,752 INFO L124 PetriNetUnfolderBase]: 9/215 cut-off events. [2025-02-08 05:40:35,754 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-08 05:40:35,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 215 events. 9/215 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 235 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 187. Up to 2 conditions per place. [2025-02-08 05:40:35,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 219 places, 218 transitions, 457 flow [2025-02-08 05:40:35,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 198 transitions, 414 flow [2025-02-08 05:40:35,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:40:35,780 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@521591e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:40:35,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2025-02-08 05:40:35,787 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:40:35,787 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-08 05:40:35,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:40:35,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:35,788 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] [2025-02-08 05:40:35,788 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:35,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1027364281, now seen corresponding path program 1 times [2025-02-08 05:40:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:35,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663836166] [2025-02-08 05:40:35,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:35,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:35,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:40:35,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:40:35,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:35,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:35,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663836166] [2025-02-08 05:40:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663836166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:35,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:35,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329965046] [2025-02-08 05:40:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:35,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:36,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:36,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:36,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 218 [2025-02-08 05:40:36,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 198 transitions, 414 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-02-08 05:40:36,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:36,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 218 [2025-02-08 05:40:36,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:36,220 INFO L124 PetriNetUnfolderBase]: 58/390 cut-off events. [2025-02-08 05:40:36,221 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2025-02-08 05:40:36,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 390 events. 58/390 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1345 event pairs, 38 based on Foata normal form. 3/342 useless extension candidates. Maximal degree in co-relation 346. Up to 100 conditions per place. [2025-02-08 05:40:36,226 INFO L140 encePairwiseOnDemand]: 195/218 looper letters, 16 selfloop transitions, 2 changer transitions 3/177 dead transitions. [2025-02-08 05:40:36,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 177 transitions, 408 flow [2025-02-08 05:40:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-02-08 05:40:36,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669724770642202 [2025-02-08 05:40:36,244 INFO L175 Difference]: Start difference. First operand has 200 places, 198 transitions, 414 flow. Second operand 3 states and 567 transitions. [2025-02-08 05:40:36,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 177 transitions, 408 flow [2025-02-08 05:40:36,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 177 transitions, 396 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-08 05:40:36,257 INFO L231 Difference]: Finished difference. Result has 180 places, 174 transitions, 358 flow [2025-02-08 05:40:36,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=180, PETRI_TRANSITIONS=174} [2025-02-08 05:40:36,265 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -20 predicate places. [2025-02-08 05:40:36,265 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 174 transitions, 358 flow [2025-02-08 05:40:36,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-02-08 05:40:36,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:36,266 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] [2025-02-08 05:40:36,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:40:36,267 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:36,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:36,267 INFO L85 PathProgramCache]: Analyzing trace with hash 164075529, now seen corresponding path program 1 times [2025-02-08 05:40:36,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:36,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420856895] [2025-02-08 05:40:36,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:36,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:36,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 05:40:36,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 05:40:36,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:36,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:36,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:36,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:36,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420856895] [2025-02-08 05:40:36,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420856895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:36,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:36,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:36,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308687948] [2025-02-08 05:40:36,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:36,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:36,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:36,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:36,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:36,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 218 [2025-02-08 05:40:36,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 174 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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-02-08 05:40:36,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:36,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 218 [2025-02-08 05:40:36,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:36,495 INFO L124 PetriNetUnfolderBase]: 99/452 cut-off events. [2025-02-08 05:40:36,496 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-02-08 05:40:36,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 452 events. 99/452 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1800 event pairs, 71 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 612. Up to 163 conditions per place. [2025-02-08 05:40:36,498 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 17 selfloop transitions, 1 changer transitions 0/170 dead transitions. [2025-02-08 05:40:36,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 170 transitions, 386 flow [2025-02-08 05:40:36,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:36,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:36,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2025-02-08 05:40:36,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8318042813455657 [2025-02-08 05:40:36,501 INFO L175 Difference]: Start difference. First operand has 180 places, 174 transitions, 358 flow. Second operand 3 states and 544 transitions. [2025-02-08 05:40:36,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 170 transitions, 386 flow [2025-02-08 05:40:36,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 170 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:36,506 INFO L231 Difference]: Finished difference. Result has 173 places, 170 transitions, 348 flow [2025-02-08 05:40:36,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=173, PETRI_TRANSITIONS=170} [2025-02-08 05:40:36,509 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -27 predicate places. [2025-02-08 05:40:36,509 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 170 transitions, 348 flow [2025-02-08 05:40:36,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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-02-08 05:40:36,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:36,510 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-02-08 05:40:36,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:40:36,510 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:36,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:36,513 INFO L85 PathProgramCache]: Analyzing trace with hash -818192068, now seen corresponding path program 1 times [2025-02-08 05:40:36,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:36,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205943749] [2025-02-08 05:40:36,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:36,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:36,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:40:36,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:40:36,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:36,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:36,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205943749] [2025-02-08 05:40:36,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205943749] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:36,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98040877] [2025-02-08 05:40:36,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:36,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:36,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:36,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 218 [2025-02-08 05:40:36,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 170 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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-02-08 05:40:36,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:36,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 218 [2025-02-08 05:40:36,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:36,717 INFO L124 PetriNetUnfolderBase]: 28/260 cut-off events. [2025-02-08 05:40:36,717 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:40:36,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 260 events. 28/260 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 593 event pairs, 15 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 294. Up to 52 conditions per place. [2025-02-08 05:40:36,722 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 14 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-02-08 05:40:36,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 169 transitions, 378 flow [2025-02-08 05:40:36,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:36,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:36,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2025-02-08 05:40:36,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425076452599388 [2025-02-08 05:40:36,724 INFO L175 Difference]: Start difference. First operand has 173 places, 170 transitions, 348 flow. Second operand 3 states and 551 transitions. [2025-02-08 05:40:36,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 169 transitions, 378 flow [2025-02-08 05:40:36,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 169 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:36,731 INFO L231 Difference]: Finished difference. Result has 173 places, 169 transitions, 349 flow [2025-02-08 05:40:36,731 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=173, PETRI_TRANSITIONS=169} [2025-02-08 05:40:36,733 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -27 predicate places. [2025-02-08 05:40:36,733 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 169 transitions, 349 flow [2025-02-08 05:40:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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-02-08 05:40:36,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:36,734 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-02-08 05:40:36,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:40:36,734 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1989566193, now seen corresponding path program 1 times [2025-02-08 05:40:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725711794] [2025-02-08 05:40:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:36,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-08 05:40:36,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-08 05:40:36,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:36,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:37,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:37,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725711794] [2025-02-08 05:40:37,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725711794] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:37,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:37,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:37,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721084666] [2025-02-08 05:40:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:37,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:37,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:37,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 218 [2025-02-08 05:40:37,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 169 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 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-02-08 05:40:37,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:37,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 218 [2025-02-08 05:40:37,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:37,630 INFO L124 PetriNetUnfolderBase]: 28/259 cut-off events. [2025-02-08 05:40:37,631 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:40:37,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 259 events. 28/259 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 588 event pairs, 15 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 310. Up to 63 conditions per place. [2025-02-08 05:40:37,632 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 25 selfloop transitions, 5 changer transitions 0/168 dead transitions. [2025-02-08 05:40:37,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 168 transitions, 407 flow [2025-02-08 05:40:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1021 transitions. [2025-02-08 05:40:37,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7805810397553516 [2025-02-08 05:40:37,636 INFO L175 Difference]: Start difference. First operand has 173 places, 169 transitions, 349 flow. Second operand 6 states and 1021 transitions. [2025-02-08 05:40:37,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 168 transitions, 407 flow [2025-02-08 05:40:37,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 168 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:37,642 INFO L231 Difference]: Finished difference. Result has 175 places, 168 transitions, 353 flow [2025-02-08 05:40:37,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=353, PETRI_PLACES=175, PETRI_TRANSITIONS=168} [2025-02-08 05:40:37,643 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -25 predicate places. [2025-02-08 05:40:37,644 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 168 transitions, 353 flow [2025-02-08 05:40:37,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 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-02-08 05:40:37,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:37,645 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] [2025-02-08 05:40:37,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:40:37,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:37,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash -879488586, now seen corresponding path program 1 times [2025-02-08 05:40:37,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:37,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700234333] [2025-02-08 05:40:37,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:37,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:37,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:40:37,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:40:37,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:37,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:37,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:37,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:37,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700234333] [2025-02-08 05:40:37,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700234333] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:37,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:37,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:37,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002072472] [2025-02-08 05:40:37,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:37,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:37,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:37,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:37,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:37,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 218 [2025-02-08 05:40:37,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 168 transitions, 353 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-02-08 05:40:37,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:37,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 218 [2025-02-08 05:40:37,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:37,774 INFO L124 PetriNetUnfolderBase]: 28/257 cut-off events. [2025-02-08 05:40:37,774 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:40:37,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 257 events. 28/257 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 583 event pairs, 15 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 306. Up to 50 conditions per place. [2025-02-08 05:40:37,776 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 13 selfloop transitions, 1 changer transitions 0/166 dead transitions. [2025-02-08 05:40:37,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 166 transitions, 377 flow [2025-02-08 05:40:37,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2025-02-08 05:40:37,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8501529051987767 [2025-02-08 05:40:37,779 INFO L175 Difference]: Start difference. First operand has 175 places, 168 transitions, 353 flow. Second operand 3 states and 556 transitions. [2025-02-08 05:40:37,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 166 transitions, 377 flow [2025-02-08 05:40:37,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 166 transitions, 367 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:40:37,784 INFO L231 Difference]: Finished difference. Result has 170 places, 166 transitions, 341 flow [2025-02-08 05:40:37,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=170, PETRI_TRANSITIONS=166} [2025-02-08 05:40:37,786 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -30 predicate places. [2025-02-08 05:40:37,786 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 166 transitions, 341 flow [2025-02-08 05:40:37,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 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-02-08 05:40:37,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:37,787 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-02-08 05:40:37,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:40:37,787 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:37,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:37,788 INFO L85 PathProgramCache]: Analyzing trace with hash 847185637, now seen corresponding path program 1 times [2025-02-08 05:40:37,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:37,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659590115] [2025-02-08 05:40:37,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:37,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:40:37,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:40:37,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:37,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:38,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:38,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659590115] [2025-02-08 05:40:38,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659590115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:38,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:38,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:40:38,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700190395] [2025-02-08 05:40:38,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:38,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:40:38,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:38,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:40:38,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:40:38,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 218 [2025-02-08 05:40:38,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 166 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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-02-08 05:40:38,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:38,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 218 [2025-02-08 05:40:38,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:38,381 INFO L124 PetriNetUnfolderBase]: 28/255 cut-off events. [2025-02-08 05:40:38,382 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:40:38,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 255 events. 28/255 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 579 event pairs, 15 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 299. Up to 53 conditions per place. [2025-02-08 05:40:38,383 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 21 selfloop transitions, 4 changer transitions 0/164 dead transitions. [2025-02-08 05:40:38,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 164 transitions, 387 flow [2025-02-08 05:40:38,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:40:38,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:40:38,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1041 transitions. [2025-02-08 05:40:38,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7958715596330275 [2025-02-08 05:40:38,388 INFO L175 Difference]: Start difference. First operand has 170 places, 166 transitions, 341 flow. Second operand 6 states and 1041 transitions. [2025-02-08 05:40:38,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 164 transitions, 387 flow [2025-02-08 05:40:38,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 164 transitions, 386 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:40:38,392 INFO L231 Difference]: Finished difference. Result has 172 places, 164 transitions, 344 flow [2025-02-08 05:40:38,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=172, PETRI_TRANSITIONS=164} [2025-02-08 05:40:38,393 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -28 predicate places. [2025-02-08 05:40:38,393 INFO L471 AbstractCegarLoop]: Abstraction has has 172 places, 164 transitions, 344 flow [2025-02-08 05:40:38,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 170.16666666666666) internal successors, (1021), 6 states have internal predecessors, (1021), 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-02-08 05:40:38,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:38,399 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:38,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:40:38,399 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:38,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1025307908, now seen corresponding path program 1 times [2025-02-08 05:40:38,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:38,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763473481] [2025-02-08 05:40:38,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:38,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:38,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:40:38,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:40:38,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:38,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:38,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:38,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763473481] [2025-02-08 05:40:38,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763473481] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:38,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:38,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:38,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378640067] [2025-02-08 05:40:38,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:38,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:38,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:38,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:38,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:38,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 218 [2025-02-08 05:40:38,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 164 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-02-08 05:40:38,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:38,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 218 [2025-02-08 05:40:38,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:38,535 INFO L124 PetriNetUnfolderBase]: 28/254 cut-off events. [2025-02-08 05:40:38,535 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:40:38,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 254 events. 28/254 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 578 event pairs, 15 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 291. Up to 50 conditions per place. [2025-02-08 05:40:38,537 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 12 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-02-08 05:40:38,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 163 transitions, 370 flow [2025-02-08 05:40:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-02-08 05:40:38,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8486238532110092 [2025-02-08 05:40:38,540 INFO L175 Difference]: Start difference. First operand has 172 places, 164 transitions, 344 flow. Second operand 3 states and 555 transitions. [2025-02-08 05:40:38,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 163 transitions, 370 flow [2025-02-08 05:40:38,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 163 transitions, 363 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:40:38,545 INFO L231 Difference]: Finished difference. Result has 169 places, 163 transitions, 339 flow [2025-02-08 05:40:38,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=169, PETRI_TRANSITIONS=163} [2025-02-08 05:40:38,546 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -31 predicate places. [2025-02-08 05:40:38,547 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 163 transitions, 339 flow [2025-02-08 05:40:38,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-02-08 05:40:38,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:38,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:38,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:40:38,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:38,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash -784742252, now seen corresponding path program 1 times [2025-02-08 05:40:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404195266] [2025-02-08 05:40:38,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:38,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-08 05:40:38,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-08 05:40:38,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:38,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:38,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:38,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:38,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404195266] [2025-02-08 05:40:38,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404195266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:38,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:38,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:38,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084295654] [2025-02-08 05:40:38,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:38,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:38,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:38,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:38,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:38,646 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 218 [2025-02-08 05:40:38,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 163 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-02-08 05:40:38,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:38,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 218 [2025-02-08 05:40:38,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:38,705 INFO L124 PetriNetUnfolderBase]: 28/253 cut-off events. [2025-02-08 05:40:38,705 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:40:38,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 253 events. 28/253 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 577 event pairs, 15 based on Foata normal form. 0/245 useless extension candidates. Maximal degree in co-relation 289. Up to 50 conditions per place. [2025-02-08 05:40:38,708 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 12 selfloop transitions, 2 changer transitions 0/162 dead transitions. [2025-02-08 05:40:38,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 162 transitions, 365 flow [2025-02-08 05:40:38,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:38,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:38,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-02-08 05:40:38,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8486238532110092 [2025-02-08 05:40:38,710 INFO L175 Difference]: Start difference. First operand has 169 places, 163 transitions, 339 flow. Second operand 3 states and 555 transitions. [2025-02-08 05:40:38,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 162 transitions, 365 flow [2025-02-08 05:40:38,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:38,714 INFO L231 Difference]: Finished difference. Result has 168 places, 162 transitions, 337 flow [2025-02-08 05:40:38,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=168, PETRI_TRANSITIONS=162} [2025-02-08 05:40:38,717 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -32 predicate places. [2025-02-08 05:40:38,717 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 337 flow [2025-02-08 05:40:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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-02-08 05:40:38,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:40:38,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:38,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:40:38,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 45 more)] === [2025-02-08 05:40:38,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:40:38,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1806206292, now seen corresponding path program 1 times [2025-02-08 05:40:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:40:38,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279733701] [2025-02-08 05:40:38,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:40:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:40:38,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-08 05:40:38,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-08 05:40:38,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:40:38,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:40:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:40:38,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:40:38,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279733701] [2025-02-08 05:40:38,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279733701] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:40:38,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:40:38,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:40:38,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105371126] [2025-02-08 05:40:38,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:40:38,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:40:38,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:40:38,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:40:38,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:40:38,811 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 218 [2025-02-08 05:40:38,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 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-02-08 05:40:38,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:40:38,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 218 [2025-02-08 05:40:38,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:40:38,865 INFO L124 PetriNetUnfolderBase]: 28/252 cut-off events. [2025-02-08 05:40:38,865 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-02-08 05:40:38,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 252 events. 28/252 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 577 event pairs, 15 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 285. Up to 47 conditions per place. [2025-02-08 05:40:38,867 INFO L140 encePairwiseOnDemand]: 216/218 looper letters, 0 selfloop transitions, 0 changer transitions 161/161 dead transitions. [2025-02-08 05:40:38,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 161 transitions, 355 flow [2025-02-08 05:40:38,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:40:38,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:40:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions. [2025-02-08 05:40:38,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8608562691131498 [2025-02-08 05:40:38,869 INFO L175 Difference]: Start difference. First operand has 168 places, 162 transitions, 337 flow. Second operand 3 states and 563 transitions. [2025-02-08 05:40:38,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 161 transitions, 355 flow [2025-02-08 05:40:38,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 161 transitions, 351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:40:38,873 INFO L231 Difference]: Finished difference. Result has 167 places, 0 transitions, 0 flow [2025-02-08 05:40:38,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=167, PETRI_TRANSITIONS=0} [2025-02-08 05:40:38,874 INFO L279 CegarLoopForPetriNet]: 200 programPoint places, -33 predicate places. [2025-02-08 05:40:38,874 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 0 transitions, 0 flow [2025-02-08 05:40:38,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 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-02-08 05:40:38,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 49 remaining) [2025-02-08 05:40:38,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 49 remaining) [2025-02-08 05:40:38,878 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (42 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (41 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (40 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (39 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (37 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (36 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (34 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (33 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (32 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 49 remaining) [2025-02-08 05:40:38,879 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (16 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (14 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (13 of 49 remaining) [2025-02-08 05:40:38,880 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 49 remaining) [2025-02-08 05:40:38,883 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (10 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (9 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (6 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (3 of 49 remaining) [2025-02-08 05:40:38,884 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 49 remaining) [2025-02-08 05:40:38,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 49 remaining) [2025-02-08 05:40:38,885 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 49 remaining) [2025-02-08 05:40:38,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:40:38,885 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:40:38,891 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:40:38,891 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:40:38,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:40:38 BasicIcfg [2025-02-08 05:40:38,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:40:38,899 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:40:38,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:40:38,901 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:40:38,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:40:35" (3/4) ... [2025-02-08 05:40:38,903 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:40:38,906 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:40:38,906 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:40:38,906 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-08 05:40:38,912 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-02-08 05:40:38,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:40:38,914 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:40:38,915 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:40:39,001 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:40:39,002 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:40:39,002 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:40:39,003 INFO L158 Benchmark]: Toolchain (without parser) took 4640.83ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 107.4MB in the beginning and 99.0MB in the end (delta: 8.4MB). Peak memory consumption was 171.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:39,003 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:39,003 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.25ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 94.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:39,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.50ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:40:39,004 INFO L158 Benchmark]: Boogie Preprocessor took 24.96ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:39,004 INFO L158 Benchmark]: IcfgBuilder took 811.42ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 48.6MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:40:39,004 INFO L158 Benchmark]: TraceAbstraction took 3386.98ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 48.6MB in the beginning and 105.0MB in the end (delta: -56.3MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. [2025-02-08 05:40:39,005 INFO L158 Benchmark]: Witness Printer took 102.57ms. Allocated memory is still 310.4MB. Free memory was 105.0MB in the beginning and 99.0MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:40:39,019 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.54ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.25ms. Allocated memory is still 142.6MB. Free memory was 107.4MB in the beginning and 94.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.50ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 93.3MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.96ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 91.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 811.42ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 48.6MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3386.98ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 48.6MB in the beginning and 105.0MB in the end (delta: -56.3MB). Peak memory consumption was 112.6MB. Max. memory is 16.1GB. * Witness Printer took 102.57ms. Allocated memory is still 310.4MB. Free memory was 105.0MB in the beginning and 99.0MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 261 locations, 49 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: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 252 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 434 IncrementalHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 30 mSDtfsCounter, 434 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred in iteration=0, InterpolantAutomatonStates: 33, 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, 1.3s InterpolantComputationTime, 609 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 810 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:40:39,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE