./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i --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/goblint-regression/02-base_26-malloc_struct.i -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 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:30:10,089 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:30:10,125 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:30:10,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:30:10,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:30:10,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:30:10,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:30:10,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:30:10,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:30:10,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:30:10,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:30:10,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:30:10,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:30:10,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:10,151 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:30:10,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:30:10,151 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 -> 71b70db56146daaa7371fed58b975e1add8fa8ab54b0a1b08c677a431a619350 [2025-02-08 05:30:10,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:30:10,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:30:10,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:30:10,349 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:30:10,350 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:30:10,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2025-02-08 05:30:11,537 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5f8aa8d/21b7c520fa044b158612425fe6c4cd05/FLAG65227c158 [2025-02-08 05:30:11,812 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:30:11,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/02-base_26-malloc_struct.i [2025-02-08 05:30:11,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5f8aa8d/21b7c520fa044b158612425fe6c4cd05/FLAG65227c158 [2025-02-08 05:30:12,108 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5f8aa8d/21b7c520fa044b158612425fe6c4cd05 [2025-02-08 05:30:12,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:30:12,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:30:12,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:12,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:30:12,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:30:12,116 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58d6f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12, skipping insertion in model container [2025-02-08 05:30:12,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,141 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:30:12,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:12,486 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:30:12,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:30:12,571 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:30:12,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12 WrapperNode [2025-02-08 05:30:12,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:30:12,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:12,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:30:12,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:30:12,580 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:30:12" (1/1) ... [2025-02-08 05:30:12,598 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:30:12" (1/1) ... [2025-02-08 05:30:12,621 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2025-02-08 05:30:12,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:30:12,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:30:12,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:30:12,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:30:12,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,648 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,650 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:30:12,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:30:12,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:30:12,652 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:30:12,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (1/1) ... [2025-02-08 05:30:12,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:30:12,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:30:12,676 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:30:12,679 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:30:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:30:12,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:30:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:30:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:30:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:30:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:30:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:30:12,696 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:30:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:30:12,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:30:12,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:30:12,697 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:30:12,789 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:30:12,791 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:30:12,972 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:30:12,972 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:30:12,992 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:30:12,992 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:30:12,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:12 BoogieIcfgContainer [2025-02-08 05:30:12,992 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:30:12,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:30:12,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:30:12,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:30:12,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:30:12" (1/3) ... [2025-02-08 05:30:12,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b456b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:12, skipping insertion in model container [2025-02-08 05:30:12,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:30:12" (2/3) ... [2025-02-08 05:30:12,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b456b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:30:12, skipping insertion in model container [2025-02-08 05:30:12,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:12" (3/3) ... [2025-02-08 05:30:12,999 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_26-malloc_struct.i [2025-02-08 05:30:13,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:30:13,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_26-malloc_struct.i that has 2 procedures, 96 locations, 1 initial locations, 0 loop locations, and 9 error locations. [2025-02-08 05:30:13,011 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:30:13,062 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:30:13,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 194 flow [2025-02-08 05:30:13,148 INFO L124 PetriNetUnfolderBase]: 0/94 cut-off events. [2025-02-08 05:30:13,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:30:13,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 94 events. 0/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-02-08 05:30:13,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 95 transitions, 194 flow [2025-02-08 05:30:13,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 191 flow [2025-02-08 05:30:13,160 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:30:13,167 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;@521f46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:30:13,167 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-02-08 05:30:13,171 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:30:13,171 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2025-02-08 05:30:13,171 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:30:13,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:13,172 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:13,172 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:13,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:13,176 INFO L85 PathProgramCache]: Analyzing trace with hash -190203518, now seen corresponding path program 1 times [2025-02-08 05:30:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945559457] [2025-02-08 05:30:13,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:13,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:13,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 05:30:13,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 05:30:13,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:13,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:13,326 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:30:13,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:13,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945559457] [2025-02-08 05:30:13,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945559457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:13,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:13,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241701093] [2025-02-08 05:30:13,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:13,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:13,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:13,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:13,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:13,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 95 [2025-02-08 05:30:13,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 94 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:30:13,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:13,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 95 [2025-02-08 05:30:13,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:13,469 INFO L124 PetriNetUnfolderBase]: 16/229 cut-off events. [2025-02-08 05:30:13,470 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:30:13,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 229 events. 16/229 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 741 event pairs, 16 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2025-02-08 05:30:13,472 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 13 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-02-08 05:30:13,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 93 transitions, 219 flow [2025-02-08 05:30:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-02-08 05:30:13,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887719298245614 [2025-02-08 05:30:13,481 INFO L175 Difference]: Start difference. First operand has 98 places, 94 transitions, 191 flow. Second operand 3 states and 253 transitions. [2025-02-08 05:30:13,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 93 transitions, 219 flow [2025-02-08 05:30:13,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 93 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:30:13,486 INFO L231 Difference]: Finished difference. Result has 98 places, 93 transitions, 192 flow [2025-02-08 05:30:13,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2025-02-08 05:30:13,490 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2025-02-08 05:30:13,490 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 192 flow [2025-02-08 05:30:13,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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:30:13,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:13,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:13,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:30:13,491 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:13,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:13,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1366901386, now seen corresponding path program 1 times [2025-02-08 05:30:13,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:13,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248252496] [2025-02-08 05:30:13,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:13,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:13,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 05:30:13,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 05:30:13,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:13,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:13,535 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:30:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248252496] [2025-02-08 05:30:13,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248252496] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:13,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:13,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631333170] [2025-02-08 05:30:13,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:13,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:13,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:13,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:13,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2025-02-08 05:30:13,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:30:13,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:13,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2025-02-08 05:30:13,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:13,615 INFO L124 PetriNetUnfolderBase]: 24/301 cut-off events. [2025-02-08 05:30:13,615 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:30:13,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 301 events. 24/301 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1301 event pairs, 24 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 343. Up to 61 conditions per place. [2025-02-08 05:30:13,617 INFO L140 encePairwiseOnDemand]: 90/95 looper letters, 13 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-02-08 05:30:13,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 89 transitions, 212 flow [2025-02-08 05:30:13,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:13,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 249 transitions. [2025-02-08 05:30:13,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8736842105263158 [2025-02-08 05:30:13,619 INFO L175 Difference]: Start difference. First operand has 98 places, 93 transitions, 192 flow. Second operand 3 states and 249 transitions. [2025-02-08 05:30:13,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 89 transitions, 212 flow [2025-02-08 05:30:13,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:13,620 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 182 flow [2025-02-08 05:30:13,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=182, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-02-08 05:30:13,621 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, -4 predicate places. [2025-02-08 05:30:13,621 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 182 flow [2025-02-08 05:30:13,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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:30:13,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:13,622 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] [2025-02-08 05:30:13,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:30:13,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:13,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:13,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1843037752, now seen corresponding path program 1 times [2025-02-08 05:30:13,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:13,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578110307] [2025-02-08 05:30:13,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:13,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:13,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 05:30:13,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 05:30:13,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:13,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:14,102 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:30:14,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:14,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578110307] [2025-02-08 05:30:14,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578110307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:14,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:14,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:14,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697201216] [2025-02-08 05:30:14,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:14,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:30:14,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:14,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:30:14,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:30:14,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 95 [2025-02-08 05:30:14,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 182 flow. Second operand has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 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:30:14,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:14,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 95 [2025-02-08 05:30:14,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:14,430 INFO L124 PetriNetUnfolderBase]: 185/657 cut-off events. [2025-02-08 05:30:14,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:30:14,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 657 events. 185/657 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3591 event pairs, 52 based on Foata normal form. 0/617 useless extension candidates. Maximal degree in co-relation 1036. Up to 246 conditions per place. [2025-02-08 05:30:14,434 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 47 selfloop transitions, 41 changer transitions 0/153 dead transitions. [2025-02-08 05:30:14,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 153 transitions, 486 flow [2025-02-08 05:30:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:30:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:30:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 515 transitions. [2025-02-08 05:30:14,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2025-02-08 05:30:14,437 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 182 flow. Second operand 6 states and 515 transitions. [2025-02-08 05:30:14,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 153 transitions, 486 flow [2025-02-08 05:30:14,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 153 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:30:14,439 INFO L231 Difference]: Finished difference. Result has 102 places, 131 transitions, 439 flow [2025-02-08 05:30:14,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=439, PETRI_PLACES=102, PETRI_TRANSITIONS=131} [2025-02-08 05:30:14,440 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 4 predicate places. [2025-02-08 05:30:14,440 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 131 transitions, 439 flow [2025-02-08 05:30:14,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.66666666666667) internal successors, (436), 6 states have internal predecessors, (436), 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:30:14,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:14,441 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] [2025-02-08 05:30:14,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:30:14,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:14,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash 76028696, now seen corresponding path program 1 times [2025-02-08 05:30:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481294626] [2025-02-08 05:30:14,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:14,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:14,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:30:14,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:30:14,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:14,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:14,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:30:14,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:14,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481294626] [2025-02-08 05:30:14,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481294626] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:14,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:14,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:14,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144983485] [2025-02-08 05:30:14,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:14,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:30:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:14,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:30:14,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:30:14,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 95 [2025-02-08 05:30:14,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 131 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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:30:14,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:14,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 95 [2025-02-08 05:30:14,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:14,932 INFO L124 PetriNetUnfolderBase]: 231/994 cut-off events. [2025-02-08 05:30:14,932 INFO L125 PetriNetUnfolderBase]: For 290/337 co-relation queries the response was YES. [2025-02-08 05:30:14,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2068 conditions, 994 events. 231/994 cut-off events. For 290/337 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6797 event pairs, 25 based on Foata normal form. 26/987 useless extension candidates. Maximal degree in co-relation 2036. Up to 180 conditions per place. [2025-02-08 05:30:14,938 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 67 selfloop transitions, 32 changer transitions 0/190 dead transitions. [2025-02-08 05:30:14,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 190 transitions, 869 flow [2025-02-08 05:30:14,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:30:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:30:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2025-02-08 05:30:14,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9280701754385965 [2025-02-08 05:30:14,940 INFO L175 Difference]: Start difference. First operand has 102 places, 131 transitions, 439 flow. Second operand 6 states and 529 transitions. [2025-02-08 05:30:14,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 190 transitions, 869 flow [2025-02-08 05:30:14,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 190 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:14,946 INFO L231 Difference]: Finished difference. Result has 112 places, 161 transitions, 741 flow [2025-02-08 05:30:14,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=112, PETRI_TRANSITIONS=161} [2025-02-08 05:30:14,947 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 14 predicate places. [2025-02-08 05:30:14,947 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 161 transitions, 741 flow [2025-02-08 05:30:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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:30:14,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:14,948 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] [2025-02-08 05:30:14,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:30:14,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash -288605067, now seen corresponding path program 1 times [2025-02-08 05:30:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026848163] [2025-02-08 05:30:14,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:14,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:30:14,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:30:14,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:14,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:15,016 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:30:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:15,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026848163] [2025-02-08 05:30:15,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026848163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:15,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:15,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:30:15,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536914274] [2025-02-08 05:30:15,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:15,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:15,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:15,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:15,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 95 [2025-02-08 05:30:15,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 161 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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:30:15,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:15,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 95 [2025-02-08 05:30:15,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:15,071 INFO L124 PetriNetUnfolderBase]: 39/278 cut-off events. [2025-02-08 05:30:15,072 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2025-02-08 05:30:15,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 278 events. 39/278 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 975 event pairs, 4 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 485. Up to 64 conditions per place. [2025-02-08 05:30:15,073 INFO L140 encePairwiseOnDemand]: 91/95 looper letters, 2 selfloop transitions, 4 changer transitions 0/110 dead transitions. [2025-02-08 05:30:15,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 375 flow [2025-02-08 05:30:15,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2025-02-08 05:30:15,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9649122807017544 [2025-02-08 05:30:15,074 INFO L175 Difference]: Start difference. First operand has 112 places, 161 transitions, 741 flow. Second operand 3 states and 275 transitions. [2025-02-08 05:30:15,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 375 flow [2025-02-08 05:30:15,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 333 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-02-08 05:30:15,080 INFO L231 Difference]: Finished difference. Result has 105 places, 110 transitions, 329 flow [2025-02-08 05:30:15,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=105, PETRI_TRANSITIONS=110} [2025-02-08 05:30:15,082 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2025-02-08 05:30:15,082 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 110 transitions, 329 flow [2025-02-08 05:30:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 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:30:15,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:15,083 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] [2025-02-08 05:30:15,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:30:15,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:15,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1236230382, now seen corresponding path program 1 times [2025-02-08 05:30:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676603337] [2025-02-08 05:30:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:15,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:15,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-08 05:30:15,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-08 05:30:15,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:15,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:15,347 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:30:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676603337] [2025-02-08 05:30:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676603337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:15,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:15,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:15,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665874955] [2025-02-08 05:30:15,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:15,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:30:15,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:15,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:30:15,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:30:15,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 95 [2025-02-08 05:30:15,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 110 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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:30:15,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:15,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 95 [2025-02-08 05:30:15,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:15,570 INFO L124 PetriNetUnfolderBase]: 93/474 cut-off events. [2025-02-08 05:30:15,570 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-02-08 05:30:15,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 901 conditions, 474 events. 93/474 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2165 event pairs, 20 based on Foata normal form. 0/448 useless extension candidates. Maximal degree in co-relation 867. Up to 153 conditions per place. [2025-02-08 05:30:15,572 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 34 selfloop transitions, 22 changer transitions 0/131 dead transitions. [2025-02-08 05:30:15,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 515 flow [2025-02-08 05:30:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:30:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:30:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2025-02-08 05:30:15,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8719298245614036 [2025-02-08 05:30:15,575 INFO L175 Difference]: Start difference. First operand has 105 places, 110 transitions, 329 flow. Second operand 6 states and 497 transitions. [2025-02-08 05:30:15,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 515 flow [2025-02-08 05:30:15,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 131 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:30:15,579 INFO L231 Difference]: Finished difference. Result has 114 places, 131 transitions, 507 flow [2025-02-08 05:30:15,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=114, PETRI_TRANSITIONS=131} [2025-02-08 05:30:15,580 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 16 predicate places. [2025-02-08 05:30:15,580 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 131 transitions, 507 flow [2025-02-08 05:30:15,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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:30:15,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:15,580 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] [2025-02-08 05:30:15,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:30:15,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1206023122, now seen corresponding path program 1 times [2025-02-08 05:30:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:15,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418471390] [2025-02-08 05:30:15,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:15,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:15,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 05:30:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 05:30:15,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:15,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:15,780 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:30:15,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:15,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418471390] [2025-02-08 05:30:15,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418471390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:15,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:15,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:15,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851027738] [2025-02-08 05:30:15,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:15,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:30:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:15,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:30:15,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:30:15,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 95 [2025-02-08 05:30:15,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 131 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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:30:15,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:15,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 95 [2025-02-08 05:30:15,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:16,021 INFO L124 PetriNetUnfolderBase]: 195/727 cut-off events. [2025-02-08 05:30:16,021 INFO L125 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2025-02-08 05:30:16,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1814 conditions, 727 events. 195/727 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3992 event pairs, 12 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 1775. Up to 295 conditions per place. [2025-02-08 05:30:16,024 INFO L140 encePairwiseOnDemand]: 80/95 looper letters, 56 selfloop transitions, 52 changer transitions 11/188 dead transitions. [2025-02-08 05:30:16,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 188 transitions, 1014 flow [2025-02-08 05:30:16,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:30:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:30:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 501 transitions. [2025-02-08 05:30:16,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8789473684210526 [2025-02-08 05:30:16,028 INFO L175 Difference]: Start difference. First operand has 114 places, 131 transitions, 507 flow. Second operand 6 states and 501 transitions. [2025-02-08 05:30:16,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 188 transitions, 1014 flow [2025-02-08 05:30:16,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 188 transitions, 976 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:16,033 INFO L231 Difference]: Finished difference. Result has 124 places, 173 transitions, 931 flow [2025-02-08 05:30:16,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=124, PETRI_TRANSITIONS=173} [2025-02-08 05:30:16,034 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 26 predicate places. [2025-02-08 05:30:16,035 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 173 transitions, 931 flow [2025-02-08 05:30:16,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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:30:16,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:16,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:16,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:30:16,035 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:16,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1156312411, now seen corresponding path program 1 times [2025-02-08 05:30:16,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:16,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886704644] [2025-02-08 05:30:16,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:16,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:16,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:30:16,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:30:16,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:16,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:16,533 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:30:16,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:16,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886704644] [2025-02-08 05:30:16,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886704644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:16,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:16,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:30:16,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093855811] [2025-02-08 05:30:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:16,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:30:16,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:16,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:30:16,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:30:16,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-08 05:30:16,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 173 transitions, 931 flow. Second operand has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 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:30:16,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:16,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-08 05:30:16,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:16,917 INFO L124 PetriNetUnfolderBase]: 189/693 cut-off events. [2025-02-08 05:30:16,917 INFO L125 PetriNetUnfolderBase]: For 732/762 co-relation queries the response was YES. [2025-02-08 05:30:16,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 693 events. 189/693 cut-off events. For 732/762 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3774 event pairs, 19 based on Foata normal form. 21/707 useless extension candidates. Maximal degree in co-relation 2078. Up to 133 conditions per place. [2025-02-08 05:30:16,921 INFO L140 encePairwiseOnDemand]: 83/95 looper letters, 88 selfloop transitions, 36 changer transitions 16/220 dead transitions. [2025-02-08 05:30:16,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 220 transitions, 1545 flow [2025-02-08 05:30:16,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:30:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:30:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 712 transitions. [2025-02-08 05:30:16,923 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7494736842105263 [2025-02-08 05:30:16,923 INFO L175 Difference]: Start difference. First operand has 124 places, 173 transitions, 931 flow. Second operand 10 states and 712 transitions. [2025-02-08 05:30:16,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 220 transitions, 1545 flow [2025-02-08 05:30:16,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 220 transitions, 1502 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-02-08 05:30:16,930 INFO L231 Difference]: Finished difference. Result has 138 places, 181 transitions, 1078 flow [2025-02-08 05:30:16,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1078, PETRI_PLACES=138, PETRI_TRANSITIONS=181} [2025-02-08 05:30:16,930 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 40 predicate places. [2025-02-08 05:30:16,931 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 181 transitions, 1078 flow [2025-02-08 05:30:16,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 67.3) internal successors, (673), 10 states have internal predecessors, (673), 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:30:16,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:16,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:16,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:30:16,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:16,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:16,932 INFO L85 PathProgramCache]: Analyzing trace with hash 850970197, now seen corresponding path program 1 times [2025-02-08 05:30:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:16,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-02-08 05:30:16,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:16,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:16,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-08 05:30:16,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-08 05:30:16,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:16,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:17,504 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:30:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77691305] [2025-02-08 05:30:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77691305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:17,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:17,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:30:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59396431] [2025-02-08 05:30:17,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:17,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:30:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:17,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:30:17,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:30:17,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 95 [2025-02-08 05:30:17,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 181 transitions, 1078 flow. Second operand has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 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:30:17,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:17,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 95 [2025-02-08 05:30:17,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:17,997 INFO L124 PetriNetUnfolderBase]: 230/794 cut-off events. [2025-02-08 05:30:17,997 INFO L125 PetriNetUnfolderBase]: For 1364/1406 co-relation queries the response was YES. [2025-02-08 05:30:17,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 794 events. 230/794 cut-off events. For 1364/1406 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4585 event pairs, 8 based on Foata normal form. 28/818 useless extension candidates. Maximal degree in co-relation 2754. Up to 159 conditions per place. [2025-02-08 05:30:18,002 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 116 selfloop transitions, 67 changer transitions 17/263 dead transitions. [2025-02-08 05:30:18,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 263 transitions, 2090 flow [2025-02-08 05:30:18,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:30:18,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:30:18,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 706 transitions. [2025-02-08 05:30:18,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8257309941520468 [2025-02-08 05:30:18,004 INFO L175 Difference]: Start difference. First operand has 138 places, 181 transitions, 1078 flow. Second operand 9 states and 706 transitions. [2025-02-08 05:30:18,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 263 transitions, 2090 flow [2025-02-08 05:30:18,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 263 transitions, 2051 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 05:30:18,015 INFO L231 Difference]: Finished difference. Result has 144 places, 202 transitions, 1455 flow [2025-02-08 05:30:18,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1455, PETRI_PLACES=144, PETRI_TRANSITIONS=202} [2025-02-08 05:30:18,016 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 46 predicate places. [2025-02-08 05:30:18,016 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 202 transitions, 1455 flow [2025-02-08 05:30:18,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 68.7) internal successors, (687), 10 states have internal predecessors, (687), 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:30:18,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:18,016 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] [2025-02-08 05:30:18,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:30:18,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:18,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:18,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1247186771, now seen corresponding path program 1 times [2025-02-08 05:30:18,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:18,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61218735] [2025-02-08 05:30:18,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:18,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:30:18,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:30:18,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:18,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:18,433 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:30:18,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:18,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61218735] [2025-02-08 05:30:18,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61218735] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:18,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:18,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:30:18,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773880287] [2025-02-08 05:30:18,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:18,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:30:18,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:18,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:30:18,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:30:18,712 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-08 05:30:18,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 202 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:18,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:18,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-08 05:30:18,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:19,037 INFO L124 PetriNetUnfolderBase]: 199/789 cut-off events. [2025-02-08 05:30:19,037 INFO L125 PetriNetUnfolderBase]: For 2244/2330 co-relation queries the response was YES. [2025-02-08 05:30:19,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2986 conditions, 789 events. 199/789 cut-off events. For 2244/2330 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4681 event pairs, 21 based on Foata normal form. 43/825 useless extension candidates. Maximal degree in co-relation 2925. Up to 167 conditions per place. [2025-02-08 05:30:19,042 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 36 changer transitions 6/229 dead transitions. [2025-02-08 05:30:19,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 229 transitions, 2041 flow [2025-02-08 05:30:19,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:30:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:30:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 772 transitions. [2025-02-08 05:30:19,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.738755980861244 [2025-02-08 05:30:19,044 INFO L175 Difference]: Start difference. First operand has 144 places, 202 transitions, 1455 flow. Second operand 11 states and 772 transitions. [2025-02-08 05:30:19,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 229 transitions, 2041 flow [2025-02-08 05:30:19,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 229 transitions, 1993 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-02-08 05:30:19,058 INFO L231 Difference]: Finished difference. Result has 152 places, 200 transitions, 1479 flow [2025-02-08 05:30:19,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1479, PETRI_PLACES=152, PETRI_TRANSITIONS=200} [2025-02-08 05:30:19,060 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 54 predicate places. [2025-02-08 05:30:19,060 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 200 transitions, 1479 flow [2025-02-08 05:30:19,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:19,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:19,061 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] [2025-02-08 05:30:19,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:30:19,061 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:19,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:19,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1953094603, now seen corresponding path program 2 times [2025-02-08 05:30:19,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:19,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026833232] [2025-02-08 05:30:19,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:30:19,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:19,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:30:19,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:30:19,076 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:30:19,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:19,417 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:30:19,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:19,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026833232] [2025-02-08 05:30:19,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026833232] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:19,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:19,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:30:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956988282] [2025-02-08 05:30:19,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:19,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:30:19,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:19,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:30:19,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:30:19,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-08 05:30:19,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 200 transitions, 1479 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:19,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:19,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-08 05:30:19,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:19,849 INFO L124 PetriNetUnfolderBase]: 196/784 cut-off events. [2025-02-08 05:30:19,849 INFO L125 PetriNetUnfolderBase]: For 2430/2485 co-relation queries the response was YES. [2025-02-08 05:30:19,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2989 conditions, 784 events. 196/784 cut-off events. For 2430/2485 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4643 event pairs, 21 based on Foata normal form. 28/805 useless extension candidates. Maximal degree in co-relation 2956. Up to 167 conditions per place. [2025-02-08 05:30:19,853 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 93 selfloop transitions, 34 changer transitions 7/228 dead transitions. [2025-02-08 05:30:19,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 228 transitions, 2057 flow [2025-02-08 05:30:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:30:19,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-08 05:30:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 837 transitions. [2025-02-08 05:30:19,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7342105263157894 [2025-02-08 05:30:19,855 INFO L175 Difference]: Start difference. First operand has 152 places, 200 transitions, 1479 flow. Second operand 12 states and 837 transitions. [2025-02-08 05:30:19,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 228 transitions, 2057 flow [2025-02-08 05:30:19,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 228 transitions, 1975 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-02-08 05:30:19,868 INFO L231 Difference]: Finished difference. Result has 154 places, 198 transitions, 1455 flow [2025-02-08 05:30:19,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1401, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1455, PETRI_PLACES=154, PETRI_TRANSITIONS=198} [2025-02-08 05:30:19,868 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 56 predicate places. [2025-02-08 05:30:19,868 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 198 transitions, 1455 flow [2025-02-08 05:30:19,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:19,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:19,869 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] [2025-02-08 05:30:19,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:30:19,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:19,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1156367633, now seen corresponding path program 3 times [2025-02-08 05:30:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800633985] [2025-02-08 05:30:19,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:30:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:19,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:30:19,882 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:30:19,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-08 05:30:19,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:20,198 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:30:20,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:20,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800633985] [2025-02-08 05:30:20,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800633985] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:20,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:20,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:30:20,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223049420] [2025-02-08 05:30:20,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:20,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:30:20,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:20,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:30:20,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:30:20,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-08 05:30:20,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 198 transitions, 1455 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:20,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:20,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-08 05:30:20,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:20,892 INFO L124 PetriNetUnfolderBase]: 200/841 cut-off events. [2025-02-08 05:30:20,892 INFO L125 PetriNetUnfolderBase]: For 2498/2524 co-relation queries the response was YES. [2025-02-08 05:30:20,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3159 conditions, 841 events. 200/841 cut-off events. For 2498/2524 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5231 event pairs, 21 based on Foata normal form. 13/847 useless extension candidates. Maximal degree in co-relation 3125. Up to 242 conditions per place. [2025-02-08 05:30:20,897 INFO L140 encePairwiseOnDemand]: 79/95 looper letters, 70 selfloop transitions, 42 changer transitions 12/218 dead transitions. [2025-02-08 05:30:20,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 218 transitions, 1896 flow [2025-02-08 05:30:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:30:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:30:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 911 transitions. [2025-02-08 05:30:20,899 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7376518218623481 [2025-02-08 05:30:20,899 INFO L175 Difference]: Start difference. First operand has 154 places, 198 transitions, 1455 flow. Second operand 13 states and 911 transitions. [2025-02-08 05:30:20,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 218 transitions, 1896 flow [2025-02-08 05:30:20,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 218 transitions, 1790 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-02-08 05:30:20,911 INFO L231 Difference]: Finished difference. Result has 159 places, 204 transitions, 1566 flow [2025-02-08 05:30:20,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1379, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1566, PETRI_PLACES=159, PETRI_TRANSITIONS=204} [2025-02-08 05:30:20,912 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 61 predicate places. [2025-02-08 05:30:20,912 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 204 transitions, 1566 flow [2025-02-08 05:30:20,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:20,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:20,912 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] [2025-02-08 05:30:20,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:30:20,913 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:20,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:20,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1789183467, now seen corresponding path program 4 times [2025-02-08 05:30:20,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:20,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043655716] [2025-02-08 05:30:20,913 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:30:20,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:20,923 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 69 statements into 2 equivalence classes. [2025-02-08 05:30:20,926 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 66 of 69 statements. [2025-02-08 05:30:20,926 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:30:20,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:21,347 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:30:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:21,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043655716] [2025-02-08 05:30:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043655716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:21,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:21,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 05:30:21,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121763892] [2025-02-08 05:30:21,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:21,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:30:21,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:21,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:30:21,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-08 05:30:21,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 95 [2025-02-08 05:30:21,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 204 transitions, 1566 flow. Second operand has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:21,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:21,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 95 [2025-02-08 05:30:21,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:21,946 INFO L124 PetriNetUnfolderBase]: 197/827 cut-off events. [2025-02-08 05:30:21,946 INFO L125 PetriNetUnfolderBase]: For 2478/2503 co-relation queries the response was YES. [2025-02-08 05:30:21,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3148 conditions, 827 events. 197/827 cut-off events. For 2478/2503 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5100 event pairs, 21 based on Foata normal form. 13/833 useless extension candidates. Maximal degree in co-relation 3114. Up to 169 conditions per place. [2025-02-08 05:30:21,951 INFO L140 encePairwiseOnDemand]: 84/95 looper letters, 91 selfloop transitions, 37 changer transitions 7/229 dead transitions. [2025-02-08 05:30:21,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 229 transitions, 2122 flow [2025-02-08 05:30:21,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 05:30:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-08 05:30:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 898 transitions. [2025-02-08 05:30:21,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7271255060728745 [2025-02-08 05:30:21,953 INFO L175 Difference]: Start difference. First operand has 159 places, 204 transitions, 1566 flow. Second operand 13 states and 898 transitions. [2025-02-08 05:30:21,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 229 transitions, 2122 flow [2025-02-08 05:30:21,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 229 transitions, 2069 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-02-08 05:30:21,968 INFO L231 Difference]: Finished difference. Result has 158 places, 199 transitions, 1552 flow [2025-02-08 05:30:21,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1552, PETRI_PLACES=158, PETRI_TRANSITIONS=199} [2025-02-08 05:30:21,969 INFO L279 CegarLoopForPetriNet]: 98 programPoint places, 60 predicate places. [2025-02-08 05:30:21,969 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 199 transitions, 1552 flow [2025-02-08 05:30:21,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 67.54545454545455) internal successors, (743), 11 states have internal predecessors, (743), 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:30:21,970 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:21,970 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] [2025-02-08 05:30:21,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:30:21,970 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-02-08 05:30:21,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1046258561, now seen corresponding path program 1 times [2025-02-08 05:30:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:21,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659470766] [2025-02-08 05:30:21,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:21,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:30:21,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:30:21,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:21,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:21,986 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:30:21,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-08 05:30:21,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-08 05:30:21,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:21,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:22,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:30:22,019 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:30:22,020 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-02-08 05:30:22,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-02-08 05:30:22,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-02-08 05:30:22,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-02-08 05:30:22,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-02-08 05:30:22,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-02-08 05:30:22,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-02-08 05:30:22,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-02-08 05:30:22,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-02-08 05:30:22,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-02-08 05:30:22,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-02-08 05:30:22,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-02-08 05:30:22,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-02-08 05:30:22,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-02-08 05:30:22,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:30:22,022 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:22,063 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:30:22,063 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:30:22,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:30:22 BasicIcfg [2025-02-08 05:30:22,069 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:30:22,071 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:30:22,071 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:30:22,072 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:30:22,072 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:30:12" (3/4) ... [2025-02-08 05:30:22,073 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:30:22,120 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-02-08 05:30:22,152 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:30:22,153 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:30:22,153 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:30:22,153 INFO L158 Benchmark]: Toolchain (without parser) took 10041.96ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 112.4MB in the beginning and 281.8MB in the end (delta: -169.4MB). Peak memory consumption was 185.1MB. Max. memory is 16.1GB. [2025-02-08 05:30:22,154 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:22,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.50ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 74.6MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-08 05:30:22,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.94ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 72.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:22,155 INFO L158 Benchmark]: Boogie Preprocessor took 27.46ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 71.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:30:22,155 INFO L158 Benchmark]: IcfgBuilder took 340.88ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 54.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:30:22,156 INFO L158 Benchmark]: TraceAbstraction took 9074.73ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 53.5MB in the beginning and 290.2MB in the end (delta: -236.7MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. [2025-02-08 05:30:22,156 INFO L158 Benchmark]: Witness Printer took 81.26ms. Allocated memory is still 494.9MB. Free memory was 290.2MB in the beginning and 281.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:30:22,157 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.25ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.50ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 74.6MB in the end (delta: 37.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.94ms. Allocated memory is still 142.6MB. Free memory was 74.6MB in the beginning and 72.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.46ms. Allocated memory is still 142.6MB. Free memory was 72.4MB in the beginning and 71.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 340.88ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 54.6MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9074.73ms. Allocated memory was 142.6MB in the beginning and 494.9MB in the end (delta: 352.3MB). Free memory was 53.5MB in the beginning and 290.2MB in the end (delta: -236.7MB). Peak memory consumption was 118.0MB. Max. memory is 16.1GB. * Witness Printer took 81.26ms. Allocated memory is still 494.9MB. Free memory was 290.2MB in the beginning and 281.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1245]: Data race detected Data race detected The following path leads to a data race: [L1227] 0 data *d; VAL [d={0:0}] [L1228] 0 pthread_mutex_t m = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [d={0:0}, m={1:0}] [L1237] 0 pthread_t id; VAL [d={0:0}, m={1:0}] [L1238] 0 data *z; VAL [d={0:0}, m={1:0}] [L1239] 0 d = malloc(sizeof(data)) VAL [d={-2:0}, m={1:0}] [L1240] 0 z = d VAL [d={-2:0}, m={1:0}, z={-2:0}] [L1241] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] EXPR 0 d->x VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1243] 0 printf("%d\n",d->x) VAL [\old(arg)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1231] EXPR 1 d->x VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1231] 1 d->x = 3 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] EXPR 0 z->y VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L1232] EXPR 1 d->y VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1232] 1 d->y = 8 VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L1245] 0 printf("%d\n",z->y) VAL [\old(arg)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: d->x = 3 [1231] * C: d = malloc(sizeof(data)) [1239] * C: d->y = 8 [1232] * C: d->x = 3 [1231] * C: d->x = 3 [1231] * C: d->x = 3 [1231] and C: printf("%d\n",z->y) [1245] - UnprovableResult [Line: 1239]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1240]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1243]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1241]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1231]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1232]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 129 locations, 14 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: 8.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1464 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1060 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4788 IncrementalHoareTripleChecker+Invalid, 5288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 500 mSolverCounterUnsat, 64 mSDtfsCounter, 4788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1566occurred in iteration=12, InterpolantAutomatonStates: 101, 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, 3.7s InterpolantComputationTime, 740 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 4135 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:30:22,174 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)