/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:38:12,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:38:12,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:38:12,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:38:12,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:38:12,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:38:12,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:38:12,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:38:12,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:38:12,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:38:12,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:38:12,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:38:12,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:38:12,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:38:12,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:38:12,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:38:12,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:38:12,975 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:38:12,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:38:12,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:38:12,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:38:12,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:38:12,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:38:12,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:38:12,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:38:12,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:38:12,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:38:12,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:38:12,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:38:12,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:38:12,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:38:13,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:38:13,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:38:13,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:38:13,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:38:13,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:38:13,004 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:38:13,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:38:13,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:38:13,005 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:38:13,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:38:13,007 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:38:13,027 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:38:13,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:38:13,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:38:13,029 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:38:13,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:38:13,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:38:13,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:38:13,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:38:13,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:38:13,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:38:13,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:38:13,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:38:13,032 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:38:13,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:38:13,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:38:13,033 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:38:13,033 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:38:13,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:38:13,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:38:13,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:38:13,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:38:13,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:38:13,035 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:38:13,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:38:13,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:38:13,464 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:38:13,466 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:38:13,467 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:38:13,468 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci04.c [2020-09-04 21:38:13,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4f9d04ac/afa3591ee3e742f0893d1727d5a3af32/FLAG54642aebf [2020-09-04 21:38:14,076 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:38:14,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci04.c [2020-09-04 21:38:14,085 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4f9d04ac/afa3591ee3e742f0893d1727d5a3af32/FLAG54642aebf [2020-09-04 21:38:14,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c4f9d04ac/afa3591ee3e742f0893d1727d5a3af32 [2020-09-04 21:38:14,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:38:14,443 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:38:14,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:38:14,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:38:14,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:38:14,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bffefb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14, skipping insertion in model container [2020-09-04 21:38:14,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:38:14,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:38:14,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:38:14,694 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:38:14,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:38:14,733 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:38:14,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14 WrapperNode [2020-09-04 21:38:14,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:38:14,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:38:14,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:38:14,734 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:38:14,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,757 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,840 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... [2020-09-04 21:38:14,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:38:14,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:38:14,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:38:14,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:38:14,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:38:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:38:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:38:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-09-04 21:38:14,923 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:38:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:38:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:38:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-09-04 21:38:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:38:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:38:14,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:38:15,138 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:38:15,138 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:38:15,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:38:15 BoogieIcfgContainer [2020-09-04 21:38:15,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:38:15,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:38:15,146 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:38:15,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:38:15,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:38:14" (1/3) ... [2020-09-04 21:38:15,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e26c142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:38:15, skipping insertion in model container [2020-09-04 21:38:15,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:14" (2/3) ... [2020-09-04 21:38:15,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e26c142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:38:15, skipping insertion in model container [2020-09-04 21:38:15,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:38:15" (3/3) ... [2020-09-04 21:38:15,154 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2020-09-04 21:38:15,170 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:38:15,181 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:38:15,207 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:38:15,240 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:38:15,240 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:38:15,240 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:38:15,241 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:38:15,245 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:38:15,245 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:38:15,245 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:38:15,245 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:38:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-09-04 21:38:15,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 21:38:15,280 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:15,281 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:15,281 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:15,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-09-04 21:38:15,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:15,303 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [517392459] [2020-09-04 21:38:15,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:38:15,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [517392459] [2020-09-04 21:38:15,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:15,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:38:15,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402003699] [2020-09-04 21:38:15,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:38:15,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:15,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:38:15,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:38:15,623 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-09-04 21:38:15,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:15,745 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-09-04 21:38:15,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:38:15,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 21:38:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:15,764 INFO L225 Difference]: With dead ends: 48 [2020-09-04 21:38:15,764 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:38:15,769 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-09-04 21:38:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:38:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:38:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:38:15,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:38:15,833 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-09-04 21:38:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:15,834 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:38:15,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:38:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:38:15,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 21:38:15,837 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:15,837 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:15,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:38:15,838 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-09-04 21:38:15,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:15,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [725974789] [2020-09-04 21:38:15,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:15,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:38:15,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [725974789] [2020-09-04 21:38:15,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:15,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:38:15,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206934983] [2020-09-04 21:38:15,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:38:15,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:15,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:38:15,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:38:15,948 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-09-04 21:38:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:16,024 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-09-04 21:38:16,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:38:16,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-09-04 21:38:16,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:16,027 INFO L225 Difference]: With dead ends: 38 [2020-09-04 21:38:16,027 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 21:38:16,028 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-09-04 21:38:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 21:38:16,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-09-04 21:38:16,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:38:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:38:16,040 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-09-04 21:38:16,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:16,041 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:38:16,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:38:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:38:16,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 21:38:16,043 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:16,043 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:16,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:38:16,044 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:16,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:16,044 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-09-04 21:38:16,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:16,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160666619] [2020-09-04 21:38:16,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:38:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:38:16,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160666619] [2020-09-04 21:38:16,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:16,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:38:16,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686622986] [2020-09-04 21:38:16,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:16,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:16,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:16,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:16,157 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 21:38:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:16,253 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-09-04 21:38:16,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:38:16,254 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-09-04 21:38:16,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:16,255 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:38:16,256 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 21:38:16,257 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:38:16,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 21:38:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-09-04 21:38:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 21:38:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-09-04 21:38:16,269 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-09-04 21:38:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:16,270 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-09-04 21:38:16,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-09-04 21:38:16,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 21:38:16,272 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:16,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:16,273 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:38:16,273 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:16,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:16,274 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-09-04 21:38:16,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:16,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [904953580] [2020-09-04 21:38:16,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 21:38:16,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [904953580] [2020-09-04 21:38:16,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:16,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:38:16,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664398110] [2020-09-04 21:38:16,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:16,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:16,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:16,460 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-09-04 21:38:16,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:16,619 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-09-04 21:38:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:38:16,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-09-04 21:38:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:16,623 INFO L225 Difference]: With dead ends: 58 [2020-09-04 21:38:16,623 INFO L226 Difference]: Without dead ends: 52 [2020-09-04 21:38:16,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:38:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-09-04 21:38:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-09-04 21:38:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 21:38:16,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-09-04 21:38:16,640 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-09-04 21:38:16,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:16,641 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-09-04 21:38:16,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:16,641 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-09-04 21:38:16,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 21:38:16,644 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:16,644 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:16,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:38:16,645 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:16,645 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-09-04 21:38:16,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:16,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [68480819] [2020-09-04 21:38:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 21:38:16,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [68480819] [2020-09-04 21:38:16,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:16,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:38:16,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848136370] [2020-09-04 21:38:16,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:38:16,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:38:16,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:38:16,796 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-09-04 21:38:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:16,920 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-09-04 21:38:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:38:16,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-09-04 21:38:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:16,923 INFO L225 Difference]: With dead ends: 110 [2020-09-04 21:38:16,923 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 21:38:16,925 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 21:38:16,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-09-04 21:38:16,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 21:38:16,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-09-04 21:38:16,940 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-09-04 21:38:16,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:16,940 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-09-04 21:38:16,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:38:16,941 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-09-04 21:38:16,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 21:38:16,943 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:16,943 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:16,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:38:16,944 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:16,944 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-09-04 21:38:16,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:16,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [371576348] [2020-09-04 21:38:16,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:16,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 21:38:17,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [371576348] [2020-09-04 21:38:17,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:17,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:38:17,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986758972] [2020-09-04 21:38:17,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:38:17,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:17,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:38:17,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:38:17,124 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-09-04 21:38:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:17,262 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-09-04 21:38:17,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:38:17,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-09-04 21:38:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:17,266 INFO L225 Difference]: With dead ends: 88 [2020-09-04 21:38:17,266 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 21:38:17,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:17,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 21:38:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-09-04 21:38:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 21:38:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-09-04 21:38:17,287 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-09-04 21:38:17,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:17,287 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-09-04 21:38:17,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:38:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-09-04 21:38:17,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-04 21:38:17,293 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:17,293 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:17,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:38:17,296 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:17,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:17,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-09-04 21:38:17,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:17,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1763292605] [2020-09-04 21:38:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-09-04 21:38:17,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1763292605] [2020-09-04 21:38:17,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:17,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:17,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067762329] [2020-09-04 21:38:17,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:17,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:17,715 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-09-04 21:38:18,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:18,031 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-09-04 21:38:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:38:18,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-09-04 21:38:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:18,035 INFO L225 Difference]: With dead ends: 139 [2020-09-04 21:38:18,035 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:38:18,037 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:38:18,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:38:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-09-04 21:38:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 21:38:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-09-04 21:38:18,050 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-09-04 21:38:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:18,051 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-09-04 21:38:18,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:18,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-09-04 21:38:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-09-04 21:38:18,053 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:18,053 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:18,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:38:18,053 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:18,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:18,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-09-04 21:38:18,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:18,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [991180138] [2020-09-04 21:38:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-09-04 21:38:18,275 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [991180138] [2020-09-04 21:38:18,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:18,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:38:18,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964459429] [2020-09-04 21:38:18,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:38:18,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:18,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:38:18,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:38:18,278 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-09-04 21:38:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:18,409 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-09-04 21:38:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:38:18,410 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-09-04 21:38:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:18,412 INFO L225 Difference]: With dead ends: 73 [2020-09-04 21:38:18,412 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 21:38:18,412 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:38:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 21:38:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-09-04 21:38:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-04 21:38:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-09-04 21:38:18,424 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-09-04 21:38:18,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:18,424 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-09-04 21:38:18,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:38:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-09-04 21:38:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 21:38:18,426 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:18,426 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:18,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:38:18,427 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-09-04 21:38:18,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:18,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [876990036] [2020-09-04 21:38:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:18,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:18,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 465 proven. 132 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2020-09-04 21:38:18,883 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [876990036] [2020-09-04 21:38:18,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:18,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:18,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670473497] [2020-09-04 21:38:18,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:18,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:18,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:18,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:18,886 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 10 states. [2020-09-04 21:38:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:19,138 INFO L93 Difference]: Finished difference Result 143 states and 194 transitions. [2020-09-04 21:38:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:38:19,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 195 [2020-09-04 21:38:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:19,140 INFO L225 Difference]: With dead ends: 143 [2020-09-04 21:38:19,140 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:38:19,141 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2020-09-04 21:38:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:38:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 21:38:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:38:19,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2020-09-04 21:38:19,151 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 77 transitions. Word has length 195 [2020-09-04 21:38:19,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:19,152 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 77 transitions. [2020-09-04 21:38:19,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2020-09-04 21:38:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-09-04 21:38:19,154 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:19,154 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:19,154 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:38:19,155 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:19,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:19,155 INFO L82 PathProgramCache]: Analyzing trace with hash -311463261, now seen corresponding path program 7 times [2020-09-04 21:38:19,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:19,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097524991] [2020-09-04 21:38:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:38:19,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:38:19,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:38:19,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:38:19,231 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:38:19,231 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:38:19,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:38:19,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:38:19 BoogieIcfgContainer [2020-09-04 21:38:19,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:38:19,293 INFO L168 Benchmark]: Toolchain (without parser) took 4848.94 ms. Allocated memory was 140.5 MB in the beginning and 278.4 MB in the end (delta: 137.9 MB). Free memory was 105.3 MB in the beginning and 219.2 MB in the end (delta: -113.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:19,294 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 140.5 MB. Free memory was 123.1 MB in the beginning and 122.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 21:38:19,295 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.45 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 94.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:19,296 INFO L168 Benchmark]: Boogie Preprocessor took 107.59 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 94.9 MB in the beginning and 183.3 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:19,296 INFO L168 Benchmark]: RCFGBuilder took 302.67 ms. Allocated memory is still 204.5 MB. Free memory was 183.3 MB in the beginning and 170.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:19,297 INFO L168 Benchmark]: TraceAbstraction took 4143.48 ms. Allocated memory was 204.5 MB in the beginning and 278.4 MB in the end (delta: 73.9 MB). Free memory was 169.4 MB in the beginning and 219.2 MB in the end (delta: -49.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:19,301 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.26 ms. Allocated memory is still 140.5 MB. Free memory was 123.1 MB in the beginning and 122.7 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.45 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 94.9 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.59 ms. Allocated memory was 140.5 MB in the beginning and 204.5 MB in the end (delta: 64.0 MB). Free memory was 94.9 MB in the beginning and 183.3 MB in the end (delta: -88.4 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 302.67 ms. Allocated memory is still 204.5 MB. Free memory was 183.3 MB in the beginning and 170.4 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4143.48 ms. Allocated memory was 204.5 MB in the beginning and 278.4 MB in the end (delta: 73.9 MB). Free memory was 169.4 MB in the beginning and 219.2 MB in the end (delta: -49.7 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=5, x=5] [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L29] int result = fibonacci(x); VAL [fibonacci(x)=5, result=5, x=5] [L30] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L33] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 21, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 280 SDtfs, 278 SDslu, 742 SDs, 0 SdLazy, 618 SolverSat, 130 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 247 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 766 NumberOfCodeBlocks, 766 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 615 ConstructedInterpolants, 0 QuantifiedInterpolants, 121037 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 2 PerfectInterpolantSequences, 1685/2143 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...