/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 16:19:10,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 16:19:10,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 16:19:10,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 16:19:10,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 16:19:10,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 16:19:10,884 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 16:19:10,887 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 16:19:10,890 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 16:19:10,893 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 16:19:10,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 16:19:10,896 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 16:19:10,896 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 16:19:10,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 16:19:10,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 16:19:10,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 16:19:10,905 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 16:19:10,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 16:19:10,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 16:19:10,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 16:19:10,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 16:19:10,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 16:19:10,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 16:19:10,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 16:19:10,930 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 16:19:10,930 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 16:19:10,930 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 16:19:10,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 16:19:10,935 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 16:19:10,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 16:19:10,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 16:19:10,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 16:19:10,939 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 16:19:10,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 16:19:10,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 16:19:10,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 16:19:10,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 16:19:10,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 16:19:10,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 16:19:10,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 16:19:10,944 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 16:19:10,945 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-22 16:19:10,989 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 16:19:10,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 16:19:10,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 16:19:10,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 16:19:10,992 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 16:19:10,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 16:19:10,993 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 16:19:10,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 16:19:10,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 16:19:10,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 16:19:10,994 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 16:19:10,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 16:19:10,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 16:19:10,995 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 16:19:10,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 16:19:10,996 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 16:19:10,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 16:19:10,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 16:19:10,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 16:19:10,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 16:19:10,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 16:19:10,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 16:19:10,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 16:19:10,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 16:19:10,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 16:19:10,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 16:19:10,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 16:19:10,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 16:19:10,998 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 16:19:10,998 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 16:19:11,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 16:19:11,363 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 16:19:11,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 16:19:11,370 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 16:19:11,371 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 16:19:11,372 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 16:19:11,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c80700e/061d2fff9dbd4e53b74c7b7719218516/FLAGf49d03db8 [2020-08-22 16:19:11,948 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 16:19:11,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-08-22 16:19:11,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c80700e/061d2fff9dbd4e53b74c7b7719218516/FLAGf49d03db8 [2020-08-22 16:19:12,332 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5c80700e/061d2fff9dbd4e53b74c7b7719218516 [2020-08-22 16:19:12,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 16:19:12,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 16:19:12,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 16:19:12,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 16:19:12,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 16:19:12,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31a94c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12, skipping insertion in model container [2020-08-22 16:19:12,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 16:19:12,389 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 16:19:12,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:19:12,585 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 16:19:12,601 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 16:19:12,615 INFO L208 MainTranslator]: Completed translation [2020-08-22 16:19:12,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12 WrapperNode [2020-08-22 16:19:12,616 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 16:19:12,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 16:19:12,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 16:19:12,617 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 16:19:12,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,635 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,639 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... [2020-08-22 16:19:12,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 16:19:12,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 16:19:12,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 16:19:12,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 16:19:12,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 16:19:12,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 16:19:12,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 16:19:12,791 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 16:19:12,791 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 16:19:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 16:19:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 16:19:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 16:19:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 16:19:12,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 16:19:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 16:19:12,973 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 16:19:12,974 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 16:19:12,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:19:12 BoogieIcfgContainer [2020-08-22 16:19:12,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 16:19:12,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 16:19:12,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 16:19:12,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 16:19:12,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 04:19:12" (1/3) ... [2020-08-22 16:19:12,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1501f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:19:12, skipping insertion in model container [2020-08-22 16:19:12,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 04:19:12" (2/3) ... [2020-08-22 16:19:12,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1501f4db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 04:19:12, skipping insertion in model container [2020-08-22 16:19:12,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 04:19:12" (3/3) ... [2020-08-22 16:19:12,985 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-08-22 16:19:12,995 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 16:19:13,002 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 16:19:13,016 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 16:19:13,038 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 16:19:13,039 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 16:19:13,039 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 16:19:13,039 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 16:19:13,039 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 16:19:13,039 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 16:19:13,039 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 16:19:13,040 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 16:19:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-08-22 16:19:13,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-08-22 16:19:13,061 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:13,062 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:13,062 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:13,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2020-08-22 16:19:13,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:13,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267281185] [2020-08-22 16:19:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:13,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:19:13,284 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267281185] [2020-08-22 16:19:13,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:19:13,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 16:19:13,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810272562] [2020-08-22 16:19:13,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 16:19:13,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:13,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 16:19:13,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 16:19:13,311 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2020-08-22 16:19:13,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:13,444 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-08-22 16:19:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:19:13,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-08-22 16:19:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:13,461 INFO L225 Difference]: With dead ends: 35 [2020-08-22 16:19:13,461 INFO L226 Difference]: Without dead ends: 21 [2020-08-22 16:19:13,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 16:19:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-08-22 16:19:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-08-22 16:19:13,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 16:19:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 16:19:13,522 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-08-22 16:19:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:13,522 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 16:19:13,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 16:19:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 16:19:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-08-22 16:19:13,525 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:13,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:13,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 16:19:13,526 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:13,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:13,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2020-08-22 16:19:13,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:13,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53598917] [2020-08-22 16:19:13,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 16:19:13,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53598917] [2020-08-22 16:19:13,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 16:19:13,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 16:19:13,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814321958] [2020-08-22 16:19:13,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 16:19:13,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:13,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 16:19:13,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 16:19:13,627 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-08-22 16:19:13,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:13,717 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-08-22 16:19:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 16:19:13,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-08-22 16:19:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:13,721 INFO L225 Difference]: With dead ends: 27 [2020-08-22 16:19:13,721 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 16:19:13,723 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 16:19:13,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 16:19:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-08-22 16:19:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-08-22 16:19:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-08-22 16:19:13,732 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-08-22 16:19:13,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:13,732 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-08-22 16:19:13,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 16:19:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-08-22 16:19:13,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-08-22 16:19:13,734 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:13,734 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:13,735 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 16:19:13,735 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:13,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2020-08-22 16:19:13,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:13,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448647426] [2020-08-22 16:19:13,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-08-22 16:19:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,864 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 16:19:13,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448647426] [2020-08-22 16:19:13,864 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226425827] [2020-08-22 16:19:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:13,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-08-22 16:19:13,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 16:19:14,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:14,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-08-22 16:19:14,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271007430] [2020-08-22 16:19:14,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 16:19:14,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:14,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 16:19:14,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:19:14,069 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-08-22 16:19:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:14,204 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-08-22 16:19:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 16:19:14,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-08-22 16:19:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:14,206 INFO L225 Difference]: With dead ends: 38 [2020-08-22 16:19:14,206 INFO L226 Difference]: Without dead ends: 23 [2020-08-22 16:19:14,207 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-08-22 16:19:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-08-22 16:19:14,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-08-22 16:19:14,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-08-22 16:19:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-08-22 16:19:14,214 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-08-22 16:19:14,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:14,214 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-08-22 16:19:14,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 16:19:14,215 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-08-22 16:19:14,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-08-22 16:19:14,216 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:14,217 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:14,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-08-22 16:19:14,432 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2020-08-22 16:19:14,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:14,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287357228] [2020-08-22 16:19:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:14,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:14,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:14,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:14,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 16:19:14,573 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287357228] [2020-08-22 16:19:14,574 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850620960] [2020-08-22 16:19:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:14,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2020-08-22 16:19:14,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 16:19:14,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:14,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-08-22 16:19:14,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135518451] [2020-08-22 16:19:14,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 16:19:14,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 16:19:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-08-22 16:19:14,652 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-08-22 16:19:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:14,769 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-08-22 16:19:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 16:19:14,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-08-22 16:19:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:14,773 INFO L225 Difference]: With dead ends: 41 [2020-08-22 16:19:14,773 INFO L226 Difference]: Without dead ends: 37 [2020-08-22 16:19:14,774 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-08-22 16:19:14,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-08-22 16:19:14,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-08-22 16:19:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-08-22 16:19:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-08-22 16:19:14,785 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-08-22 16:19:14,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:14,785 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-08-22 16:19:14,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 16:19:14,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-08-22 16:19:14,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 16:19:14,788 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:14,788 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:15,001 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:15,002 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:15,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2020-08-22 16:19:15,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:15,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556387907] [2020-08-22 16:19:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 16:19:15,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556387907] [2020-08-22 16:19:15,149 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67750287] [2020-08-22 16:19:15,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:15,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-08-22 16:19:15,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:19:15,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 16:19:15,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 16:19:15,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:15,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-08-22 16:19:15,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602019684] [2020-08-22 16:19:15,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 16:19:15,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:15,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 16:19:15,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-08-22 16:19:15,286 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-08-22 16:19:15,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:15,542 INFO L93 Difference]: Finished difference Result 71 states and 106 transitions. [2020-08-22 16:19:15,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 16:19:15,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-08-22 16:19:15,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:15,545 INFO L225 Difference]: With dead ends: 71 [2020-08-22 16:19:15,545 INFO L226 Difference]: Without dead ends: 38 [2020-08-22 16:19:15,547 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-08-22 16:19:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-08-22 16:19:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-08-22 16:19:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-08-22 16:19:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-08-22 16:19:15,556 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 40 [2020-08-22 16:19:15,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:15,556 INFO L479 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-08-22 16:19:15,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 16:19:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-08-22 16:19:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-08-22 16:19:15,559 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:15,560 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:15,774 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:15,774 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 3 times [2020-08-22 16:19:15,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:15,776 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462244894] [2020-08-22 16:19:15,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,953 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-08-22 16:19:15,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462244894] [2020-08-22 16:19:15,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765455655] [2020-08-22 16:19:15,968 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:16,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-08-22 16:19:16,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:19:16,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjunts are in the unsatisfiable core [2020-08-22 16:19:16,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-08-22 16:19:16,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:16,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-08-22 16:19:16,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604142717] [2020-08-22 16:19:16,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 16:19:16,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:16,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 16:19:16,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:19:16,063 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-08-22 16:19:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:16,225 INFO L93 Difference]: Finished difference Result 87 states and 126 transitions. [2020-08-22 16:19:16,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 16:19:16,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2020-08-22 16:19:16,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:16,229 INFO L225 Difference]: With dead ends: 87 [2020-08-22 16:19:16,229 INFO L226 Difference]: Without dead ends: 50 [2020-08-22 16:19:16,230 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-08-22 16:19:16,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-08-22 16:19:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2020-08-22 16:19:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-08-22 16:19:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2020-08-22 16:19:16,242 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 68 [2020-08-22 16:19:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:16,242 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-08-22 16:19:16,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 16:19:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2020-08-22 16:19:16,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2020-08-22 16:19:16,245 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:16,245 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:16,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:16,461 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:16,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:16,462 INFO L82 PathProgramCache]: Analyzing trace with hash 580129251, now seen corresponding path program 4 times [2020-08-22 16:19:16,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:16,462 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691399068] [2020-08-22 16:19:16,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-22 16:19:16,767 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691399068] [2020-08-22 16:19:16,768 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253112877] [2020-08-22 16:19:16,768 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:16,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-08-22 16:19:16,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:19:16,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2020-08-22 16:19:16,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:16,909 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-08-22 16:19:16,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:16,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-08-22 16:19:16,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147443297] [2020-08-22 16:19:16,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 16:19:16,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 16:19:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-08-22 16:19:16,913 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand 10 states. [2020-08-22 16:19:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:17,113 INFO L93 Difference]: Finished difference Result 117 states and 176 transitions. [2020-08-22 16:19:17,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 16:19:17,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2020-08-22 16:19:17,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:17,124 INFO L225 Difference]: With dead ends: 117 [2020-08-22 16:19:17,124 INFO L226 Difference]: Without dead ends: 113 [2020-08-22 16:19:17,127 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-08-22 16:19:17,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-08-22 16:19:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2020-08-22 16:19:17,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-08-22 16:19:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 159 transitions. [2020-08-22 16:19:17,174 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 159 transitions. Word has length 109 [2020-08-22 16:19:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:17,177 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 159 transitions. [2020-08-22 16:19:17,177 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 16:19:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 159 transitions. [2020-08-22 16:19:17,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2020-08-22 16:19:17,185 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:17,186 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:17,401 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-08-22 16:19:17,402 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:17,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:17,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 5 times [2020-08-22 16:19:17,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:17,404 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308087413] [2020-08-22 16:19:17,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 16:19:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-08-22 16:19:17,925 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308087413] [2020-08-22 16:19:17,926 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716172854] [2020-08-22 16:19:17,926 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:18,024 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2020-08-22 16:19:18,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:19:18,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 10 conjunts are in the unsatisfiable core [2020-08-22 16:19:18,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-08-22 16:19:18,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:18,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-08-22 16:19:18,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497820230] [2020-08-22 16:19:18,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 16:19:18,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:18,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 16:19:18,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-08-22 16:19:18,098 INFO L87 Difference]: Start difference. First operand 104 states and 159 transitions. Second operand 11 states. [2020-08-22 16:19:18,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:18,351 INFO L93 Difference]: Finished difference Result 241 states and 406 transitions. [2020-08-22 16:19:18,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 16:19:18,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 177 [2020-08-22 16:19:18,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:18,357 INFO L225 Difference]: With dead ends: 241 [2020-08-22 16:19:18,357 INFO L226 Difference]: Without dead ends: 237 [2020-08-22 16:19:18,359 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2020-08-22 16:19:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-08-22 16:19:18,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 225. [2020-08-22 16:19:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-08-22 16:19:18,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 385 transitions. [2020-08-22 16:19:18,406 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 385 transitions. Word has length 177 [2020-08-22 16:19:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:18,407 INFO L479 AbstractCegarLoop]: Abstraction has 225 states and 385 transitions. [2020-08-22 16:19:18,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 16:19:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 385 transitions. [2020-08-22 16:19:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2020-08-22 16:19:18,414 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:18,414 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:18,629 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:18,630 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:18,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1242507885, now seen corresponding path program 6 times [2020-08-22 16:19:18,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:18,631 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186818950] [2020-08-22 16:19:18,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:18,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:18,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:18,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,084 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 16:19:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 16:19:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 16:19:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,572 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-08-22 16:19:19,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186818950] [2020-08-22 16:19:19,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615900435] [2020-08-22 16:19:19,790 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:19,910 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-08-22 16:19:19,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-08-22 16:19:19,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 14 conjunts are in the unsatisfiable core [2020-08-22 16:19:19,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 356 proven. 1124 refuted. 0 times theorem prover too weak. 5640 trivial. 0 not checked. [2020-08-22 16:19:20,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:20,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2020-08-22 16:19:20,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892150379] [2020-08-22 16:19:20,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-08-22 16:19:20,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-08-22 16:19:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2020-08-22 16:19:20,148 INFO L87 Difference]: Start difference. First operand 225 states and 385 transitions. Second operand 19 states. [2020-08-22 16:19:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:20,966 INFO L93 Difference]: Finished difference Result 339 states and 657 transitions. [2020-08-22 16:19:20,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2020-08-22 16:19:20,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 354 [2020-08-22 16:19:20,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:20,971 INFO L225 Difference]: With dead ends: 339 [2020-08-22 16:19:20,971 INFO L226 Difference]: Without dead ends: 118 [2020-08-22 16:19:20,975 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 457 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=372, Invalid=1350, Unknown=0, NotChecked=0, Total=1722 [2020-08-22 16:19:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-08-22 16:19:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2020-08-22 16:19:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-08-22 16:19:20,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2020-08-22 16:19:20,998 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 354 [2020-08-22 16:19:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:21,000 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2020-08-22 16:19:21,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-08-22 16:19:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2020-08-22 16:19:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2020-08-22 16:19:21,015 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:21,016 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:21,229 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:21,230 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:21,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1052494023, now seen corresponding path program 7 times [2020-08-22 16:19:21,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:21,231 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293709103] [2020-08-22 16:19:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:21,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 16:19:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:21,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-08-22 16:19:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:21,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:21,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:21,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 16:19:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 16:19:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-08-22 16:19:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-22 16:19:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,777 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-08-22 16:19:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-08-22 16:19:22,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-08-22 16:19:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 16:19:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 16:19:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:22,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-08-22 16:19:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:23,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1851 proven. 3572 refuted. 0 times theorem prover too weak. 13680 trivial. 0 not checked. [2020-08-22 16:19:23,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293709103] [2020-08-22 16:19:23,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134477478] [2020-08-22 16:19:23,209 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-08-22 16:19:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 16:19:23,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 30 conjunts are in the unsatisfiable core [2020-08-22 16:19:23,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 16:19:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1969 proven. 3803 refuted. 0 times theorem prover too weak. 13331 trivial. 0 not checked. [2020-08-22 16:19:23,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 16:19:23,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 21 [2020-08-22 16:19:23,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199423483] [2020-08-22 16:19:23,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-08-22 16:19:23,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 16:19:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-08-22 16:19:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2020-08-22 16:19:23,714 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand 21 states. [2020-08-22 16:19:24,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 16:19:24,764 INFO L93 Difference]: Finished difference Result 220 states and 376 transitions. [2020-08-22 16:19:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-08-22 16:19:24,765 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 572 [2020-08-22 16:19:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 16:19:24,767 INFO L225 Difference]: With dead ends: 220 [2020-08-22 16:19:24,770 INFO L226 Difference]: Without dead ends: 130 [2020-08-22 16:19:24,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=520, Invalid=1930, Unknown=0, NotChecked=0, Total=2450 [2020-08-22 16:19:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-08-22 16:19:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2020-08-22 16:19:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-08-22 16:19:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 156 transitions. [2020-08-22 16:19:24,793 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 156 transitions. Word has length 572 [2020-08-22 16:19:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 16:19:24,795 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 156 transitions. [2020-08-22 16:19:24,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-08-22 16:19:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 156 transitions. [2020-08-22 16:19:24,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2020-08-22 16:19:24,805 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 16:19:24,805 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 16:19:25,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-08-22 16:19:25,020 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 16:19:25,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 16:19:25,021 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 8 times [2020-08-22 16:19:25,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 16:19:25,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574167133] [2020-08-22 16:19:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 16:19:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 16:19:25,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 16:19:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-22 16:19:25,214 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-08-22 16:19:25,269 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-08-22 16:19:25,269 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-22 16:19:25,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 16:19:25,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 04:19:25 BoogieIcfgContainer [2020-08-22 16:19:25,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 16:19:25,423 INFO L168 Benchmark]: Toolchain (without parser) took 13075.38 ms. Allocated memory was 143.7 MB in the beginning and 600.3 MB in the end (delta: 456.7 MB). Free memory was 107.0 MB in the beginning and 342.5 MB in the end (delta: -235.5 MB). Peak memory consumption was 221.1 MB. Max. memory is 7.1 GB. [2020-08-22 16:19:25,424 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 143.7 MB. Free memory was 125.2 MB in the beginning and 124.8 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-08-22 16:19:25,425 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.07 ms. Allocated memory is still 143.7 MB. Free memory was 106.6 MB in the beginning and 97.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-08-22 16:19:25,425 INFO L168 Benchmark]: Boogie Preprocessor took 26.55 ms. Allocated memory is still 143.7 MB. Free memory was 97.5 MB in the beginning and 95.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-08-22 16:19:25,432 INFO L168 Benchmark]: RCFGBuilder took 334.32 ms. Allocated memory was 143.7 MB in the beginning and 205.0 MB in the end (delta: 61.3 MB). Free memory was 95.8 MB in the beginning and 172.0 MB in the end (delta: -76.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2020-08-22 16:19:25,436 INFO L168 Benchmark]: TraceAbstraction took 12438.52 ms. Allocated memory was 205.0 MB in the beginning and 600.3 MB in the end (delta: 395.3 MB). Free memory was 172.0 MB in the beginning and 342.5 MB in the end (delta: -170.5 MB). Peak memory consumption was 224.8 MB. Max. memory is 7.1 GB. [2020-08-22 16:19:25,444 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 143.7 MB. Free memory was 125.2 MB in the beginning and 124.8 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.07 ms. Allocated memory is still 143.7 MB. Free memory was 106.6 MB in the beginning and 97.5 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.55 ms. Allocated memory is still 143.7 MB. Free memory was 97.5 MB in the beginning and 95.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 334.32 ms. Allocated memory was 143.7 MB in the beginning and 205.0 MB in the end (delta: 61.3 MB). Free memory was 95.8 MB in the beginning and 172.0 MB in the end (delta: -76.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12438.52 ms. Allocated memory was 205.0 MB in the beginning and 600.3 MB in the end (delta: 395.3 MB). Free memory was 172.0 MB in the beginning and 342.5 MB in the end (delta: -170.5 MB). Peak memory consumption was 224.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.2s, OverallIterations: 11, TraceHistogramMax: 83, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 224 SDtfs, 636 SDslu, 691 SDs, 0 SdLazy, 1383 SolverSat, 711 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1952 GetRequests, 1780 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=225occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 66 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 3236 NumberOfCodeBlocks, 3026 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 2755 ConstructedInterpolants, 0 QuantifiedInterpolants, 1392871 SizeOfPredicates, 47 NumberOfNonLiveVariables, 2614 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 45939/57416 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! Received shutdown request...