/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking DFS --traceabstraction.criterion.for.conditional.commutativity.checking RANDOM --traceabstraction.probability.for.random.criterion 20 --traceabstraction.seed.for.random.criterion 213 -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.conditional-comm-3774817-m [2024-04-05 00:46:55,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-04-05 00:46:55,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-04-05 00:46:55,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-04-05 00:46:55,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-04-05 00:46:55,594 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-04-05 00:46:55,595 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-04-05 00:46:55,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-04-05 00:46:55,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-04-05 00:46:55,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-04-05 00:46:55,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-04-05 00:46:55,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-04-05 00:46:55,599 INFO L153 SettingsManager]: * Use SBE=true [2024-04-05 00:46:55,601 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-04-05 00:46:55,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-04-05 00:46:55,601 INFO L153 SettingsManager]: * sizeof long=4 [2024-04-05 00:46:55,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-04-05 00:46:55,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-04-05 00:46:55,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-04-05 00:46:55,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-04-05 00:46:55,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-04-05 00:46:55,602 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-04-05 00:46:55,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-04-05 00:46:55,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-04-05 00:46:55,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-04-05 00:46:55,604 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-04-05 00:46:55,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-04-05 00:46:55,604 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-04-05 00:46:55,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-04-05 00:46:55,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 00:46:55,605 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-04-05 00:46:55,605 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-04-05 00:46:55,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-04-05 00:46:55,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-04-05 00:46:55,606 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-04-05 00:46:55,606 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-04-05 00:46:55,606 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-04-05 00:46:55,606 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-04-05 00:46:55,606 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-04-05 00:46:55,606 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> DFS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> RANDOM Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: probability for random criterion as percentage -> 20 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: seed for random criterion -> 213 [2024-04-05 00:46:55,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-04-05 00:46:55,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-04-05 00:46:55,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-04-05 00:46:55,866 INFO L270 PluginConnector]: Initializing CDTParser... [2024-04-05 00:46:55,866 INFO L274 PluginConnector]: CDTParser initialized [2024-04-05 00:46:55,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2024-04-05 00:46:56,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-04-05 00:46:57,166 INFO L384 CDTParser]: Found 1 translation units. [2024-04-05 00:46:57,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2024-04-05 00:46:57,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5dd5bfd24/ddb11f7edbea4a71a31a33fc213341e9/FLAG89326547d [2024-04-05 00:46:57,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/5dd5bfd24/ddb11f7edbea4a71a31a33fc213341e9 [2024-04-05 00:46:57,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-04-05 00:46:57,200 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-04-05 00:46:57,201 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-04-05 00:46:57,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-04-05 00:46:57,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-04-05 00:46:57,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f31680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57, skipping insertion in model container [2024-04-05 00:46:57,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-04-05 00:46:57,523 WARN L240 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-7.i[30243,30256] [2024-04-05 00:46:57,540 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 00:46:57,548 INFO L202 MainTranslator]: Completed pre-run [2024-04-05 00:46:57,575 WARN L240 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-7.i[30243,30256] [2024-04-05 00:46:57,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-04-05 00:46:57,636 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 00:46:57,637 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-04-05 00:46:57,642 INFO L206 MainTranslator]: Completed translation [2024-04-05 00:46:57,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57 WrapperNode [2024-04-05 00:46:57,643 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-04-05 00:46:57,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-04-05 00:46:57,644 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-04-05 00:46:57,644 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-04-05 00:46:57,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,686 INFO L138 Inliner]: procedures = 165, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2024-04-05 00:46:57,686 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-04-05 00:46:57,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-04-05 00:46:57,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-04-05 00:46:57,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-04-05 00:46:57,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,711 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-04-05 00:46:57,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-04-05 00:46:57,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-04-05 00:46:57,730 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-04-05 00:46:57,730 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (1/1) ... [2024-04-05 00:46:57,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-04-05 00:46:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:46:57,764 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-04-05 00:46:57,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-04-05 00:46:57,809 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-04-05 00:46:57,809 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-04-05 00:46:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-04-05 00:46:57,810 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-04-05 00:46:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-04-05 00:46:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-04-05 00:46:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-04-05 00:46:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-04-05 00:46:57,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-04-05 00:46:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-04-05 00:46:57,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-04-05 00:46:57,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-04-05 00:46:57,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-04-05 00:46:57,813 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-04-05 00:46:57,925 INFO L241 CfgBuilder]: Building ICFG [2024-04-05 00:46:57,926 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-04-05 00:46:58,067 INFO L282 CfgBuilder]: Performing block encoding [2024-04-05 00:46:58,074 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-04-05 00:46:58,075 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-04-05 00:46:58,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:46:58 BoogieIcfgContainer [2024-04-05 00:46:58,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-04-05 00:46:58,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-04-05 00:46:58,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-04-05 00:46:58,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-04-05 00:46:58,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 12:46:57" (1/3) ... [2024-04-05 00:46:58,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9d275d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:46:58, skipping insertion in model container [2024-04-05 00:46:58,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 12:46:57" (2/3) ... [2024-04-05 00:46:58,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a9d275d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 12:46:58, skipping insertion in model container [2024-04-05 00:46:58,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 12:46:58" (3/3) ... [2024-04-05 00:46:58,083 INFO L112 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2024-04-05 00:46:58,089 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-04-05 00:46:58,097 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-04-05 00:46:58,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-04-05 00:46:58,097 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-04-05 00:46:58,135 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-04-05 00:46:58,165 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-04-05 00:46:58,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-04-05 00:46:58,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:46:58,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-04-05 00:46:58,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-04-05 00:46:58,200 INFO L184 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-04-05 00:46:58,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:46:58,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-04-05 00:46:58,220 INFO L357 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, mHoare=true, 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;@4d2b84cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=DFS, mConComCheckerCriterion=RANDOM, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=20, mConComCheckerRandomSeed=213 [2024-04-05 00:46:58,220 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-04-05 00:46:58,726 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:46:58,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:46:58,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1184059601, now seen corresponding path program 1 times [2024-04-05 00:46:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:46:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540155863] [2024-04-05 00:46:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:46:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:46:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:46:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:46:59,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:46:59,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540155863] [2024-04-05 00:46:59,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540155863] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:46:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-04-05 00:46:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-04-05 00:46:59,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156959553] [2024-04-05 00:46:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:46:59,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-04-05 00:46:59,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:46:59,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-04-05 00:46:59,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-04-05 00:46:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:46:59,128 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:46:59,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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) [2024-04-05 00:46:59,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:46:59,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:46:59,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-04-05 00:46:59,260 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:46:59,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:46:59,260 INFO L85 PathProgramCache]: Analyzing trace with hash 546730109, now seen corresponding path program 1 times [2024-04-05 00:46:59,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:46:59,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130015163] [2024-04-05 00:46:59,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:46:59,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:46:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:46:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:46:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:46:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130015163] [2024-04-05 00:46:59,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130015163] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:46:59,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812825345] [2024-04-05 00:46:59,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:46:59,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:46:59,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:46:59,490 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:46:59,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-04-05 00:46:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:46:59,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core [2024-04-05 00:46:59,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:46:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:46:59,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:46:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:46:59,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812825345] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:46:59,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:46:59,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-04-05 00:46:59,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093307085] [2024-04-05 00:46:59,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:46:59,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-04-05 00:46:59,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:46:59,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-04-05 00:46:59,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-04-05 00:46:59,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:46:59,736 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:46:59,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.7) internal successors, (127), 10 states have internal predecessors, (127), 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) [2024-04-05 00:46:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:46:59,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:46:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:46:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:46:59,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-04-05 00:47:00,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-04-05 00:47:00,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:47:00,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:47:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash -872570179, now seen corresponding path program 2 times [2024-04-05 00:47:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:47:00,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509888320] [2024-04-05 00:47:00,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:47:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:47:00,257 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:00,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:47:00,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509888320] [2024-04-05 00:47:00,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509888320] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:47:00,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273446147] [2024-04-05 00:47:00,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 00:47:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:00,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:47:00,262 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:47:00,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-04-05 00:47:00,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 00:47:00,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 00:47:00,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2024-04-05 00:47:00,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:47:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:00,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:47:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:00,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273446147] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:47:00,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:47:00,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-04-05 00:47:00,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405652433] [2024-04-05 00:47:00,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:47:00,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-04-05 00:47:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:47:00,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-04-05 00:47:00,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-04-05 00:47:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:00,567 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:47:00,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.833333333333334) internal successors, (195), 18 states have internal predecessors, (195), 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) [2024-04-05 00:47:00,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:00,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:00,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:00,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:00,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-04-05 00:47:01,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:01,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:47:01,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:47:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash 328881981, now seen corresponding path program 3 times [2024-04-05 00:47:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:47:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463595689] [2024-04-05 00:47:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:47:01,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:47:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 0 proven. 434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:47:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463595689] [2024-04-05 00:47:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463595689] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:47:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528225989] [2024-04-05 00:47:01,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-04-05 00:47:01,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:01,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:47:01,342 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:47:01,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-04-05 00:47:01,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-04-05 00:47:01,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 00:47:01,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2024-04-05 00:47:01,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:47:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 434 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:01,741 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 00:47:01,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528225989] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:47:01,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 00:47:01,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 32 [2024-04-05 00:47:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508097437] [2024-04-05 00:47:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:47:01,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-04-05 00:47:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:47:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-04-05 00:47:01,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2024-04-05 00:47:01,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:01,743 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:47:01,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.764705882352942) internal successors, (183), 17 states have internal predecessors, (183), 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) [2024-04-05 00:47:01,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:01,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:01,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:01,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:02,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-04-05 00:47:02,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:02,250 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:47:02,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:47:02,251 INFO L85 PathProgramCache]: Analyzing trace with hash 996868386, now seen corresponding path program 1 times [2024-04-05 00:47:02,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:47:02,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725402790] [2024-04-05 00:47:02,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:47:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:47:02,661 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:02,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:47:02,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725402790] [2024-04-05 00:47:02,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725402790] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:47:02,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783631181] [2024-04-05 00:47:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:02,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:02,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:47:02,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:47:02,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-04-05 00:47:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:47:02,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjunts are in the unsatisfiable core [2024-04-05 00:47:02,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:47:03,032 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-04-05 00:47:03,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-04-05 00:47:03,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783631181] provided 1 perfect and 0 imperfect interpolant sequences [2024-04-05 00:47:03,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-04-05 00:47:03,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [21] total 36 [2024-04-05 00:47:03,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003671730] [2024-04-05 00:47:03,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-04-05 00:47:03,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-04-05 00:47:03,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:47:03,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-04-05 00:47:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1061, Unknown=0, NotChecked=0, Total=1260 [2024-04-05 00:47:03,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:03,035 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:47:03,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.117647058823529) internal successors, (189), 17 states have internal predecessors, (189), 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) [2024-04-05 00:47:03,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:03,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:03,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:03,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:03,036 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:03,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:03,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-04-05 00:47:03,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:03,561 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:47:03,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:47:03,562 INFO L85 PathProgramCache]: Analyzing trace with hash 60620829, now seen corresponding path program 1 times [2024-04-05 00:47:03,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:47:03,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961984284] [2024-04-05 00:47:03,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:03,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:47:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:47:03,775 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:03,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:47:03,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961984284] [2024-04-05 00:47:03,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961984284] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:47:03,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357723715] [2024-04-05 00:47:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:03,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:03,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:47:03,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:47:03,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-04-05 00:47:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:47:03,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 16 conjunts are in the unsatisfiable core [2024-04-05 00:47:03,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:47:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:03,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:47:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:04,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357723715] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:47:04,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:47:04,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-04-05 00:47:04,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937306748] [2024-04-05 00:47:04,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:47:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-04-05 00:47:04,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:47:04,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-04-05 00:47:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-04-05 00:47:04,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:04,265 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:47:04,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.5) internal successors, (323), 34 states have internal predecessors, (323), 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) [2024-04-05 00:47:04,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:04,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:04,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:04,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:04,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:04,265 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 00:47:04,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-04-05 00:47:04,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:04,886 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:47:04,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:47:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1327961501, now seen corresponding path program 2 times [2024-04-05 00:47:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:47:04,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324567655] [2024-04-05 00:47:04,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:04,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:47:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-04-05 00:47:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-04-05 00:47:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324567655] [2024-04-05 00:47:05,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324567655] provided 0 perfect and 1 imperfect interpolant sequences [2024-04-05 00:47:05,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700091829] [2024-04-05 00:47:05,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-04-05 00:47:05,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-04-05 00:47:05,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-04-05 00:47:05,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-04-05 00:47:05,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-04-05 00:47:05,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-04-05 00:47:05,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-04-05 00:47:05,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 32 conjunts are in the unsatisfiable core [2024-04-05 00:47:05,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-04-05 00:47:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:05,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-04-05 00:47:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 0 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-04-05 00:47:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700091829] provided 0 perfect and 2 imperfect interpolant sequences [2024-04-05 00:47:06,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-04-05 00:47:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 35 [2024-04-05 00:47:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807769252] [2024-04-05 00:47:06,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-04-05 00:47:06,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-04-05 00:47:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-04-05 00:47:06,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-04-05 00:47:06,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2024-04-05 00:47:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:06,094 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-04-05 00:47:06,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 7.2) internal successors, (252), 35 states have internal predecessors, (252), 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) [2024-04-05 00:47:06,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:06,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:06,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:06,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-04-05 00:47:06,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-04-05 00:47:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-04-05 00:47:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-04-05 00:47:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-04-05 00:47:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-04-05 00:47:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-04-05 00:47:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-04-05 00:47:06,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-04-05 00:47:06,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-04-05 00:47:06,771 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-04-05 00:47:06,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-04-05 00:47:06,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1654436186, now seen corresponding path program 3 times [2024-04-05 00:47:06,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-04-05 00:47:06,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647034033] [2024-04-05 00:47:06,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-04-05 00:47:06,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-04-05 00:47:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 00:47:06,803 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-04-05 00:47:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-04-05 00:47:06,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-04-05 00:47:06,875 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-04-05 00:47:06,876 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-04-05 00:47:06,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-04-05 00:47:06,877 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-04-05 00:47:06,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-04-05 00:47:06,880 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2024-04-05 00:47:06,884 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-04-05 00:47:06,884 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2024-04-05 00:47:06,946 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated [2024-04-05 00:47:06,947 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated [2024-04-05 00:47:06,961 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated [2024-04-05 00:47:06,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 12:47:06 BasicIcfg [2024-04-05 00:47:06,976 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-04-05 00:47:06,976 INFO L158 Benchmark]: Toolchain (without parser) took 9775.88ms. Allocated memory was 183.5MB in the beginning and 446.7MB in the end (delta: 263.2MB). Free memory was 114.2MB in the beginning and 285.5MB in the end (delta: -171.2MB). Peak memory consumption was 92.5MB. Max. memory is 8.0GB. [2024-04-05 00:47:06,976 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-04-05 00:47:06,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.77ms. Allocated memory was 183.5MB in the beginning and 330.3MB in the end (delta: 146.8MB). Free memory was 114.0MB in the beginning and 297.5MB in the end (delta: -183.5MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. [2024-04-05 00:47:06,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.35ms. Allocated memory is still 330.3MB. Free memory was 297.0MB in the beginning and 295.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-04-05 00:47:06,977 INFO L158 Benchmark]: Boogie Preprocessor took 41.30ms. Allocated memory is still 330.3MB. Free memory was 295.4MB in the beginning and 293.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-04-05 00:47:06,977 INFO L158 Benchmark]: RCFGBuilder took 346.66ms. Allocated memory is still 330.3MB. Free memory was 293.8MB in the beginning and 278.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-04-05 00:47:06,977 INFO L158 Benchmark]: TraceAbstraction took 8897.90ms. Allocated memory was 330.3MB in the beginning and 446.7MB in the end (delta: 116.4MB). Free memory was 277.1MB in the beginning and 285.5MB in the end (delta: -8.4MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. [2024-04-05 00:47:06,978 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.10ms. Allocated memory is still 183.5MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.77ms. Allocated memory was 183.5MB in the beginning and 330.3MB in the end (delta: 146.8MB). Free memory was 114.0MB in the beginning and 297.5MB in the end (delta: -183.5MB). Peak memory consumption was 22.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.35ms. Allocated memory is still 330.3MB. Free memory was 297.0MB in the beginning and 295.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.30ms. Allocated memory is still 330.3MB. Free memory was 295.4MB in the beginning and 293.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 346.66ms. Allocated memory is still 330.3MB. Free memory was 293.8MB in the beginning and 278.6MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 8897.90ms. Allocated memory was 330.3MB in the beginning and 446.7MB in the end (delta: 116.4MB). Free memory was 277.1MB in the beginning and 285.5MB in the end (delta: -8.4MB). Peak memory consumption was 107.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret8 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 39268, independent: 32304, independent conditional: 30479, independent unconditional: 1825, dependent: 6964, dependent conditional: 5816, dependent unconditional: 1148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 32348, independent: 32304, independent conditional: 30479, independent unconditional: 1825, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32348, independent: 32304, independent conditional: 30479, independent unconditional: 1825, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 32348, independent: 32304, independent conditional: 30479, independent unconditional: 1825, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32412, independent: 32304, independent conditional: 4758, independent unconditional: 27546, dependent: 108, dependent conditional: 20, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32412, independent: 32304, independent conditional: 3632, independent unconditional: 28672, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32412, independent: 32304, independent conditional: 3632, independent unconditional: 28672, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 605, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 605, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 32412, independent: 31701, independent conditional: 3632, independent unconditional: 28069, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 605, unknown conditional: 0, unknown unconditional: 605] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 603, Positive conditional cache size: 0, Positive unconditional cache size: 603, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1146, Maximal queried relation: 1, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32412, independent: 32304, independent conditional: 4758, independent unconditional: 27546, dependent: 108, dependent conditional: 20, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32412, independent: 32304, independent conditional: 3632, independent unconditional: 28672, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32412, independent: 32304, independent conditional: 3632, independent unconditional: 28672, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 605, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 605, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 32412, independent: 31701, independent conditional: 3632, independent unconditional: 28069, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 605, unknown conditional: 0, unknown unconditional: 605] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 603, Positive conditional cache size: 0, Positive unconditional cache size: 603, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1146 ], Independence queries for same thread: 6920 - 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; VAL [i=0, j=0] [L685] 0 int p, q; VAL [i=0, j=0, p=0, q=0] [L702] 0 int cur = 1, prev = 0, next = 0; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0] [L703] 0 int x; VAL [cur=1, i=0, j=0, next=0, p=0, prev=0, q=0, x=0] [L713] 0 pthread_t id1, id2; VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=0, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L715] 0 i = 1 VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=0, next=0, p=0, prev=0, q=0, x=0] [L718] 0 j = 1 VAL [\old(argc)=1598, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, 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 [\old(argc)=1598, arg={0:0}, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L687] 1 p = 0 VAL [arg={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 [\old(argc)=1598, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, cur=1, i=1, id1={5:0}, id2={3:0}, j=1, next=0, p=0, prev=0, q=0, x=0] [L695] 2 q = 0 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=0, p=1, prev=0, q=1, x=0] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=0, q=1, x=0] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=2, j=3, next=1, p=1, prev=1, q=1, x=0] [L705] 0 x++ VAL [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=1, p=2, prev=1, q=2, x=1] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=5, j=8, next=2, p=2, prev=1, q=2, x=1] [L705] 0 x++ VAL [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=2, p=3, prev=1, q=3, x=2] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=1, q=3, x=2] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=2, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=13, j=21, next=3, p=3, prev=2, q=3, x=2] [L705] 0 x++ VAL [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=3, p=4, prev=2, q=4, x=3] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=2, q=4, x=3] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=3, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=34, j=55, next=5, p=4, prev=3, q=4, x=3] [L705] 0 x++ VAL [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=5, p=5, prev=3, q=5, x=4] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=3, q=5, x=4] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=5, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=89, j=144, next=8, p=5, prev=5, q=5, x=4] [L705] 0 x++ VAL [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=8, p=6, prev=5, q=6, x=5] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=13, p=6, prev=5, q=6, x=5] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=8, i=233, j=377, next=13, p=6, prev=8, q=6, x=5] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=233, j=377, next=13, p=6, prev=8, q=6, x=5] [L705] 0 x++ VAL [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 7 VAL [arg={0:0}, arg={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 [arg={0:0}, arg={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 [arg={0:0}, arg={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 < 16 VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=13, p=7, prev=8, q=7, x=6] [L706] 0 next = prev + cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=21, p=7, prev=8, q=7, x=6] [L707] 0 prev = cur VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=13, i=610, j=987, next=21, p=7, prev=13, q=7, x=6] [L708] 0 cur = next VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=6] [L705] 0 x++ VAL [arg={0:0}, arg={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 FALSE 1 !(p < 7) VAL [arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L692] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L695] COND FALSE 2 !(q < 7) VAL [\result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L700] 2 return ((void *)0); VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=21, p=7, prev=13, q=7, x=7] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=34, p=7, prev=13, q=7, x=7] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=21, i=610, j=987, next=34, p=7, prev=21, q=7, x=7] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=7] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=34, p=7, prev=21, q=7, x=8] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=55, p=7, prev=21, q=7, x=8] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=34, i=610, j=987, next=55, p=7, prev=34, q=7, x=8] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=8] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=9] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=55, p=7, prev=34, q=7, x=9] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=89, p=7, prev=34, q=7, x=9] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=55, i=610, j=987, next=89, p=7, prev=55, q=7, x=9] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=9] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=10] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=89, p=7, prev=55, q=7, x=10] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=144, p=7, prev=55, q=7, x=10] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=89, i=610, j=987, next=144, p=7, prev=89, q=7, x=10] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=10] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=11] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=144, p=7, prev=89, q=7, x=11] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=233, p=7, prev=89, q=7, x=11] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=144, i=610, j=987, next=233, p=7, prev=144, q=7, x=11] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=11] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=12] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=233, p=7, prev=144, q=7, x=12] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=377, p=7, prev=144, q=7, x=12] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=233, i=610, j=987, next=377, p=7, prev=233, q=7, x=12] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=12] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=13] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=377, p=7, prev=233, q=7, x=13] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=610, p=7, prev=233, q=7, x=13] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=377, i=610, j=987, next=610, p=7, prev=377, q=7, x=13] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=13] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=14] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=610, p=7, prev=377, q=7, x=14] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=987, p=7, prev=377, q=7, x=14] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=610, i=610, j=987, next=987, p=7, prev=610, q=7, x=14] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=14] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=15] [L705] COND TRUE 0 x < 16 VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=987, p=7, prev=610, q=7, x=15] [L706] 0 next = prev + cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=1597, p=7, prev=610, q=7, x=15] [L707] 0 prev = cur VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=987, i=610, j=987, next=1597, p=7, prev=987, q=7, x=15] [L708] 0 cur = next VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=15] [L705] 0 x++ VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L705] COND FALSE 0 !(x < 16) VAL [\result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L710] 0 return prev; VAL [\result=987, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L722] RET, EXPR 0 fib() [L722] 0 int correct = fib(); VAL [\old(argc)=1598, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, correct=987, cur=1597, i=610, id1={5:0}, id2={3:0}, j=987, next=1597, p=7, prev=987, q=7, x=16] [L724] 0 _Bool assert_cond = i < correct && j < correct; VAL [\old(argc)=1598, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, argc=1598, argv={1599:1600}, assert_cond=0, correct=987, cur=1597, i=610, id1={5:0}, id2={3:0}, j=987, next=1597, p=7, prev=987, q=7, x=16] [L726] CALL 0 __VERIFIER_assert(assert_cond) [L681] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] [L681] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cur=1597, expression=0, i=610, j=987, next=1597, p=7, prev=987, q=7, x=16] - 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.5s, 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: 174, 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.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2641 ConstructedInterpolants, 0 QuantifiedInterpolants, 6129 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1985 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 979/6299 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 RESULT: Ultimate proved your program to be incorrect! [2024-04-05 00:47:06,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-04-05 00:47:07,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...