/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.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-11.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 10:36:35,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 10:36:35,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 10:36:35,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 10:36:35,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 10:36:35,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 10:36:35,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 10:36:35,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 10:36:35,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 10:36:35,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 10:36:35,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 10:36:35,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 10:36:35,826 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 10:36:35,827 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 10:36:35,827 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 10:36:35,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:35,828 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:35,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 10:36:35,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 10:36:35,829 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 10:36:35,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 10:36:35,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 10:36:35,829 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 10:36:35,829 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 10:36:35,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 10:36:36,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 10:36:36,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 10:36:36,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 10:36:36,067 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 10:36:36,068 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 10:36:36,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-11.i [2025-04-14 10:36:37,340 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0647c3ed4/d4d898fa0fde43709aad96488ffa6575/FLAG4f55b5b70 [2025-04-14 10:36:37,584 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 10:36:37,586 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-11.i [2025-04-14 10:36:37,600 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0647c3ed4/d4d898fa0fde43709aad96488ffa6575/FLAG4f55b5b70 [2025-04-14 10:36:38,341 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0647c3ed4/d4d898fa0fde43709aad96488ffa6575 [2025-04-14 10:36:38,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 10:36:38,344 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 10:36:38,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 10:36:38,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 10:36:38,349 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 10:36:38,350 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,350 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bac9cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38, skipping insertion in model container [2025-04-14 10:36:38,350 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 10:36:38,652 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-11.i[30243,30256] [2025-04-14 10:36:38,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:36:38,679 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 10:36:38,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-11.i[30243,30256] [2025-04-14 10:36:38,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 10:36:38,751 INFO L204 MainTranslator]: Completed translation [2025-04-14 10:36:38,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38 WrapperNode [2025-04-14 10:36:38,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 10:36:38,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 10:36:38,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 10:36:38,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 10:36:38,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,783 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-14 10:36:38,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 10:36:38,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 10:36:38,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 10:36:38,784 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 10:36:38,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,809 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,811 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 10:36:38,812 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 10:36:38,812 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 10:36:38,812 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 10:36:38,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (1/1) ... [2025-04-14 10:36:38,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 10:36:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:38,844 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 10:36:38,846 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 10:36:38,863 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-14 10:36:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-14 10:36:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-14 10:36:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-14 10:36:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 10:36:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 10:36:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 10:36:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 10:36:38,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 10:36:38,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 10:36:38,865 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 10:36:38,950 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 10:36:38,951 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 10:36:39,052 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 10:36:39,052 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 10:36:39,126 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 10:36:39,126 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 10:36:39,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:36:39 BoogieIcfgContainer [2025-04-14 10:36:39,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 10:36:39,128 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 10:36:39,128 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 10:36:39,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 10:36:39,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 10:36:38" (1/3) ... [2025-04-14 10:36:39,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffec80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:36:39, skipping insertion in model container [2025-04-14 10:36:39,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 10:36:38" (2/3) ... [2025-04-14 10:36:39,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ffec80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 10:36:39, skipping insertion in model container [2025-04-14 10:36:39,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 10:36:39" (3/3) ... [2025-04-14 10:36:39,132 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-11.i [2025-04-14 10:36:39,141 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 10:36:39,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-11.i that has 3 procedures, 26 locations, 27 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 10:36:39,143 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 10:36:39,179 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 10:36:39,208 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:36:39,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 10:36:39,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:39,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 10:36:39,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 10:36:39,262 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 10:36:39,277 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 10:36:39,282 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=PARTIAL_ORDER_FA, 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;@cb7fc5a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 10:36:39,283 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 10:36:39,559 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:39,559 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:39,559 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #1 [2025-04-14 10:36:39,559 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:36:39,560 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:39,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash -585029914, now seen corresponding path program 1 times [2025-04-14 10:36:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:39,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905719300] [2025-04-14 10:36:39,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:39,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 10:36:39,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 10:36:39,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:39,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:39,758 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 10:36:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:39,759 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905719300] [2025-04-14 10:36:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905719300] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:36:39,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:36:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 10:36:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329221748] [2025-04-14 10:36:39,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:36:39,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 10:36:39,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:39,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 10:36:39,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 10:36:39,778 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:39,779 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:39,780 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 10:36:39,780 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:39,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:39,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 10:36:39,824 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:39,824 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:39,825 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #2 [2025-04-14 10:36:39,825 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:39,825 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:39,825 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,825 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:39,825 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,825 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:39,838 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:39,838 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:39,839 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:39,839 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 24 [2025-04-14 10:36:39,839 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,839 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 10:36:39,839 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:39,839 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:39,839 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:39,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:39,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1099917870, now seen corresponding path program 1 times [2025-04-14 10:36:39,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:39,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136116455] [2025-04-14 10:36:39,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:39,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:39,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 10:36:39,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 10:36:39,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:39,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:39,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136116455] [2025-04-14 10:36:39,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136116455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:39,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918335114] [2025-04-14 10:36:39,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:39,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:39,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:39,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:39,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 10:36:40,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 10:36:40,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 10:36:40,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:40,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:40,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 10:36:40,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:36:40,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918335114] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:36:40,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:36:40,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-14 10:36:40,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138987301] [2025-04-14 10:36:40,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:36:40,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 10:36:40,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:40,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 10:36:40,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-14 10:36:40,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:40,108 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:40,108 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 10:36:40,108 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:40,108 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:40,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:40,180 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:40,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 10:36:40,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-04-14 10:36:40,381 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:40,381 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:40,381 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #3 [2025-04-14 10:36:40,381 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:40,381 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:40,382 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,382 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:40,382 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,382 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:40,382 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:40,382 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:40,382 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:40,382 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 45 [2025-04-14 10:36:40,382 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,382 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 47 [2025-04-14 10:36:40,382 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:40,382 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:40,382 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:40,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:40,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1414699802, now seen corresponding path program 2 times [2025-04-14 10:36:40,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:40,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531307101] [2025-04-14 10:36:40,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:36:40,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:40,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 10:36:40,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 10:36:40,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:36:40,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:40,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531307101] [2025-04-14 10:36:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531307101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:40,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407821667] [2025-04-14 10:36:40,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:36:40,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:40,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:40,569 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:40,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 10:36:40,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-14 10:36:40,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-14 10:36:40,626 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:36:40,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:40,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 10:36:40,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:36:40,760 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:40,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407821667] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:36:40,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:36:40,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-14 10:36:40,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127597343] [2025-04-14 10:36:40,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:36:40,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-14 10:36:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:40,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-14 10:36:40,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-14 10:36:40,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:40,761 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:40,761 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 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 10:36:40,761 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:40,762 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:40,762 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:40,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:40,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:40,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:40,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 10:36:41,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:41,059 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:41,059 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:41,059 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #4 [2025-04-14 10:36:41,059 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:41,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:41,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:41,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:41,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:41,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:41,059 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:41,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:41,059 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:41,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 87 [2025-04-14 10:36:41,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:41,059 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 89 [2025-04-14 10:36:41,059 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:41,060 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:41,060 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:41,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash 286974438, now seen corresponding path program 3 times [2025-04-14 10:36:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:41,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961358821] [2025-04-14 10:36:41,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:36:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:41,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-14 10:36:41,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 10:36:41,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-14 10:36:41,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:41,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:41,458 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961358821] [2025-04-14 10:36:41,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961358821] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:41,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440265851] [2025-04-14 10:36:41,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 10:36:41,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:41,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:41,461 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:41,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 10:36:41,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 11 equivalence classes. [2025-04-14 10:36:41,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 91 of 91 statements. [2025-04-14 10:36:41,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-14 10:36:41,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:41,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 10:36:41,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:41,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:36:41,861 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:41,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440265851] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:36:41,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:36:41,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-04-14 10:36:41,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904350346] [2025-04-14 10:36:41,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:36:41,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-14 10:36:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:41,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-14 10:36:41,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-04-14 10:36:41,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:41,863 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:41,864 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.08) internal successors, (177), 25 states have internal predecessors, (177), 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 10:36:41,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:41,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:41,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:41,864 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:42,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:42,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:42,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:42,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:36:42,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 10:36:42,251 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:42,251 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:42,251 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:42,252 INFO L139 ounterexampleChecker]: Examining path program with hash -1831457800, occurence #5 [2025-04-14 10:36:42,252 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:42,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:42,252 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:42,252 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:42,252 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:42,252 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:42,252 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:42,253 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 171 [2025-04-14 10:36:42,253 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,253 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 173 [2025-04-14 10:36:42,253 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:42,253 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:42,253 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:42,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:42,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1203837926, now seen corresponding path program 4 times [2025-04-14 10:36:42,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:42,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367872654] [2025-04-14 10:36:42,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 10:36:42,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:42,268 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 175 statements into 2 equivalence classes. [2025-04-14 10:36:42,296 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 175 of 175 statements. [2025-04-14 10:36:42,297 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 10:36:42,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 1671 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-04-14 10:36:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:42,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367872654] [2025-04-14 10:36:42,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367872654] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:36:42,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 10:36:42,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-04-14 10:36:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653825900] [2025-04-14 10:36:42,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:36:42,802 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 10:36:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:42,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 10:36:42,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-04-14 10:36:42,803 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:42,803 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:42,803 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.1) internal successors, (142), 20 states have internal predecessors, (142), 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 10:36:42,803 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:42,803 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:42,803 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:42,803 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:36:42,803 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:43,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:43,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:43,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:43,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:36:43,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:43,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 10:36:43,071 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:43,071 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:43,071 INFO L139 ounterexampleChecker]: Examining path program with hash -730712328, occurence #1 [2025-04-14 10:36:43,071 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:36:43,071 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:43,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:43,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1401890619, now seen corresponding path program 1 times [2025-04-14 10:36:43,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:43,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521745673] [2025-04-14 10:36:43,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:43,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-04-14 10:36:43,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-04-14 10:36:43,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:43,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:43,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:43,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521745673] [2025-04-14 10:36:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521745673] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:43,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133873634] [2025-04-14 10:36:43,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:43,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:43,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:43,719 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:43,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 10:36:43,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-04-14 10:36:43,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-04-14 10:36:43,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:43,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:43,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-14 10:36:43,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-04-14 10:36:44,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 10:36:44,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133873634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 10:36:44,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 10:36:44,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [25] total 37 [2025-04-14 10:36:44,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476565134] [2025-04-14 10:36:44,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 10:36:44,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 10:36:44,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:44,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 10:36:44,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=942, Unknown=0, NotChecked=0, Total=1332 [2025-04-14 10:36:44,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:44,044 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:44,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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 10:36:44,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:44,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:44,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:44,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:36:44,044 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:44,045 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:44,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:44,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:44,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:44,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:36:44,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:44,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:44,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 10:36:44,396 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:44,397 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:44,397 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:44,397 INFO L139 ounterexampleChecker]: Examining path program with hash 1175464527, occurence #1 [2025-04-14 10:36:44,397 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 10:36:44,397 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:44,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1587470795, now seen corresponding path program 1 times [2025-04-14 10:36:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:44,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788796525] [2025-04-14 10:36:44,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:44,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:44,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-14 10:36:44,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-14 10:36:44,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:44,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:44,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 10:36:44,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788796525] [2025-04-14 10:36:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788796525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 10:36:44,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829530600] [2025-04-14 10:36:44,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 10:36:44,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 10:36:44,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 10:36:44,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 10:36:44,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-04-14 10:36:44,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-04-14 10:36:44,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:44,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 10:36:44,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 10:36:44,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 10:36:45,007 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:45,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 10:36:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 10:36:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829530600] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 10:36:45,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 10:36:45,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 27 [2025-04-14 10:36:45,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121983136] [2025-04-14 10:36:45,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 10:36:45,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 10:36:45,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 10:36:45,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 10:36:45,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2025-04-14 10:36:45,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:45,318 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 10:36:45,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.592592592592593) internal successors, (124), 27 states have internal predecessors, (124), 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 10:36:45,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:45,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:45,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:45,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:36:45,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:45,318 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:45,319 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 10:36:45,407 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 10:36:45,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 10:36:45,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-14 10:36:45,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-14 10:36:45,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:45,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-14 10:36:45,408 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 10:36:45,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 10:36:45,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 10:36:45,609 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 10:36:45,609 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 10:36:45,609 INFO L139 ounterexampleChecker]: Examining path program with hash 1175464527, occurence #2 [2025-04-14 10:36:45,609 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 10:36:45,609 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 10:36:45,609 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:45,609 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 10:36:45,609 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:45,609 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 10:36:45,609 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:45,609 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 10:36:45,609 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 10:36:45,609 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 101 [2025-04-14 10:36:45,609 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:45,609 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 103 [2025-04-14 10:36:45,609 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:45,610 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 105 [2025-04-14 10:36:45,610 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 10:36:45,610 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 10:36:45,610 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 10:36:45,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 10:36:45,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1334032939, now seen corresponding path program 2 times [2025-04-14 10:36:45,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 10:36:45,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298510415] [2025-04-14 10:36:45,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 10:36:45,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 10:36:45,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 107 statements into 2 equivalence classes. [2025-04-14 10:36:45,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 107 of 107 statements. [2025-04-14 10:36:45,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 10:36:45,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:36:45,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 10:36:45,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-04-14 10:36:45,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-04-14 10:36:45,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 10:36:45,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 10:36:45,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 10:36:45,688 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 10:36:45,689 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 10:36:45,691 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 10:36:45,691 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 10:36:45,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 10:36:45,696 INFO L422 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1] [2025-04-14 10:36:45,849 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 10:36:45,849 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 10:36:45,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 10:36:45,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 10:36:45 BasicIcfg [2025-04-14 10:36:45,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 10:36:45,860 INFO L158 Benchmark]: Toolchain (without parser) took 7515.85ms. Allocated memory was 125.8MB in the beginning and 302.0MB in the end (delta: 176.2MB). Free memory was 84.8MB in the beginning and 243.1MB in the end (delta: -158.4MB). Peak memory consumption was 177.1MB. Max. memory is 8.0GB. [2025-04-14 10:36:45,860 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:36:45,860 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.86ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 62.5MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 10:36:45,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.92ms. Allocated memory is still 125.8MB. Free memory was 62.5MB in the beginning and 60.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 10:36:45,861 INFO L158 Benchmark]: Boogie Preprocessor took 27.63ms. Allocated memory is still 125.8MB. Free memory was 60.5MB in the beginning and 59.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 10:36:45,861 INFO L158 Benchmark]: RCFGBuilder took 314.34ms. Allocated memory is still 125.8MB. Free memory was 59.1MB in the beginning and 38.8MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 10:36:45,862 INFO L158 Benchmark]: TraceAbstraction took 6731.16ms. Allocated memory was 125.8MB in the beginning and 302.0MB in the end (delta: 176.2MB). Free memory was 38.2MB in the beginning and 243.1MB in the end (delta: -204.9MB). Peak memory consumption was 131.0MB. Max. memory is 8.0GB. [2025-04-14 10:36:45,863 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.24ms. Allocated memory is still 159.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.86ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 62.5MB in the end (delta: 22.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.92ms. Allocated memory is still 125.8MB. Free memory was 62.5MB in the beginning and 60.5MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.63ms. Allocated memory is still 125.8MB. Free memory was 60.5MB in the beginning and 59.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 314.34ms. Allocated memory is still 125.8MB. Free memory was 59.1MB in the beginning and 38.8MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 6731.16ms. Allocated memory was 125.8MB in the beginning and 302.0MB in the end (delta: 176.2MB). Free memory was 38.2MB in the beginning and 243.1MB in the end (delta: -204.9MB). Peak memory consumption was 131.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6275, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 1498, dependent conditional: 1491, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 0, independent unconditional: 4777, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 0, independent unconditional: 4777, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4784, independent: 4545, independent conditional: 0, independent unconditional: 4545, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4530, Maximal queried relation: 0, Independence queries for same thread: 1491, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 34, Number of trivial persistent sets: 20, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 254, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 6275, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 1498, dependent conditional: 1491, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 4530, independent unconditional: 247, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 0, independent unconditional: 4777, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4784, independent: 4777, independent conditional: 0, independent unconditional: 4777, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 239, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 239, independent: 230, independent conditional: 0, independent unconditional: 230, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 240, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 4784, independent: 4545, independent conditional: 0, independent unconditional: 4545, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 239, unknown conditional: 0, unknown unconditional: 239] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4530, Maximal queried relation: 0, Independence queries for same thread: 1491 - CounterExampleResult [Line: 681]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L682] 0 int i, j; [L685] 0 int p, q; [L702] 0 int cur = 1, prev = 0, next = 0; [L703] 0 int x; [L713] 0 pthread_t id1, id2; VAL [\at(argc, Pre)=75026, \at(argv, Pre)={75027:75028}, argc=75026, cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\at(argc, Pre)=75026, \at(argv, Pre)={75027:75028}, argc=75026, cur=1, i=1, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\at(argc, Pre)=75026, \at(argv, Pre)={75027:75028}, argc=75026, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L720] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\at(arg, Pre)={0:75028}, \at(argc, Pre)=75026, argc=75026, cur=1, i=1, id1=-2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L721] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(argc, Pre)=75026, \at(argv, Pre)={75027:75028}, arg={0:0}, argc=75026, cur=1, i=1, id1=-2, id2=-1, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L722] CALL, EXPR 0 fib() [L705] 0 x = 0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=1, j=1, next=0, p=0, prev=0, q=0, x=0] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=1, next=0, p=1, prev=0, q=0, x=0] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=0, x=0] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=1] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=1, prev=1, q=1, x=1] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=3, next=1, p=2, prev=1, q=1, x=1] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=1, x=1] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=2] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=2, prev=1, q=2, x=2] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=8, next=2, p=3, prev=1, q=2, x=2] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=2, x=2] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=3] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=3, prev=2, q=3, x=3] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=21, next=3, p=4, prev=2, q=3, x=3] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=3, x=3] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=4] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=4, prev=3, q=4, x=4] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=55, next=5, p=5, prev=3, q=4, x=4] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=4, x=4] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=5] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=5, prev=5, q=5, x=5] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=144, next=8, p=6, prev=5, q=5, x=5] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=5, x=5] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=6] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=6, prev=8, q=6, x=6] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=377, next=13, p=7, prev=8, q=6, x=6] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=6, x=6] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=7, prev=13, q=7, x=7] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=987, next=21, p=8, prev=13, q=7, x=7] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=7, x=7] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=21, i=1597, j=2584, next=21, p=8, prev=13, q=8, x=7] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=1597, j=2584, next=34, p=8, prev=21, q=8, x=8] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=8, prev=21, q=8, x=8] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=2584, next=34, p=9, prev=21, q=8, x=8] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=8, x=8] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=34, i=4181, j=6765, next=34, p=9, prev=21, q=9, x=8] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=4181, j=6765, next=55, p=9, prev=34, q=9, x=9] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=9, prev=34, q=9, x=9] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=6765, next=55, p=10, prev=34, q=9, x=9] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=9, x=9] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=55, i=10946, j=17711, next=55, p=10, prev=34, q=10, x=9] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] COND TRUE 1 p < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=10946, j=17711, next=89, p=10, prev=55, q=10, x=10] [L689] 1 i = i + j VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=10, prev=55, q=10, x=10] [L687] 1 p++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L695] COND TRUE 2 q < 11 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=17711, next=89, p=11, prev=55, q=10, x=10] [L697] 2 j = j + i VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=10, x=10] [L695] 2 q++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=89, i=28657, j=46368, next=89, p=11, prev=55, q=11, x=10] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, arg={0:0}, arg={0:0}, cur=144, i=28657, j=46368, next=144, p=11, prev=89, q=11, x=11] [L687] COND FALSE 1 !(p < 11) [L692] 1 return ((void *)0); [L695] COND FALSE 2 !(q < 11) [L700] 2 return ((void *)0); [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=233, i=28657, j=46368, next=233, p=11, prev=144, q=11, x=12] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=377, i=28657, j=46368, next=377, p=11, prev=233, q=11, x=13] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=610, i=28657, j=46368, next=610, p=11, prev=377, q=11, x=14] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=987, i=28657, j=46368, next=987, p=11, prev=610, q=11, x=15] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=28657, j=46368, next=1597, p=11, prev=987, q=11, x=16] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=2584, i=28657, j=46368, next=2584, p=11, prev=1597, q=11, x=17] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=4181, i=28657, j=46368, next=4181, p=11, prev=2584, q=11, x=18] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=6765, i=28657, j=46368, next=6765, p=11, prev=4181, q=11, x=19] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=10946, i=28657, j=46368, next=10946, p=11, prev=6765, q=11, x=20] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=17711, i=28657, j=46368, next=17711, p=11, prev=10946, q=11, x=21] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=28657, i=28657, j=46368, next=28657, p=11, prev=17711, q=11, x=22] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=46368, i=28657, j=46368, next=46368, p=11, prev=28657, q=11, x=23] [L705] COND TRUE 0 x < 24 [L706] 0 next = prev + cur [L707] 0 prev = cur [L708] 0 cur = next [L705] 0 x++ VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=75025, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L705] COND FALSE 0 !(x < 24) [L710] 0 return prev; [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:75028}, \at(argc, Pre)=75026, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, argc=75026, assert_cond=0, correct=46368, cur=75025, i=28657, id1=-2, id2=-1, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=75025, expression=0, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] [L681] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, cur=75025, expression=0, i=28657, j=46368, next=75025, p=11, prev=46368, q=11, x=24] - UnprovableResult [Line: 720]: 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: 721]: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 38 locations, 41 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 1.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 99, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 1279 ConstructedInterpolants, 0 QuantifiedInterpolants, 3255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1531 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 16 InterpolantComputations, 3 PerfectInterpolantSequences, 2431/5863 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 13, ConditionCalculationTime [ms]: 0, ConditionCalculations: 21, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 10:36:45,878 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...