/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:58:03,013 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:58:03,066 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:58:03,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:58:03,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:58:03,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:58:03,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:58:03,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:58:03,090 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:58:03,090 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:58:03,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:58:03,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:58:03,091 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:58:03,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:58:03,092 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:58:03,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:58:03,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:58:03,093 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:58:03,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:58:03,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:58:03,094 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:58:03,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:58:03,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:58:03,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:58:03,095 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:58:03,095 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:58:03,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:58:03,096 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:58:03,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:58:03,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:58:03,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:58:03,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:58:03,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:58:03,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:58:03,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:58:03,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:58:03,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:58:03,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:58:03,099 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:58:03,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:58:03,099 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:58:03,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:58:03,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:58:03,100 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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/UAutomizer-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.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 22:58:03,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:58:03,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:58:03,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:58:03,301 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:58:03,301 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:58:03,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2023-12-15 22:58:04,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:58:04,644 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:58:04,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2023-12-15 22:58:04,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5cc150d6/35daf355bf1c41579d29611d9bf5dfb7/FLAGec3d71e09 [2023-12-15 22:58:04,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5cc150d6/35daf355bf1c41579d29611d9bf5dfb7 [2023-12-15 22:58:04,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:58:04,665 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:58:04,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:58:04,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:58:04,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:58:04,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413e2893 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04, skipping insertion in model container [2023-12-15 22:58:04,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:58:04,841 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c[746,759] [2023-12-15 22:58:04,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:58:04,864 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:58:04,879 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c[746,759] [2023-12-15 22:58:04,880 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:58:04,890 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:58:04,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04 WrapperNode [2023-12-15 22:58:04,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:58:04,891 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:58:04,891 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:58:04,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:58:04,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,915 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-12-15 22:58:04,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:58:04,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:58:04,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:58:04,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:58:04,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,935 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-15 22:58:04,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,938 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,941 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:58:04,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:58:04,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:58:04,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:58:04,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (1/1) ... [2023-12-15 22:58:04,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:58:04,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:58:04,985 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 22:58:05,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 22:58:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-12-15 22:58:05,024 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-12-15 22:58:05,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:58:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:58:05,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:58:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:58:05,080 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:58:05,082 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:58:05,228 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:58:05,245 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:58:05,245 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 22:58:05,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:58:05 BoogieIcfgContainer [2023-12-15 22:58:05,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:58:05,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:58:05,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:58:05,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:58:05,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:58:04" (1/3) ... [2023-12-15 22:58:05,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc7fa73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:58:05, skipping insertion in model container [2023-12-15 22:58:05,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:58:04" (2/3) ... [2023-12-15 22:58:05,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cc7fa73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:58:05, skipping insertion in model container [2023-12-15 22:58:05,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:58:05" (3/3) ... [2023-12-15 22:58:05,253 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2023-12-15 22:58:05,270 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:58:05,270 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:58:05,312 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:58:05,317 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15852bf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:58:05,318 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:58:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 22:58:05,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 22:58:05,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:05,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:05,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:05,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1615401540, now seen corresponding path program 1 times [2023-12-15 22:58:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002146961] [2023-12-15 22:58:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:58:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:58:05,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:58:05,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002146961] [2023-12-15 22:58:05,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002146961] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:58:05,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:58:05,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:58:05,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773456341] [2023-12-15 22:58:05,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:58:05,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:58:05,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:58:05,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:58:05,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:58:05,671 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:58:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:58:05,786 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2023-12-15 22:58:05,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:58:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-15 22:58:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:58:05,795 INFO L225 Difference]: With dead ends: 26 [2023-12-15 22:58:05,795 INFO L226 Difference]: Without dead ends: 17 [2023-12-15 22:58:05,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:58:05,800 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:58:05,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 26 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:58:05,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-15 22:58:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-15 22:58:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-15 22:58:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-15 22:58:05,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2023-12-15 22:58:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:58:05,828 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-15 22:58:05,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:58:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-15 22:58:05,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 22:58:05,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:05,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:05,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:58:05,830 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:05,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:05,831 INFO L85 PathProgramCache]: Analyzing trace with hash -2136894566, now seen corresponding path program 1 times [2023-12-15 22:58:05,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:05,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588036577] [2023-12-15 22:58:05,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:05,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:58:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:58:05,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:58:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588036577] [2023-12-15 22:58:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588036577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:58:05,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:58:05,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:58:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411138916] [2023-12-15 22:58:05,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:58:05,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:58:05,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:58:05,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:58:05,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 22:58:05,906 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:58:05,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:58:05,950 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2023-12-15 22:58:05,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:58:05,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-15 22:58:05,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:58:05,953 INFO L225 Difference]: With dead ends: 23 [2023-12-15 22:58:05,953 INFO L226 Difference]: Without dead ends: 19 [2023-12-15 22:58:05,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:58:05,956 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:58:05,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 26 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:58:05,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-15 22:58:05,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-15 22:58:05,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-12-15 22:58:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-15 22:58:05,971 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2023-12-15 22:58:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:58:05,972 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-15 22:58:05,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-15 22:58:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-15 22:58:05,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 22:58:05,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:05,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:05,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:58:05,974 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:05,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:05,974 INFO L85 PathProgramCache]: Analyzing trace with hash -338238899, now seen corresponding path program 1 times [2023-12-15 22:58:05,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:05,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902747428] [2023-12-15 22:58:05,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:06,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:58:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:06,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:06,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:58:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 22:58:06,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:58:06,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902747428] [2023-12-15 22:58:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902747428] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:58:06,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33316992] [2023-12-15 22:58:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:06,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:06,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:58:06,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:58:06,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 22:58:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:06,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 22:58:06,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:58:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 22:58:06,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:58:06,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 22:58:06,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33316992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:58:06,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:58:06,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-12-15 22:58:06,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099460708] [2023-12-15 22:58:06,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:58:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 22:58:06,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:58:06,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 22:58:06,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:58:06,506 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-15 22:58:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:58:06,689 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2023-12-15 22:58:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 22:58:06,689 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2023-12-15 22:58:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:58:06,692 INFO L225 Difference]: With dead ends: 45 [2023-12-15 22:58:06,692 INFO L226 Difference]: Without dead ends: 28 [2023-12-15 22:58:06,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:58:06,699 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:58:06,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 54 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:58:06,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-15 22:58:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-15 22:58:06,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-12-15 22:58:06,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2023-12-15 22:58:06,713 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 22 [2023-12-15 22:58:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:58:06,714 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2023-12-15 22:58:06,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-12-15 22:58:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2023-12-15 22:58:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-15 22:58:06,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:06,720 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:06,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 22:58:06,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:06,925 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:06,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:06,927 INFO L85 PathProgramCache]: Analyzing trace with hash 255154638, now seen corresponding path program 1 times [2023-12-15 22:58:06,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:06,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460615225] [2023-12-15 22:58:06,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:06,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:58:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-12-15 22:58:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:58:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460615225] [2023-12-15 22:58:07,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460615225] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:58:07,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822186558] [2023-12-15 22:58:07,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:07,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:07,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:58:07,351 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:58:07,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 22:58:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:07,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 22:58:07,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:58:07,480 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-15 22:58:07,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:58:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-15 22:58:07,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822186558] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:58:07,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:58:07,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-12-15 22:58:07,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955762521] [2023-12-15 22:58:07,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:58:07,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 22:58:07,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:58:07,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 22:58:07,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-12-15 22:58:07,822 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-15 22:58:08,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:58:08,038 INFO L93 Difference]: Finished difference Result 72 states and 122 transitions. [2023-12-15 22:58:08,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:58:08,039 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 64 [2023-12-15 22:58:08,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:58:08,049 INFO L225 Difference]: With dead ends: 72 [2023-12-15 22:58:08,049 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 22:58:08,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-12-15 22:58:08,052 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:58:08,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:58:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 22:58:08,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-12-15 22:58:08,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2023-12-15 22:58:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 65 transitions. [2023-12-15 22:58:08,062 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 65 transitions. Word has length 64 [2023-12-15 22:58:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:58:08,062 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 65 transitions. [2023-12-15 22:58:08,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 18 states have internal predecessors, (50), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-12-15 22:58:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 65 transitions. [2023-12-15 22:58:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-15 22:58:08,065 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:08,065 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:08,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 22:58:08,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-15 22:58:08,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:08,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -625058046, now seen corresponding path program 2 times [2023-12-15 22:58:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:08,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327719144] [2023-12-15 22:58:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:08,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:58:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:58:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:58:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:58:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:58:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2023-12-15 22:58:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:58:08,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327719144] [2023-12-15 22:58:08,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327719144] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:58:08,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403446282] [2023-12-15 22:58:08,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 22:58:08,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:08,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:58:08,985 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:58:08,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 22:58:09,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 22:58:09,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:58:09,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-15 22:58:09,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:58:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2023-12-15 22:58:09,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:58:10,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2023-12-15 22:58:10,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403446282] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:58:10,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:58:10,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-12-15 22:58:10,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279503360] [2023-12-15 22:58:10,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:58:10,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-15 22:58:10,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:58:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-15 22:58:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-12-15 22:58:10,176 INFO L87 Difference]: Start difference. First operand 43 states and 65 transitions. Second operand has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-12-15 22:58:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:58:10,580 INFO L93 Difference]: Finished difference Result 118 states and 222 transitions. [2023-12-15 22:58:10,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-15 22:58:10,580 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 170 [2023-12-15 22:58:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:58:10,582 INFO L225 Difference]: With dead ends: 118 [2023-12-15 22:58:10,582 INFO L226 Difference]: Without dead ends: 75 [2023-12-15 22:58:10,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 382 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2023-12-15 22:58:10,585 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 81 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:58:10,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 86 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 22:58:10,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-15 22:58:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2023-12-15 22:58:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2023-12-15 22:58:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 104 transitions. [2023-12-15 22:58:10,596 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 104 transitions. Word has length 170 [2023-12-15 22:58:10,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:58:10,596 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 104 transitions. [2023-12-15 22:58:10,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.6956521739130435) internal successors, (62), 23 states have internal predecessors, (62), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-12-15 22:58:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 104 transitions. [2023-12-15 22:58:10,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2023-12-15 22:58:10,601 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:10,601 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:10,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 22:58:10,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:10,813 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:10,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:10,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1745181955, now seen corresponding path program 3 times [2023-12-15 22:58:10,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:10,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658784803] [2023-12-15 22:58:10,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:10,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:58:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:58:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:58:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-15 22:58:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:58:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:58:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2023-12-15 22:58:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:58:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658784803] [2023-12-15 22:58:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658784803] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:58:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018316631] [2023-12-15 22:58:12,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 22:58:12,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:12,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:58:12,268 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:58:12,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 22:58:12,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-12-15 22:58:12,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:58:12,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-15 22:58:12,453 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:58:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2023-12-15 22:58:12,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:58:14,525 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2023-12-15 22:58:14,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018316631] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:58:14,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:58:14,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2023-12-15 22:58:14,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672751702] [2023-12-15 22:58:14,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:58:14,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-15 22:58:14,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:58:14,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-15 22:58:14,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-12-15 22:58:14,530 INFO L87 Difference]: Start difference. First operand 65 states and 104 transitions. Second operand has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 33 states have internal predecessors, (82), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-12-15 22:58:15,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:58:15,004 INFO L93 Difference]: Finished difference Result 171 states and 338 transitions. [2023-12-15 22:58:15,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-15 22:58:15,006 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 33 states have internal predecessors, (82), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 350 [2023-12-15 22:58:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:58:15,014 INFO L225 Difference]: With dead ends: 171 [2023-12-15 22:58:15,014 INFO L226 Difference]: Without dead ends: 108 [2023-12-15 22:58:15,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 785 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2023-12-15 22:58:15,020 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 156 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:58:15,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 149 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:58:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-15 22:58:15,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-12-15 22:58:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 61 states have internal predecessors, (70), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2023-12-15 22:58:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 125 transitions. [2023-12-15 22:58:15,041 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 125 transitions. Word has length 350 [2023-12-15 22:58:15,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:58:15,042 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 125 transitions. [2023-12-15 22:58:15,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.484848484848485) internal successors, (82), 33 states have internal predecessors, (82), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-12-15 22:58:15,042 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 125 transitions. [2023-12-15 22:58:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2023-12-15 22:58:15,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:15,056 INFO L195 NwaCegarLoop]: trace histogram [87, 87, 70, 43, 43, 43, 43, 43, 43, 43, 27, 17, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:15,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 22:58:15,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:15,265 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:15,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash 225251225, now seen corresponding path program 4 times [2023-12-15 22:58:15,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:15,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161971675] [2023-12-15 22:58:15,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:15,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:58:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:16,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:16,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:58:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:58:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-15 22:58:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:58:17,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-15 22:58:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:58:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:58:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-15 22:58:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:17,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-15 22:58:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:58:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:58:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-15 22:58:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:58:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:58:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 3423 proven. 3437 refuted. 0 times theorem prover too weak. 14131 trivial. 0 not checked. [2023-12-15 22:58:18,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:58:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161971675] [2023-12-15 22:58:18,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161971675] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:58:18,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800625482] [2023-12-15 22:58:18,104 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-15 22:58:18,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:18,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:58:18,105 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:58:18,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 22:58:18,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-15 22:58:18,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:58:18,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-15 22:58:18,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:58:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 2164 proven. 4045 refuted. 0 times theorem prover too weak. 14782 trivial. 0 not checked. [2023-12-15 22:58:18,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:58:22,959 INFO L134 CoverageAnalysis]: Checked inductivity of 20991 backedges. 2164 proven. 4153 refuted. 0 times theorem prover too weak. 14674 trivial. 0 not checked. [2023-12-15 22:58:22,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800625482] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:58:22,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:58:22,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 31] total 45 [2023-12-15 22:58:22,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813936109] [2023-12-15 22:58:22,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:58:22,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-12-15 22:58:22,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:58:22,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-12-15 22:58:22,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2023-12-15 22:58:22,964 INFO L87 Difference]: Start difference. First operand 90 states and 125 transitions. Second operand has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 45 states have internal predecessors, (123), 41 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (68), 28 states have call predecessors, (68), 41 states have call successors, (68) [2023-12-15 22:58:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:58:23,616 INFO L93 Difference]: Finished difference Result 216 states and 397 transitions. [2023-12-15 22:58:23,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-15 22:58:23,617 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 45 states have internal predecessors, (123), 41 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (68), 28 states have call predecessors, (68), 41 states have call successors, (68) Word has length 595 [2023-12-15 22:58:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:58:23,619 INFO L225 Difference]: With dead ends: 216 [2023-12-15 22:58:23,619 INFO L226 Difference]: Without dead ends: 128 [2023-12-15 22:58:23,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1424 GetRequests, 1339 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2002 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2023-12-15 22:58:23,622 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 221 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 22:58:23,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 200 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 22:58:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-15 22:58:23,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2023-12-15 22:58:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 74 states have internal predecessors, (80), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2023-12-15 22:58:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 152 transitions. [2023-12-15 22:58:23,640 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 152 transitions. Word has length 595 [2023-12-15 22:58:23,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:58:23,641 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 152 transitions. [2023-12-15 22:58:23,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.7333333333333334) internal successors, (123), 45 states have internal predecessors, (123), 41 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (68), 28 states have call predecessors, (68), 41 states have call successors, (68) [2023-12-15 22:58:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 152 transitions. [2023-12-15 22:58:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2023-12-15 22:58:23,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:58:23,649 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1] [2023-12-15 22:58:23,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-15 22:58:23,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:58:23,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:58:23,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:58:23,857 INFO L85 PathProgramCache]: Analyzing trace with hash 2068824531, now seen corresponding path program 5 times [2023-12-15 22:58:23,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:58:23,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091332260] [2023-12-15 22:58:23,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:58:23,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:58:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:58:23,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 22:58:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:58:24,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 22:58:24,024 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 22:58:24,025 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:58:24,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:58:24,030 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2023-12-15 22:58:24,034 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:58:24,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:58:24 BoogieIcfgContainer [2023-12-15 22:58:24,135 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:58:24,136 INFO L158 Benchmark]: Toolchain (without parser) took 19471.04ms. Allocated memory was 328.2MB in the beginning and 569.4MB in the end (delta: 241.2MB). Free memory was 277.2MB in the beginning and 270.3MB in the end (delta: 6.9MB). Peak memory consumption was 249.1MB. Max. memory is 8.0GB. [2023-12-15 22:58:24,136 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 179.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:58:24,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.91ms. Allocated memory is still 328.2MB. Free memory was 276.6MB in the beginning and 266.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 22:58:24,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.26ms. Allocated memory is still 328.2MB. Free memory was 266.1MB in the beginning and 265.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 22:58:24,137 INFO L158 Benchmark]: Boogie Preprocessor took 25.97ms. Allocated memory is still 328.2MB. Free memory was 265.1MB in the beginning and 263.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:58:24,137 INFO L158 Benchmark]: RCFGBuilder took 302.75ms. Allocated memory is still 328.2MB. Free memory was 263.5MB in the beginning and 253.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-15 22:58:24,137 INFO L158 Benchmark]: TraceAbstraction took 18887.73ms. Allocated memory was 328.2MB in the beginning and 569.4MB in the end (delta: 241.2MB). Free memory was 252.5MB in the beginning and 270.3MB in the end (delta: -17.8MB). Peak memory consumption was 224.9MB. Max. memory is 8.0GB. [2023-12-15 22:58:24,139 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.11ms. Allocated memory is still 179.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.91ms. Allocated memory is still 328.2MB. Free memory was 276.6MB in the beginning and 266.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.26ms. Allocated memory is still 328.2MB. Free memory was 266.1MB in the beginning and 265.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.97ms. Allocated memory is still 328.2MB. Free memory was 265.1MB in the beginning and 263.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 302.75ms. Allocated memory is still 328.2MB. Free memory was 263.5MB in the beginning and 253.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 18887.73ms. Allocated memory was 328.2MB in the beginning and 569.4MB in the end (delta: 241.2MB). Free memory was 252.5MB in the beginning and 270.3MB in the end (delta: -17.8MB). Peak memory consumption was 224.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 8, TraceHistogramMax: 87, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 544 mSDsluCounter, 614 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1428 IncrementalHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 571 mSolverCounterUnsat, 125 mSDtfsCounter, 1428 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2934 GetRequests, 2695 SyntacticMatches, 30 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3417 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 2880 NumberOfCodeBlocks, 2694 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3605 ConstructedInterpolants, 0 QuantifiedInterpolants, 5681 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2275 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 71902/89736 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! [2023-12-15 22:58:24,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...