/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:13:54,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:13:54,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 00:13:54,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:13:54,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:13:54,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:13:54,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:13:54,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:13:54,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:13:54,387 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:13:54,387 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:13:54,387 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:13:54,387 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:13:54,387 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:13:54,387 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:13:54,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:13:54,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:13:54,387 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:13:54,388 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:54,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:54,389 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:54,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:13:54,390 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 00:13:54,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:13:54,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:13:54,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:13:54,636 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:13:54,637 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:13:54,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2025-04-14 00:13:55,964 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd880d2b6/10048b1f96a7449abc36b5602dc87170/FLAG9100bfe49 [2025-04-14 00:13:56,209 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:13:56,209 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2025-04-14 00:13:56,221 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd880d2b6/10048b1f96a7449abc36b5602dc87170/FLAG9100bfe49 [2025-04-14 00:13:57,015 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd880d2b6/10048b1f96a7449abc36b5602dc87170 [2025-04-14 00:13:57,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:13:57,018 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:13:57,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:57,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:13:57,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:13:57,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@605d2f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57, skipping insertion in model container [2025-04-14 00:13:57,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:13:57,176 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2025-04-14 00:13:57,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:57,361 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:13:57,375 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_67-pthread_cond_wait_unknown_1_pos.i[1103,1116] [2025-04-14 00:13:57,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:13:57,466 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:13:57,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57 WrapperNode [2025-04-14 00:13:57,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:13:57,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:57,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:13:57,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:13:57,471 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,503 INFO L138 Inliner]: procedures = 354, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 158 [2025-04-14 00:13:57,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:13:57,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:13:57,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:13:57,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:13:57,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,530 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-04-14 00:13:57,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,542 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,544 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,553 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:13:57,554 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:13:57,554 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:13:57,554 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:13:57,554 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (1/1) ... [2025-04-14 00:13:57,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:13:57,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:13:57,577 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-14 00:13:57,579 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-14 00:13:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 00:13:57,593 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 00:13:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 00:13:57,593 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 00:13:57,593 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:13:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:13:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:13:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:13:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:13:57,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:13:57,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:13:57,595 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 00:13:57,827 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:13:57,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:13:58,039 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:13:58,040 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:13:58,040 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:13:58,719 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:13:58,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:58 BoogieIcfgContainer [2025-04-14 00:13:58,720 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:13:58,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:13:58,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:13:58,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:13:58,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:13:57" (1/3) ... [2025-04-14 00:13:58,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c3dbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:58, skipping insertion in model container [2025-04-14 00:13:58,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:13:57" (2/3) ... [2025-04-14 00:13:58,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c3dbd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:13:58, skipping insertion in model container [2025-04-14 00:13:58,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:13:58" (3/3) ... [2025-04-14 00:13:58,727 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i [2025-04-14 00:13:58,737 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:13:58,738 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_67-pthread_cond_wait_unknown_1_pos.i that has 3 procedures, 25 locations, 22 edges, 1 initial locations, 0 loop locations, and 1 error locations. [2025-04-14 00:13:58,738 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:13:58,774 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:13:58,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 62 flow [2025-04-14 00:13:58,831 INFO L116 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-04-14 00:13:58,833 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:13:58,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 0/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 22 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-14 00:13:58,835 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 24 transitions, 62 flow [2025-04-14 00:13:58,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 17 transitions, 43 flow [2025-04-14 00:13:58,845 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:13:58,854 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;@3d291bfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:13:58,854 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 00:13:58,867 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:13:58,867 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-14 00:13:58,867 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:13:58,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:58,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:58,868 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:13:58,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:58,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1274835215, now seen corresponding path program 1 times [2025-04-14 00:13:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:58,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254576421] [2025-04-14 00:13:58,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:58,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:59,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 00:13:59,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 00:13:59,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:59,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:59,494 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-14 00:13:59,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:59,496 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254576421] [2025-04-14 00:13:59,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254576421] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:59,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:59,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 00:13:59,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847418600] [2025-04-14 00:13:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:59,502 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:13:59,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:59,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:13:59,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:13:59,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 00:13:59,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 00:13:59,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:59,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 00:13:59,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:59,620 INFO L116 PetriNetUnfolderBase]: 54/121 cut-off events. [2025-04-14 00:13:59,620 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-14 00:13:59,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 121 events. 54/121 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 379 event pairs, 33 based on Foata normal form. 11/129 useless extension candidates. Maximal degree in co-relation 243. Up to 69 conditions per place. [2025-04-14 00:13:59,623 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 16 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2025-04-14 00:13:59,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 92 flow [2025-04-14 00:13:59,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:59,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2025-04-14 00:13:59,635 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2025-04-14 00:13:59,636 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 43 flow. Second operand 3 states and 32 transitions. [2025-04-14 00:13:59,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 92 flow [2025-04-14 00:13:59,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 00:13:59,643 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 49 flow [2025-04-14 00:13:59,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2025-04-14 00:13:59,650 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-04-14 00:13:59,650 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 49 flow [2025-04-14 00:13:59,650 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 00:13:59,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:59,651 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:13:59,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:13:59,651 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:13:59,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 961455656, now seen corresponding path program 1 times [2025-04-14 00:13:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:59,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449502715] [2025-04-14 00:13:59,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:59,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:59,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 00:13:59,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 00:13:59,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:59,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:00,040 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-14 00:14:00,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:00,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449502715] [2025-04-14 00:14:00,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449502715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:00,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:00,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:14:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903752674] [2025-04-14 00:14:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:00,041 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:14:00,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:00,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:14:00,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:14:00,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2025-04-14 00:14:00,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-14 00:14:00,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:00,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2025-04-14 00:14:00,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:00,126 INFO L116 PetriNetUnfolderBase]: 29/77 cut-off events. [2025-04-14 00:14:00,126 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-14 00:14:00,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 77 events. 29/77 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 6 based on Foata normal form. 14/88 useless extension candidates. Maximal degree in co-relation 64. Up to 27 conditions per place. [2025-04-14 00:14:00,127 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 14 selfloop transitions, 5 changer transitions 8/29 dead transitions. [2025-04-14 00:14:00,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 134 flow [2025-04-14 00:14:00,127 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:14:00,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:14:00,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-14 00:14:00,128 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.425 [2025-04-14 00:14:00,128 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 49 flow. Second operand 5 states and 51 transitions. [2025-04-14 00:14:00,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 134 flow [2025-04-14 00:14:00,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:14:00,129 INFO L231 Difference]: Finished difference. Result has 26 places, 12 transitions, 41 flow [2025-04-14 00:14:00,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=41, PETRI_PLACES=26, PETRI_TRANSITIONS=12} [2025-04-14 00:14:00,129 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2025-04-14 00:14:00,130 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 12 transitions, 41 flow [2025-04-14 00:14:00,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-14 00:14:00,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:00,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:14:00,130 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:14:00,130 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-14 00:14:00,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1923081955, now seen corresponding path program 1 times [2025-04-14 00:14:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:00,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356305561] [2025-04-14 00:14:00,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:00,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:00,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:14:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:14:00,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:00,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:14:00,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 00:14:00,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 00:14:00,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:00,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:14:00,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:14:00,294 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:14:00,297 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 00:14:00,299 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 00:14:00,299 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 00:14:00,299 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2025-04-14 00:14:00,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:14:00,299 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-04-14 00:14:00,342 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:14:00,342 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:14:00,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:14:00 BasicIcfg [2025-04-14 00:14:00,347 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:14:00,348 INFO L158 Benchmark]: Toolchain (without parser) took 3329.20ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.2MB). Peak memory consumption was 158.5MB. Max. memory is 8.0GB. [2025-04-14 00:14:00,348 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 163.6MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:14:00,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.25ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 66.2MB in the end (delta: 40.5MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 00:14:00,348 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.13ms. Allocated memory is still 155.2MB. Free memory was 66.2MB in the beginning and 62.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:14:00,348 INFO L158 Benchmark]: Boogie Preprocessor took 48.88ms. Allocated memory is still 155.2MB. Free memory was 62.9MB in the beginning and 59.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:14:00,348 INFO L158 Benchmark]: IcfgBuilder took 1166.35ms. Allocated memory is still 155.2MB. Free memory was 59.6MB in the beginning and 79.9MB in the end (delta: -20.3MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. [2025-04-14 00:14:00,348 INFO L158 Benchmark]: TraceAbstraction took 1625.73ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 78.8MB in the beginning and 106.3MB in the end (delta: -27.5MB). Peak memory consumption was 127.8MB. Max. memory is 8.0GB. [2025-04-14 00:14:00,349 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.21ms. Allocated memory is still 163.6MB. Free memory is still 89.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 447.25ms. Allocated memory is still 155.2MB. Free memory was 106.7MB in the beginning and 66.2MB in the end (delta: 40.5MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.13ms. Allocated memory is still 155.2MB. Free memory was 66.2MB in the beginning and 62.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.88ms. Allocated memory is still 155.2MB. Free memory was 62.9MB in the beginning and 59.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1166.35ms. Allocated memory is still 155.2MB. Free memory was 59.6MB in the beginning and 79.9MB in the end (delta: -20.3MB). Peak memory consumption was 44.1MB. Max. memory is 8.0GB. * TraceAbstraction took 1625.73ms. Allocated memory was 155.2MB in the beginning and 310.4MB in the end (delta: 155.2MB). Free memory was 78.8MB in the beginning and 106.3MB in the end (delta: -27.5MB). Peak memory consumption was 127.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1351] 0 int g; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1352] 0 pthread_mutex_t mut = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; [L1353] 0 pthread_cond_t cond = { { {0}, {0}, {0, 0}, {0, 0}, 0, 0, {0, 0} } }; [L1373] 0 pthread_t t1; [L1374] 0 pthread_t t2; [L1375] FCALL, FORK 0 pthread_create(&t1,((void *)0),f1,((void *)0)) VAL [\at(argc, Pre)=1200, \at(argv, Pre)={1180:1182}, \at(ptr, Pre)={0:0}, argc=1200, g=0, mut={3:0}, t1=-1] [L1377] FCALL, FORK 0 pthread_create(&t2,((void *)0),f2,((void *)0)) VAL [\at(argc, Pre)=1200, \at(argv, Pre)={1180:1182}, \at(ptr, Pre)={0:0}, argc=1200, g=0, mut={3:0}, t1=-1, t2=0] [L1356] 1 g = 1 VAL [\at(ptr, Pre)={0:0}, g=1, mut={3:0}, ptr={0:0}] [L1365] CALL 2 __VERIFIER_assert(g == 0) [L19] COND TRUE 2 !(cond) [L19] 2 reach_error() VAL [\at(cond, Pre)=0, \at(ptr, Pre)={0:0}, cond=0, g=1, mut={3:0}, ptr={0:0}] - UnprovableResult [Line: 1375]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1377]: 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 5 procedures, 43 locations, 42 edges, 4 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.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 60 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=1, InterpolantAutomatonStates: 8, 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, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 53 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-14 00:14:00,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...