/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/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:38:00,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:38:00,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:38:00,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:38:00,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:38:00,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:38:00,605 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:38:00,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:38:00,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:38:00,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:38:00,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:38:00,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:38:00,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:38:00,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:38:00,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:38:00,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:38:00,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:38:00,617 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:38:00,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:38:00,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:38:00,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:38:00,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:38:00,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:38:00,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:38:00,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:38:00,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:38:00,630 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:38:00,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:38:00,631 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:38:00,632 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:38:00,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:38:00,633 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:38:00,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:38:00,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:38:00,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:38:00,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:38:00,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:38:00,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:38:00,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:38:00,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:38:00,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:38:00,648 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:00,662 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:38:00,663 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:38:00,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:38:00,664 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:38:00,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:38:00,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:38:00,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:38:00,665 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:38:00,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:38:00,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:38:00,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:38:00,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:38:00,666 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:38:00,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:38:00,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:38:00,667 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:38:00,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:38:00,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:38:00,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:38:00,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:38:00,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:38:00,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:38:00,668 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:01,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:38:01,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:38:01,148 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:38:01,150 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:38:01,151 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:38:01,152 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-09-04 21:38:01,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5eae04e64/b2d9f57348bd44ffa69d9c3b660747b6/FLAG9871c123c [2020-09-04 21:38:01,737 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:38:01,737 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-09-04 21:38:01,746 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5eae04e64/b2d9f57348bd44ffa69d9c3b660747b6/FLAG9871c123c [2020-09-04 21:38:02,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/5eae04e64/b2d9f57348bd44ffa69d9c3b660747b6 [2020-09-04 21:38:02,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:38:02,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:38:02,100 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:38:02,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:38:02,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:38:02,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:38:02" (1/1) ... [2020-09-04 21:38:02,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75a18185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:02, skipping insertion in model container [2020-09-04 21:38:02,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:38:02" (1/1) ... [2020-09-04 21:38:02,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:38:02,147 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:38:02,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:38:02,355 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:38:02,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:38:02,388 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:38:02,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:02 WrapperNode [2020-09-04 21:38:02,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:38:02,390 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:38:02,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:38:02,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:38:02,406 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:02" (1/1) ... [2020-09-04 21:38:02,406 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:02" (1/1) ... [2020-09-04 21:38:02,411 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:02" (1/1) ... [2020-09-04 21:38:02,412 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:02" (1/1) ... [2020-09-04 21:38:02,415 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:02" (1/1) ... [2020-09-04 21:38:02,417 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:02" (1/1) ... [2020-09-04 21:38:02,418 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:02" (1/1) ... [2020-09-04 21:38:02,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:38:02,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:38:02,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:38:02,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:38:02,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:02" (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:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:38:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:38:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-09-04 21:38:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:38:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:38:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:38:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-09-04 21:38:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:38:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:38:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:38:02,804 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:38:02,804 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:38:02,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:38:02 BoogieIcfgContainer [2020-09-04 21:38:02,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:38:02,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:38:02,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:38:02,817 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:38:02,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:38:02" (1/3) ... [2020-09-04 21:38:02,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5098a70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:38:02, skipping insertion in model container [2020-09-04 21:38:02,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:02" (2/3) ... [2020-09-04 21:38:02,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5098a70e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:38:02, skipping insertion in model container [2020-09-04 21:38:02,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:38:02" (3/3) ... [2020-09-04 21:38:02,821 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-09-04 21:38:02,835 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:38:02,846 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:38:02,870 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:38:02,901 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:38:02,901 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:38:02,901 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:38:02,901 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:38:02,901 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:38:02,902 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:38:02,902 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:38:02,902 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:38:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-09-04 21:38:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 21:38:02,935 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:02,936 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:02,937 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:02,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:02,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1379859160, now seen corresponding path program 1 times [2020-09-04 21:38:02,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:02,958 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422007499] [2020-09-04 21:38:02,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,255 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:03,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [422007499] [2020-09-04 21:38:03,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:03,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 21:38:03,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874282503] [2020-09-04 21:38:03,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:38:03,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:03,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:38:03,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:38:03,282 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 7 states. [2020-09-04 21:38:03,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:03,523 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-09-04 21:38:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:38:03,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-04 21:38:03,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:03,540 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:38:03,540 INFO L226 Difference]: Without dead ends: 31 [2020-09-04 21:38:03,545 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:03,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-09-04 21:38:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-09-04 21:38:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-09-04 21:38:03,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-09-04 21:38:03,605 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2020-09-04 21:38:03,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:03,605 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-09-04 21:38:03,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:38:03,606 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-09-04 21:38:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 21:38:03,608 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:03,608 INFO L422 BasicCegarLoop]: trace histogram [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:03,609 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:38:03,609 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:03,610 INFO L82 PathProgramCache]: Analyzing trace with hash -2056866127, now seen corresponding path program 1 times [2020-09-04 21:38:03,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:03,611 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [397394370] [2020-09-04 21:38:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,723 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:03,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [397394370] [2020-09-04 21:38:03,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:03,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 21:38:03,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882402607] [2020-09-04 21:38:03,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:38:03,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:38:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:38:03,727 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2020-09-04 21:38:03,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:03,863 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-09-04 21:38:03,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:38:03,864 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-09-04 21:38:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:03,866 INFO L225 Difference]: With dead ends: 39 [2020-09-04 21:38:03,866 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 21:38:03,867 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:03,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 21:38:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-09-04 21:38:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-09-04 21:38:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-09-04 21:38:03,879 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2020-09-04 21:38:03,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:03,880 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-09-04 21:38:03,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:38:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-09-04 21:38:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 21:38:03,882 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:03,882 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, 1] [2020-09-04 21:38:03,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:38:03,883 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:03,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1274124978, now seen corresponding path program 1 times [2020-09-04 21:38:03,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:03,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1577423728] [2020-09-04 21:38:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:03,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:38:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,014 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:04,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1577423728] [2020-09-04 21:38:04,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:04,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:38:04,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778782303] [2020-09-04 21:38:04,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:04,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:04,017 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2020-09-04 21:38:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:04,112 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2020-09-04 21:38:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:38:04,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-09-04 21:38:04,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:04,114 INFO L225 Difference]: With dead ends: 55 [2020-09-04 21:38:04,114 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 21:38:04,115 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:04,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 21:38:04,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 21:38:04,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 21:38:04,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-09-04 21:38:04,126 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2020-09-04 21:38:04,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:04,127 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-09-04 21:38:04,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:04,127 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-09-04 21:38:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 21:38:04,129 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:04,129 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, 1] [2020-09-04 21:38:04,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:38:04,130 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2043121517, now seen corresponding path program 1 times [2020-09-04 21:38:04,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:04,131 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599075518] [2020-09-04 21:38:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,337 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 21:38:04,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599075518] [2020-09-04 21:38:04,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:04,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:38:04,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881031135] [2020-09-04 21:38:04,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:38:04,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:04,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:38:04,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:38:04,340 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 11 states. [2020-09-04 21:38:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:04,602 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2020-09-04 21:38:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 21:38:04,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-09-04 21:38:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:04,605 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:38:04,605 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:38:04,606 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2020-09-04 21:38:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:38:04,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-09-04 21:38:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-09-04 21:38:04,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-09-04 21:38:04,619 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2020-09-04 21:38:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:04,619 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-09-04 21:38:04,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:38:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-09-04 21:38:04,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 21:38:04,622 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:04,623 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 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] [2020-09-04 21:38:04,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:38:04,623 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:04,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:04,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1985616609, now seen corresponding path program 1 times [2020-09-04 21:38:04,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:04,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597822636] [2020-09-04 21:38:04,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:04,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:04,860 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 21:38:04,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597822636] [2020-09-04 21:38:04,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:04,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:38:04,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557812095] [2020-09-04 21:38:04,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:04,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:04,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:04,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:04,864 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 6 states. [2020-09-04 21:38:04,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:04,998 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2020-09-04 21:38:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:38:05,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2020-09-04 21:38:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:05,005 INFO L225 Difference]: With dead ends: 76 [2020-09-04 21:38:05,005 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 21:38:05,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 21:38:05,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 21:38:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 21:38:05,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-09-04 21:38:05,023 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 56 [2020-09-04 21:38:05,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:05,023 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-09-04 21:38:05,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-09-04 21:38:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 21:38:05,032 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:05,032 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, 1] [2020-09-04 21:38:05,032 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:38:05,032 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:05,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:05,033 INFO L82 PathProgramCache]: Analyzing trace with hash 847598467, now seen corresponding path program 2 times [2020-09-04 21:38:05,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:05,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [789865781] [2020-09-04 21:38:05,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:05,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:05,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,202 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:05,203 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [789865781] [2020-09-04 21:38:05,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:05,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:38:05,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731885233] [2020-09-04 21:38:05,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:38:05,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:05,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:38:05,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:38:05,205 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2020-09-04 21:38:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:05,307 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2020-09-04 21:38:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:38:05,307 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-09-04 21:38:05,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:05,309 INFO L225 Difference]: With dead ends: 77 [2020-09-04 21:38:05,309 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 21:38:05,310 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:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 21:38:05,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 21:38:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 21:38:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2020-09-04 21:38:05,320 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 54 [2020-09-04 21:38:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:05,320 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2020-09-04 21:38:05,320 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:38:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-09-04 21:38:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 21:38:05,322 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:05,322 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, 1] [2020-09-04 21:38:05,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:38:05,323 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1275966376, now seen corresponding path program 3 times [2020-09-04 21:38:05,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:05,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1229985825] [2020-09-04 21:38:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-09-04 21:38:05,529 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1229985825] [2020-09-04 21:38:05,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:05,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:38:05,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213006172] [2020-09-04 21:38:05,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:38:05,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:38:05,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:38:05,536 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 13 states. [2020-09-04 21:38:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:05,894 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2020-09-04 21:38:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:38:05,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-09-04 21:38:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:05,896 INFO L225 Difference]: With dead ends: 60 [2020-09-04 21:38:05,896 INFO L226 Difference]: Without dead ends: 54 [2020-09-04 21:38:05,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2020-09-04 21:38:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-09-04 21:38:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2020-09-04 21:38:05,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 21:38:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-09-04 21:38:05,916 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 55 [2020-09-04 21:38:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:05,917 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-09-04 21:38:05,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:38:05,917 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-09-04 21:38:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 21:38:05,921 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:05,922 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, 1] [2020-09-04 21:38:05,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:38:05,922 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -778718797, now seen corresponding path program 4 times [2020-09-04 21:38:05,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:05,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [703066633] [2020-09-04 21:38:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:05,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 57 proven. 70 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 21:38:06,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [703066633] [2020-09-04 21:38:06,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:06,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:38:06,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426431127] [2020-09-04 21:38:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:38:06,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:06,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:38:06,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:38:06,193 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 8 states. [2020-09-04 21:38:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:06,359 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-09-04 21:38:06,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:38:06,360 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-09-04 21:38:06,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:06,361 INFO L225 Difference]: With dead ends: 98 [2020-09-04 21:38:06,361 INFO L226 Difference]: Without dead ends: 62 [2020-09-04 21:38:06,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:38:06,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-09-04 21:38:06,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2020-09-04 21:38:06,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-09-04 21:38:06,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2020-09-04 21:38:06,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 90 [2020-09-04 21:38:06,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:06,376 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2020-09-04 21:38:06,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:38:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2020-09-04 21:38:06,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 21:38:06,378 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:06,378 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, 1] [2020-09-04 21:38:06,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:38:06,379 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:06,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:06,379 INFO L82 PathProgramCache]: Analyzing trace with hash 237402259, now seen corresponding path program 5 times [2020-09-04 21:38:06,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:06,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1316218829] [2020-09-04 21:38:06,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,617 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:06,674 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:06,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1316218829] [2020-09-04 21:38:06,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:06,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:06,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912538991] [2020-09-04 21:38:06,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:06,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:06,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:06,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:06,677 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 10 states. [2020-09-04 21:38:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:06,965 INFO L93 Difference]: Finished difference Result 126 states and 169 transitions. [2020-09-04 21:38:06,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:38:06,966 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2020-09-04 21:38:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:06,971 INFO L225 Difference]: With dead ends: 126 [2020-09-04 21:38:06,971 INFO L226 Difference]: Without dead ends: 79 [2020-09-04 21:38:06,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:38:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-04 21:38:07,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2020-09-04 21:38:07,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:38:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2020-09-04 21:38:07,004 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 126 [2020-09-04 21:38:07,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:07,004 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2020-09-04 21:38:07,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-09-04 21:38:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 21:38:07,006 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:07,006 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, 1] [2020-09-04 21:38:07,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:38:07,006 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:07,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1698410615, now seen corresponding path program 6 times [2020-09-04 21:38:07,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:07,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [936782074] [2020-09-04 21:38:07,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 21:38:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 8 proven. 109 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-09-04 21:38:07,323 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [936782074] [2020-09-04 21:38:07,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:07,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:38:07,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807767512] [2020-09-04 21:38:07,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:38:07,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:07,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:38:07,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:38:07,326 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 15 states. [2020-09-04 21:38:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:07,686 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-09-04 21:38:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:38:07,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-09-04 21:38:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:07,688 INFO L225 Difference]: With dead ends: 70 [2020-09-04 21:38:07,688 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:38:07,689 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2020-09-04 21:38:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:38:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:38:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:38:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:38:07,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2020-09-04 21:38:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:07,690 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:38:07,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:38:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:38:07,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:38:07,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:38:07,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:38:09,347 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-09-04 21:38:09,583 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2020-09-04 21:38:09,930 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2020-09-04 21:38:10,243 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-09-04 21:38:10,292 INFO L264 CegarLoopResult]: At program point fibonacciFINAL(lines 14 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= 0 |fibonacci_#res|) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|)) (and (<= |fibonacci_#in~n| 1) (<= 1 |fibonacci_#res|)) (<= |fibonacci_#in~n| 0))) [2020-09-04 21:38:10,293 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-09-04 21:38:10,293 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= 2 |fibonacci_#in~n|)) [2020-09-04 21:38:10,293 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= |fibonacci_#in~n| 2) (<= 1 |fibonacci_#t~ret0|) .cse0 (<= 2 |fibonacci_#in~n|)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 |fibonacci_#in~n|)))) [2020-09-04 21:38:10,293 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= |fibonacci_#in~n| 1) (= fibonacci_~n |fibonacci_#in~n|) (< 0 fibonacci_~n)) [2020-09-04 21:38:10,294 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= |fibonacci_#in~n| 2) (<= 1 |fibonacci_#t~ret0|) .cse0 (<= 2 |fibonacci_#in~n|)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 |fibonacci_#in~n|)))) [2020-09-04 21:38:10,294 INFO L264 CegarLoopResult]: At program point fibonacciEXIT(lines 14 22) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= 0 |fibonacci_#res|) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (<= 2 |fibonacci_#in~n|)) (and (<= |fibonacci_#in~n| 1) (<= 1 |fibonacci_#res|)) (<= |fibonacci_#in~n| 0))) [2020-09-04 21:38:10,294 INFO L264 CegarLoopResult]: At program point L17(lines 17 21) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (< 0 fibonacci_~n)) [2020-09-04 21:38:10,295 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) .cse0 .cse1 (< 1 fibonacci_~n)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 fibonacci_~n) .cse1))) [2020-09-04 21:38:10,295 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| 0)) [2020-09-04 21:38:10,295 INFO L264 CegarLoopResult]: At program point L20-4(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) .cse0 .cse1 (< 1 fibonacci_~n)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 fibonacci_~n) .cse1))) [2020-09-04 21:38:10,295 INFO L264 CegarLoopResult]: At program point L15(lines 15 21) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-09-04 21:38:10,295 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (and (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1)))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 fibonacci_~n)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) .cse0 (< 1 fibonacci_~n)))) (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1))) [2020-09-04 21:38:10,295 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)) (< 1 fibonacci_~n)) [2020-09-04 21:38:10,296 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:38:10,296 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:38:10,296 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:38:10,296 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:38:10,296 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:38:10,296 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:38:10,296 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-09-04 21:38:10,296 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) the Hoare annotation is: false [2020-09-04 21:38:10,296 INFO L264 CegarLoopResult]: At program point L31(lines 31 35) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-09-04 21:38:10,297 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-09-04 21:38:10,297 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-09-04 21:38:10,297 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-09-04 21:38:10,297 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 21:38:10,297 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-09-04 21:38:10,297 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-09-04 21:38:10,297 INFO L264 CegarLoopResult]: At program point L30-3(line 30) the Hoare annotation is: (and (<= main_~x~0 (+ main_~result~0 1)) (<= main_~x~0 (+ |main_#t~ret3| 1))) [2020-09-04 21:38:10,298 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-09-04 21:38:10,298 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-09-04 21:38:10,298 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 36) the Hoare annotation is: true [2020-09-04 21:38:10,298 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 36) the Hoare annotation is: true [2020-09-04 21:38:10,298 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-09-04 21:38:10,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:38:10 BoogieIcfgContainer [2020-09-04 21:38:10,324 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:38:10,327 INFO L168 Benchmark]: Toolchain (without parser) took 8229.00 ms. Allocated memory was 146.3 MB in the beginning and 305.1 MB in the end (delta: 158.9 MB). Free memory was 102.6 MB in the beginning and 138.0 MB in the end (delta: -35.4 MB). Peak memory consumption was 141.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:10,328 INFO L168 Benchmark]: CDTParser took 0.94 ms. Allocated memory is still 146.3 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 21:38:10,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.21 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 92.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:10,332 INFO L168 Benchmark]: Boogie Preprocessor took 30.36 ms. Allocated memory is still 146.3 MB. Free memory was 92.6 MB in the beginning and 91.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:10,335 INFO L168 Benchmark]: RCFGBuilder took 390.88 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 91.3 MB in the beginning and 169.8 MB in the end (delta: -78.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:10,336 INFO L168 Benchmark]: TraceAbstraction took 7511.66 ms. Allocated memory was 203.4 MB in the beginning and 305.1 MB in the end (delta: 101.7 MB). Free memory was 169.2 MB in the beginning and 138.0 MB in the end (delta: 31.2 MB). Peak memory consumption was 151.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:10,343 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.94 ms. Allocated memory is still 146.3 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.21 ms. Allocated memory is still 146.3 MB. Free memory was 102.4 MB in the beginning and 92.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.36 ms. Allocated memory is still 146.3 MB. Free memory was 92.6 MB in the beginning and 91.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 390.88 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 91.3 MB in the beginning and 169.8 MB in the end (delta: -78.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7511.66 ms. Allocated memory was 203.4 MB in the beginning and 305.1 MB in the end (delta: 101.7 MB). Free memory was 169.2 MB in the beginning and 138.0 MB in the end (delta: 31.2 MB). Peak memory consumption was 151.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 34]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 14]: Procedure Contract for fibonacci Derived contract for procedure fibonacci: (n == \old(n) && 0 <= \result) && (((\old(n) <= \result + 1 && 2 <= \old(n)) || (\old(n) <= 1 && 1 <= \result)) || \old(n) <= 0) - ProcedureContractResult [Line: 25]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.7s, OverallIterations: 10, TraceHistogramMax: 13, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 265 SDtfs, 347 SDslu, 1018 SDs, 0 SdLazy, 991 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 297 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=9, 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, 10 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 371 PreInvPairs, 650 NumberOfFragments, 310 HoareAnnotationTreeSize, 371 FomulaSimplifications, 11072 FormulaSimplificationTreeSizeReduction, 1.4s HoareSimplificationTime, 35 FomulaSimplificationsInter, 3696 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 583 NumberOfCodeBlocks, 583 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 573 ConstructedInterpolants, 0 QuantifiedInterpolants, 94359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 675/1096 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 correct! Received shutdown request...