./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:28:08,565 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:28:08,617 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:28:08,621 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:28:08,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:28:08,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:28:08,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:28:08,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:28:08,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:28:08,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:28:08,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:28:08,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:28:08,638 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:28:08,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:28:08,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:28:08,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:28:08,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:08,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:08,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:28:08,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:28:08,641 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2b48d13cab05bc3b998f8de65b383ec2ee92eaa2c6f230f8a23e235950b9a5ba [2025-04-30 10:28:08,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:28:08,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:28:08,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:28:08,864 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:28:08,864 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:28:08,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i [2025-04-30 10:28:10,141 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5fa1ea8/fa67f07b21d943e8a864e549f63e525c/FLAG55e6ce34d [2025-04-30 10:28:10,395 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:28:10,396 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/10-synch_02-thread_nonunique.i [2025-04-30 10:28:10,412 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5fa1ea8/fa67f07b21d943e8a864e549f63e525c/FLAG55e6ce34d [2025-04-30 10:28:11,141 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5fa1ea8/fa67f07b21d943e8a864e549f63e525c [2025-04-30 10:28:11,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:28:11,145 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:28:11,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:28:11,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:28:11,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:28:11,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,151 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e5b4179 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11, skipping insertion in model container [2025-04-30 10:28:11,151 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:28:11,483 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:11,488 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:28:11,550 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:11,592 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:28:11,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11 WrapperNode [2025-04-30 10:28:11,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:28:11,594 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:11,594 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:28:11,594 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:28:11,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,611 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,625 INFO L138 Inliner]: procedures = 259, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 40 [2025-04-30 10:28:11,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:11,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:28:11,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:28:11,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:28:11,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,639 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,647 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,651 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:28:11,659 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:28:11,659 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:28:11,659 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:28:11,660 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (1/1) ... [2025-04-30 10:28:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:11,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:11,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:28:11,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-30 10:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-30 10:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-30 10:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:28:11,701 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:28:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:28:11,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:28:11,703 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:28:11,791 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:28:11,793 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:28:11,890 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:28:11,890 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:28:11,897 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:28:11,897 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:28:11,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:11 BoogieIcfgContainer [2025-04-30 10:28:11,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:28:11,899 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:28:11,899 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:28:11,905 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:28:11,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:28:11" (1/3) ... [2025-04-30 10:28:11,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c762226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:11, skipping insertion in model container [2025-04-30 10:28:11,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:11" (2/3) ... [2025-04-30 10:28:11,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c762226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:11, skipping insertion in model container [2025-04-30 10:28:11,905 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:11" (3/3) ... [2025-04-30 10:28:11,906 INFO L128 eAbstractionObserver]: Analyzing ICFG 10-synch_02-thread_nonunique.i [2025-04-30 10:28:11,916 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:28:11,918 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 10-synch_02-thread_nonunique.i that has 2 procedures, 53 locations, 53 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-30 10:28:11,918 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:28:11,965 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:28:11,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 54 transitions, 115 flow [2025-04-30 10:28:12,020 INFO L116 PetriNetUnfolderBase]: 1/82 cut-off events. [2025-04-30 10:28:12,022 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:28:12,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 82 events. 1/82 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 150 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 3. Up to 3 conditions per place. [2025-04-30 10:28:12,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 54 transitions, 115 flow [2025-04-30 10:28:12,026 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 54 transitions, 115 flow [2025-04-30 10:28:12,035 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:28:12,044 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45d48c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:28:12,044 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-30 10:28:12,053 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:28:12,055 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-30 10:28:12,055 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:12,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:12,056 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:12,056 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-30 10:28:12,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:12,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1642968272, now seen corresponding path program 1 times [2025-04-30 10:28:12,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:12,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379505501] [2025-04-30 10:28:12,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:12,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:12,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:28:12,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:28:12,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:12,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:12,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379505501] [2025-04-30 10:28:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379505501] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:12,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:28:12,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919538449] [2025-04-30 10:28:12,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:12,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:12,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:12,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:12,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:12,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 54 [2025-04-30 10:28:12,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:12,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:12,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 54 [2025-04-30 10:28:12,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:12,373 INFO L116 PetriNetUnfolderBase]: 0/73 cut-off events. [2025-04-30 10:28:12,375 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-30 10:28:12,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 73 events. 0/73 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 2/70 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-04-30 10:28:12,376 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 5 selfloop transitions, 4 changer transitions 7/54 dead transitions. [2025-04-30 10:28:12,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 137 flow [2025-04-30 10:28:12,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 142 transitions. [2025-04-30 10:28:12,384 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8765432098765432 [2025-04-30 10:28:12,385 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 115 flow. Second operand 3 states and 142 transitions. [2025-04-30 10:28:12,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 137 flow [2025-04-30 10:28:12,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 137 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:12,392 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 115 flow [2025-04-30 10:28:12,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2025-04-30 10:28:12,395 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2025-04-30 10:28:12,396 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 115 flow [2025-04-30 10:28:12,396 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:12,396 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:12,396 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:12,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:28:12,396 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-30 10:28:12,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:12,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1953988674, now seen corresponding path program 1 times [2025-04-30 10:28:12,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:12,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786613787] [2025-04-30 10:28:12,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:12,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:12,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:28:12,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:28:12,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:12,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:12,751 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786613787] [2025-04-30 10:28:12,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786613787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:12,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:12,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663621998] [2025-04-30 10:28:12,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:12,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:12,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:12,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:12,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:12,870 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 54 [2025-04-30 10:28:12,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:12,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:12,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 54 [2025-04-30 10:28:12,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:12,903 INFO L116 PetriNetUnfolderBase]: 0/64 cut-off events. [2025-04-30 10:28:12,903 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-30 10:28:12,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 64 events. 0/64 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 0. Up to 21 conditions per place. [2025-04-30 10:28:12,903 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 15 selfloop transitions, 5 changer transitions 0/46 dead transitions. [2025-04-30 10:28:12,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 153 flow [2025-04-30 10:28:12,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 207 transitions. [2025-04-30 10:28:12,905 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-04-30 10:28:12,905 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 115 flow. Second operand 6 states and 207 transitions. [2025-04-30 10:28:12,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 153 flow [2025-04-30 10:28:12,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 145 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:12,906 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 115 flow [2025-04-30 10:28:12,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2025-04-30 10:28:12,907 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2025-04-30 10:28:12,907 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 115 flow [2025-04-30 10:28:12,907 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:12,907 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:12,908 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] [2025-04-30 10:28:12,908 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:28:12,908 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-30 10:28:12,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:12,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1380954743, now seen corresponding path program 1 times [2025-04-30 10:28:12,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:12,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608850658] [2025-04-30 10:28:12,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:12,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:12,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:28:12,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:28:12,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:12,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:12,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:12,934 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608850658] [2025-04-30 10:28:12,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608850658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:12,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:12,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406749535] [2025-04-30 10:28:12,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:12,935 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:12,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:12,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:12,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:12,940 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 54 [2025-04-30 10:28:12,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:12,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:12,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 54 [2025-04-30 10:28:12,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:12,956 INFO L116 PetriNetUnfolderBase]: 0/63 cut-off events. [2025-04-30 10:28:12,956 INFO L117 PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES. [2025-04-30 10:28:12,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 63 events. 0/63 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 1/62 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2025-04-30 10:28:12,957 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 4 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-04-30 10:28:12,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 125 flow [2025-04-30 10:28:12,958 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:12,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:12,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2025-04-30 10:28:12,959 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9135802469135802 [2025-04-30 10:28:12,960 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 115 flow. Second operand 3 states and 148 transitions. [2025-04-30 10:28:12,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 125 flow [2025-04-30 10:28:12,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 115 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:12,961 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 107 flow [2025-04-30 10:28:12,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2025-04-30 10:28:12,961 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -6 predicate places. [2025-04-30 10:28:12,961 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 107 flow [2025-04-30 10:28:12,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:12,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:12,962 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] [2025-04-30 10:28:12,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:28:12,962 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-30 10:28:12,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash -499991009, now seen corresponding path program 1 times [2025-04-30 10:28:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:12,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091971589] [2025-04-30 10:28:12,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:12,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:12,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:28:12,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:28:12,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:12,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:13,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,022 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091971589] [2025-04-30 10:28:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091971589] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:13,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408212081] [2025-04-30 10:28:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:13,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:28:13,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:13,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:28:13,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:28:13,084 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 54 [2025-04-30 10:28:13,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:13,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 54 [2025-04-30 10:28:13,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:13,107 INFO L116 PetriNetUnfolderBase]: 0/41 cut-off events. [2025-04-30 10:28:13,107 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:28:13,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 41 events. 0/41 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 16 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2025-04-30 10:28:13,108 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 3 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2025-04-30 10:28:13,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 86 flow [2025-04-30 10:28:13,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:13,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:13,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 254 transitions. [2025-04-30 10:28:13,109 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7839506172839507 [2025-04-30 10:28:13,109 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 107 flow. Second operand 6 states and 254 transitions. [2025-04-30 10:28:13,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 86 flow [2025-04-30 10:28:13,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 80 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:28:13,110 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 74 flow [2025-04-30 10:28:13,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2025-04-30 10:28:13,111 INFO L279 CegarLoopForPetriNet]: 56 programPoint places, -17 predicate places. [2025-04-30 10:28:13,111 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 74 flow [2025-04-30 10:28:13,111 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 42.8) internal successors, (214), 5 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:13,111 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:13,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:28:13,111 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-30 10:28:13,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1756326445, now seen corresponding path program 1 times [2025-04-30 10:28:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:13,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069990431] [2025-04-30 10:28:13,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:13,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:28:13,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:28:13,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:28:13,126 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:28:13,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-30 10:28:13,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-30 10:28:13,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:28:13,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:28:13,145 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:28:13,146 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2025-04-30 10:28:13,147 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining) [2025-04-30 10:28:13,147 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining) [2025-04-30 10:28:13,147 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining) [2025-04-30 10:28:13,147 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining) [2025-04-30 10:28:13,147 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:28:13,148 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-30 10:28:13,149 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-30 10:28:13,149 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-30 10:28:13,158 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:28:13,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 65 transitions, 146 flow [2025-04-30 10:28:13,172 INFO L116 PetriNetUnfolderBase]: 3/147 cut-off events. [2025-04-30 10:28:13,172 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-30 10:28:13,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 147 events. 3/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 297 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 84. Up to 6 conditions per place. [2025-04-30 10:28:13,173 INFO L82 GeneralOperation]: Start removeDead. Operand has 68 places, 65 transitions, 146 flow [2025-04-30 10:28:13,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 65 transitions, 146 flow [2025-04-30 10:28:13,174 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:28:13,175 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@45d48c3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:28:13,175 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-30 10:28:13,177 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:28:13,177 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-30 10:28:13,177 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:13,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:13,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:13,178 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-30 10:28:13,178 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1949010927, now seen corresponding path program 1 times [2025-04-30 10:28:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:13,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301329819] [2025-04-30 10:28:13,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:13,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:28:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:28:13,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:13,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301329819] [2025-04-30 10:28:13,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301329819] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:13,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:13,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:28:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625321531] [2025-04-30 10:28:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:13,198 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:13,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:13,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:13,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:13,229 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 65 [2025-04-30 10:28:13,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:13,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 65 [2025-04-30 10:28:13,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:13,252 INFO L116 PetriNetUnfolderBase]: 2/149 cut-off events. [2025-04-30 10:28:13,253 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-30 10:28:13,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 149 events. 2/149 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 329 event pairs, 0 based on Foata normal form. 3/142 useless extension candidates. Maximal degree in co-relation 36. Up to 20 conditions per place. [2025-04-30 10:28:13,253 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 13 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2025-04-30 10:28:13,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 69 transitions, 194 flow [2025-04-30 10:28:13,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:13,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-04-30 10:28:13,254 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2025-04-30 10:28:13,255 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 146 flow. Second operand 3 states and 175 transitions. [2025-04-30 10:28:13,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 69 transitions, 194 flow [2025-04-30 10:28:13,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:28:13,256 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 170 flow [2025-04-30 10:28:13,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2025-04-30 10:28:13,257 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2025-04-30 10:28:13,257 INFO L485 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 170 flow [2025-04-30 10:28:13,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:13,257 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:13,257 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:28:13,257 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-30 10:28:13,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:13,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1636194082, now seen corresponding path program 1 times [2025-04-30 10:28:13,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:13,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214982694] [2025-04-30 10:28:13,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:13,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:28:13,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:28:13,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:13,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214982694] [2025-04-30 10:28:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214982694] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:13,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:13,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:13,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844825642] [2025-04-30 10:28:13,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:13,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:28:13,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:13,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:28:13,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:28:13,539 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 65 [2025-04-30 10:28:13,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:13,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 65 [2025-04-30 10:28:13,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:13,582 INFO L116 PetriNetUnfolderBase]: 2/146 cut-off events. [2025-04-30 10:28:13,583 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-30 10:28:13,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 146 events. 2/146 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 319 event pairs, 1 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 45. Up to 52 conditions per place. [2025-04-30 10:28:13,584 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 20 selfloop transitions, 6 changer transitions 0/66 dead transitions. [2025-04-30 10:28:13,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 66 transitions, 220 flow [2025-04-30 10:28:13,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:13,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2025-04-30 10:28:13,586 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2025-04-30 10:28:13,586 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 170 flow. Second operand 6 states and 265 transitions. [2025-04-30 10:28:13,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 66 transitions, 220 flow [2025-04-30 10:28:13,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:28:13,589 INFO L231 Difference]: Finished difference. Result has 74 places, 66 transitions, 176 flow [2025-04-30 10:28:13,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=74, PETRI_TRANSITIONS=66} [2025-04-30 10:28:13,589 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2025-04-30 10:28:13,589 INFO L485 AbstractCegarLoop]: Abstraction has has 74 places, 66 transitions, 176 flow [2025-04-30 10:28:13,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.666666666666664) internal successors, (250), 6 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:13,590 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:13,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:28:13,590 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-30 10:28:13,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:13,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1430347378, now seen corresponding path program 1 times [2025-04-30 10:28:13,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:13,590 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097364117] [2025-04-30 10:28:13,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:13,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-30 10:28:13,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-30 10:28:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:13,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097364117] [2025-04-30 10:28:13,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097364117] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:13,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:13,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:13,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129108693] [2025-04-30 10:28:13,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:13,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:13,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:13,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:13,631 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 65 [2025-04-30 10:28:13,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 66 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:13,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 65 [2025-04-30 10:28:13,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:13,668 INFO L116 PetriNetUnfolderBase]: 18/301 cut-off events. [2025-04-30 10:28:13,668 INFO L117 PetriNetUnfolderBase]: For 60/89 co-relation queries the response was YES. [2025-04-30 10:28:13,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 301 events. 18/301 cut-off events. For 60/89 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1407 event pairs, 8 based on Foata normal form. 3/276 useless extension candidates. Maximal degree in co-relation 174. Up to 34 conditions per place. [2025-04-30 10:28:13,672 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 11 selfloop transitions, 4 changer transitions 0/71 dead transitions. [2025-04-30 10:28:13,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 71 transitions, 224 flow [2025-04-30 10:28:13,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2025-04-30 10:28:13,674 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9282051282051282 [2025-04-30 10:28:13,674 INFO L175 Difference]: Start difference. First operand has 74 places, 66 transitions, 176 flow. Second operand 3 states and 181 transitions. [2025-04-30 10:28:13,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 71 transitions, 224 flow [2025-04-30 10:28:13,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 71 transitions, 212 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-30 10:28:13,676 INFO L231 Difference]: Finished difference. Result has 73 places, 69 transitions, 194 flow [2025-04-30 10:28:13,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=73, PETRI_TRANSITIONS=69} [2025-04-30 10:28:13,676 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2025-04-30 10:28:13,677 INFO L485 AbstractCegarLoop]: Abstraction has has 73 places, 69 transitions, 194 flow [2025-04-30 10:28:13,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:13,677 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] [2025-04-30 10:28:13,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:28:13,677 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-30 10:28:13,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1094091529, now seen corresponding path program 1 times [2025-04-30 10:28:13,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:13,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633417481] [2025-04-30 10:28:13,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:13,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-30 10:28:13,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-30 10:28:13,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:13,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633417481] [2025-04-30 10:28:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633417481] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:13,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:13,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:13,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842308292] [2025-04-30 10:28:13,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:13,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:28:13,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:13,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:28:13,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:28:13,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 65 [2025-04-30 10:28:13,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 69 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:13,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 65 [2025-04-30 10:28:13,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:13,881 INFO L116 PetriNetUnfolderBase]: 4/210 cut-off events. [2025-04-30 10:28:13,883 INFO L117 PetriNetUnfolderBase]: For 42/47 co-relation queries the response was YES. [2025-04-30 10:28:13,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 210 events. 4/210 cut-off events. For 42/47 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 722 event pairs, 1 based on Foata normal form. 3/199 useless extension candidates. Maximal degree in co-relation 167. Up to 26 conditions per place. [2025-04-30 10:28:13,885 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 14 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2025-04-30 10:28:13,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 73 transitions, 250 flow [2025-04-30 10:28:13,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:28:13,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:28:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 322 transitions. [2025-04-30 10:28:13,886 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8256410256410256 [2025-04-30 10:28:13,886 INFO L175 Difference]: Start difference. First operand has 73 places, 69 transitions, 194 flow. Second operand 6 states and 322 transitions. [2025-04-30 10:28:13,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 73 transitions, 250 flow [2025-04-30 10:28:13,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:13,888 INFO L231 Difference]: Finished difference. Result has 79 places, 71 transitions, 218 flow [2025-04-30 10:28:13,888 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=79, PETRI_TRANSITIONS=71} [2025-04-30 10:28:13,890 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2025-04-30 10:28:13,891 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 71 transitions, 218 flow [2025-04-30 10:28:13,891 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:13,891 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:13,891 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:28:13,891 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-30 10:28:13,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:13,893 INFO L85 PathProgramCache]: Analyzing trace with hash 2011967998, now seen corresponding path program 1 times [2025-04-30 10:28:13,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:13,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653445898] [2025-04-30 10:28:13,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:13,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-30 10:28:13,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:28:13,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:13,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-30 10:28:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:13,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653445898] [2025-04-30 10:28:13,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653445898] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:13,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:13,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:13,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329978892] [2025-04-30 10:28:13,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:13,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:13,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:13,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:13,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:13,939 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 65 [2025-04-30 10:28:13,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 71 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:13,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 65 [2025-04-30 10:28:13,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:13,976 INFO L116 PetriNetUnfolderBase]: 18/311 cut-off events. [2025-04-30 10:28:13,976 INFO L117 PetriNetUnfolderBase]: For 80/177 co-relation queries the response was YES. [2025-04-30 10:28:13,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 311 events. 18/311 cut-off events. For 80/177 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1487 event pairs, 9 based on Foata normal form. 2/291 useless extension candidates. Maximal degree in co-relation 397. Up to 37 conditions per place. [2025-04-30 10:28:13,978 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 10 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2025-04-30 10:28:13,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 261 flow [2025-04-30 10:28:13,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-04-30 10:28:13,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-04-30 10:28:13,979 INFO L175 Difference]: Start difference. First operand has 79 places, 71 transitions, 218 flow. Second operand 3 states and 180 transitions. [2025-04-30 10:28:13,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 261 flow [2025-04-30 10:28:13,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 75 transitions, 251 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:13,983 INFO L231 Difference]: Finished difference. Result has 81 places, 74 transitions, 244 flow [2025-04-30 10:28:13,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=81, PETRI_TRANSITIONS=74} [2025-04-30 10:28:13,983 INFO L279 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2025-04-30 10:28:13,983 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 74 transitions, 244 flow [2025-04-30 10:28:13,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:28:13,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:13,984 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:13,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:28:13,984 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-30 10:28:13,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1301920823, now seen corresponding path program 1 times [2025-04-30 10:28:13,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:13,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50631044] [2025-04-30 10:28:13,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:13,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:13,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:28:14,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:28:14,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:14,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:28:14,002 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-30 10:28:14,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:28:14,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:28:14,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:14,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-30 10:28:14,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-30 10:28:14,020 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-30 10:28:14,021 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2025-04-30 10:28:14,021 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-30 10:28:14,021 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-30 10:28:14,021 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-30 10:28:14,021 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-30 10:28:14,021 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-30 10:28:14,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:28:14,021 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:28:14,061 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-30 10:28:14,061 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:28:14,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:28:14 BasicIcfg [2025-04-30 10:28:14,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:28:14,067 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:28:14,067 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:28:14,067 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:28:14,068 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:11" (3/4) ... [2025-04-30 10:28:14,069 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-30 10:28:14,113 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 3. [2025-04-30 10:28:14,145 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:28:14,146 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:28:14,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:28:14,146 INFO L158 Benchmark]: Toolchain (without parser) took 3001.36ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 110.8MB in the beginning and 245.0MB in the end (delta: -134.2MB). Peak memory consumption was 154.6MB. Max. memory is 16.1GB. [2025-04-30 10:28:14,147 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:28:14,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.09ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 80.9MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:28:14,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.11ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:28:14,147 INFO L158 Benchmark]: Boogie Preprocessor took 32.27ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 77.7MB in the end (delta: 908.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:28:14,147 INFO L158 Benchmark]: RCFGBuilder took 237.93ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 64.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:28:14,148 INFO L158 Benchmark]: TraceAbstraction took 2167.84ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 63.7MB in the beginning and 253.4MB in the end (delta: -189.7MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. [2025-04-30 10:28:14,149 INFO L158 Benchmark]: Witness Printer took 78.86ms. Allocated memory is still 427.8MB. Free memory was 253.4MB in the beginning and 245.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:28:14,150 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.26ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.09ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 80.9MB in the end (delta: 29.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.11ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.6MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.27ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 77.7MB in the end (delta: 908.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 237.93ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 64.2MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2167.84ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 63.7MB in the beginning and 253.4MB in the end (delta: -189.7MB). Peak memory consumption was 104.3MB. Max. memory is 16.1GB. * Witness Printer took 78.86ms. Allocated memory is still 427.8MB. Free memory was 253.4MB in the beginning and 245.0MB 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: 919]: Data race detected Data race detected The following path leads to a data race: [L917] 0 int myglobal; VAL [myglobal=0] [L923] 0 pthread_t id[10]; VAL [id={8:0}, myglobal=0] [L924] 0 int i; VAL [id={8:0}, myglobal=0] [L925] 0 i=0 VAL [i=0, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [i=0, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\at(arg, Pre)={0:0}, i=0, id={8:0}, myglobal=0] [L925] 0 i++ VAL [\at(arg, Pre)={0:0}, i=1, id={8:0}, myglobal=0] [L925] COND TRUE 0 i<10 VAL [\at(arg, Pre)={0:0}, myglobal=0] [L926] 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\at(arg, Pre)={0:0}, i=1, id={8:0}, myglobal=0] [L926] FCALL, FORK 0 pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) VAL [\at(arg, Pre)={0:0}, i=1, id={8:0}, myglobal=0] [L919] 2 myglobal=42 VAL [\at(arg, Pre)={0:0}, arg={0:0}, myglobal=42] [L919] 1 myglobal=42 VAL [\at(arg, Pre)={0:0}, arg={0:0}, myglobal=42] 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: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] * C: pthread_create(&id[i], ((void *)0), t_fun, ((void *)0)) [926] and C: myglobal=42 [919] - UnprovableResult [Line: 928]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 926]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 64 locations, 65 edges, 5 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: 1.2s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 225 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 123 mSDsluCounter, 59 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 271 IncrementalHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 36 mSDtfsCounter, 271 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 18, 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, 0.5s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 74 locations, 76 edges, 6 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: 0.9s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 139 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 331 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 22 mSDtfsCounter, 331 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=5, InterpolantAutomatonStates: 21, 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.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-30 10:28:14,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)