/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-72570d3 [2020-08-22 21:52:11,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 21:52:11,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 21:52:11,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 21:52:11,366 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 21:52:11,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 21:52:11,377 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 21:52:11,380 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 21:52:11,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 21:52:11,385 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 21:52:11,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 21:52:11,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 21:52:11,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 21:52:11,389 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 21:52:11,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 21:52:11,393 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 21:52:11,394 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 21:52:11,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 21:52:11,396 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 21:52:11,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 21:52:11,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 21:52:11,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 21:52:11,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 21:52:11,407 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 21:52:11,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 21:52:11,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 21:52:11,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 21:52:11,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 21:52:11,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 21:52:11,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 21:52:11,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 21:52:11,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 21:52:11,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 21:52:11,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 21:52:11,432 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 21:52:11,432 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 21:52:11,432 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 21:52:11,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 21:52:11,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 21:52:11,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 21:52:11,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 21:52:11,439 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 21:52:11,451 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 21:52:11,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 21:52:11,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 21:52:11,453 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 21:52:11,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 21:52:11,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 21:52:11,454 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 21:52:11,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 21:52:11,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 21:52:11,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 21:52:11,455 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 21:52:11,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 21:52:11,455 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 21:52:11,456 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 21:52:11,456 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 21:52:11,456 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 21:52:11,456 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 21:52:11,457 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 21:52:11,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:52:11,457 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 21:52:11,457 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 21:52:11,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 21:52:11,458 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-08-22 21:52:11,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 21:52:11,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 21:52:11,758 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 21:52:11,759 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 21:52:11,762 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 21:52:11,763 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-08-22 21:52:11,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7d650e8/9e16df4b502e4bf68337857728d762ee/FLAG31c2a0a24 [2020-08-22 21:52:12,239 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 21:52:12,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-08-22 21:52:12,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7d650e8/9e16df4b502e4bf68337857728d762ee/FLAG31c2a0a24 [2020-08-22 21:52:12,660 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd7d650e8/9e16df4b502e4bf68337857728d762ee [2020-08-22 21:52:12,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 21:52:12,669 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 21:52:12,670 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 21:52:12,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 21:52:12,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 21:52:12,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:12,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157ca41e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12, skipping insertion in model container [2020-08-22 21:52:12,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:12,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 21:52:12,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 21:52:12,902 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:52:12,906 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 21:52:12,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:52:12,937 INFO L208 MainTranslator]: Completed translation [2020-08-22 21:52:12,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12 WrapperNode [2020-08-22 21:52:12,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 21:52:12,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 21:52:12,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 21:52:12,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 21:52:12,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:12,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:13,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:13,032 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:13,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:13,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:13,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... [2020-08-22 21:52:13,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 21:52:13,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 21:52:13,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 21:52:13,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 21:52:13,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:52:13,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 21:52:13,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 21:52:13,095 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-08-22 21:52:13,096 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 21:52:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 21:52:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 21:52:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-08-22 21:52:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 21:52:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 21:52:13,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 21:52:13,283 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 21:52:13,283 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 21:52:13,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:52:13 BoogieIcfgContainer [2020-08-22 21:52:13,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 21:52:13,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 21:52:13,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 21:52:13,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 21:52:13,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 09:52:12" (1/3) ... [2020-08-22 21:52:13,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f074712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:52:13, skipping insertion in model container [2020-08-22 21:52:13,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:52:12" (2/3) ... [2020-08-22 21:52:13,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f074712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:52:13, skipping insertion in model container [2020-08-22 21:52:13,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:52:13" (3/3) ... [2020-08-22 21:52:13,296 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-08-22 21:52:13,306 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 21:52:13,314 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 21:52:13,329 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 21:52:13,361 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 21:52:13,361 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 21:52:13,362 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 21:52:13,364 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 21:52:13,364 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 21:52:13,364 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 21:52:13,364 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 21:52:13,364 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 21:52:13,390 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-08-22 21:52:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-08-22 21:52:13,409 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:13,410 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-08-22 21:52:13,410 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:13,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:13,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1379859160, now seen corresponding path program 1 times [2020-08-22 21:52:13,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:13,427 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1513254124] [2020-08-22 21:52:13,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:13,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:13,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:13,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:13,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 21:52:13,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1513254124] [2020-08-22 21:52:13,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:52:13,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 21:52:13,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505306830] [2020-08-22 21:52:13,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:52:13,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:13,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:52:13,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:52:13,735 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 7 states. [2020-08-22 21:52:13,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:13,934 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-08-22 21:52:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 21:52:13,936 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-08-22 21:52:13,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:13,947 INFO L225 Difference]: With dead ends: 50 [2020-08-22 21:52:13,947 INFO L226 Difference]: Without dead ends: 31 [2020-08-22 21:52:13,951 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-08-22 21:52:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-08-22 21:52:13,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-08-22 21:52:13,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-08-22 21:52:14,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-08-22 21:52:14,002 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2020-08-22 21:52:14,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:14,003 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-08-22 21:52:14,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:52:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-08-22 21:52:14,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-08-22 21:52:14,005 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:14,006 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-08-22 21:52:14,006 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 21:52:14,007 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:14,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:14,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2056866127, now seen corresponding path program 1 times [2020-08-22 21:52:14,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:14,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524201981] [2020-08-22 21:52:14,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 21:52:14,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1524201981] [2020-08-22 21:52:14,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:52:14,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 21:52:14,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190644829] [2020-08-22 21:52:14,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:52:14,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:52:14,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:52:14,124 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2020-08-22 21:52:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:14,255 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-08-22 21:52:14,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 21:52:14,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-08-22 21:52:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:14,258 INFO L225 Difference]: With dead ends: 39 [2020-08-22 21:52:14,258 INFO L226 Difference]: Without dead ends: 33 [2020-08-22 21:52:14,259 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-08-22 21:52:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-22 21:52:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-08-22 21:52:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-08-22 21:52:14,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-08-22 21:52:14,272 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2020-08-22 21:52:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:14,276 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-08-22 21:52:14,276 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:52:14,276 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-08-22 21:52:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-08-22 21:52:14,278 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:14,278 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-08-22 21:52:14,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 21:52:14,279 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:14,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:14,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1274124978, now seen corresponding path program 1 times [2020-08-22 21:52:14,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:14,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1175614960] [2020-08-22 21:52:14,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 21:52:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 21:52:14,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1175614960] [2020-08-22 21:52:14,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:14,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 21:52:14,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623868613] [2020-08-22 21:52:14,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 21:52:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 21:52:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:52:14,428 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2020-08-22 21:52:14,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:14,520 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2020-08-22 21:52:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-08-22 21:52:14,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-08-22 21:52:14,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:14,522 INFO L225 Difference]: With dead ends: 55 [2020-08-22 21:52:14,522 INFO L226 Difference]: Without dead ends: 33 [2020-08-22 21:52:14,523 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-08-22 21:52:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-08-22 21:52:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-08-22 21:52:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-08-22 21:52:14,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-08-22 21:52:14,533 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2020-08-22 21:52:14,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:14,534 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-08-22 21:52:14,534 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 21:52:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-08-22 21:52:14,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-08-22 21:52:14,536 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:14,536 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-08-22 21:52:14,536 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 21:52:14,537 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2043121517, now seen corresponding path program 1 times [2020-08-22 21:52:14,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:14,538 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052905533] [2020-08-22 21:52:14,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:14,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,583 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 21:52:14,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052905533] [2020-08-22 21:52:14,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:14,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-08-22 21:52:14,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519546177] [2020-08-22 21:52:14,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 21:52:14,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:14,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 21:52:14,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-08-22 21:52:14,718 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 11 states. [2020-08-22 21:52:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:15,014 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-08-22 21:52:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 21:52:15,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-08-22 21:52:15,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:15,016 INFO L225 Difference]: With dead ends: 51 [2020-08-22 21:52:15,016 INFO L226 Difference]: Without dead ends: 45 [2020-08-22 21:52:15,017 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2020-08-22 21:52:15,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-22 21:52:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-08-22 21:52:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-08-22 21:52:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-08-22 21:52:15,030 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2020-08-22 21:52:15,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:15,031 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-08-22 21:52:15,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 21:52:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-08-22 21:52:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-08-22 21:52:15,034 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:15,034 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-08-22 21:52:15,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 21:52:15,034 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:15,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1985616609, now seen corresponding path program 1 times [2020-08-22 21:52:15,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:15,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2052520996] [2020-08-22 21:52:15,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 21:52:15,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2052520996] [2020-08-22 21:52:15,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:15,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 21:52:15,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257655902] [2020-08-22 21:52:15,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 21:52:15,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:15,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 21:52:15,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:52:15,180 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 6 states. [2020-08-22 21:52:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:15,317 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2020-08-22 21:52:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 21:52:15,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2020-08-22 21:52:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:15,320 INFO L225 Difference]: With dead ends: 76 [2020-08-22 21:52:15,320 INFO L226 Difference]: Without dead ends: 43 [2020-08-22 21:52:15,325 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-08-22 21:52:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-08-22 21:52:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-08-22 21:52:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-08-22 21:52:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-08-22 21:52:15,343 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 56 [2020-08-22 21:52:15,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:15,344 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-08-22 21:52:15,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 21:52:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-08-22 21:52:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-08-22 21:52:15,349 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:15,349 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-08-22 21:52:15,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 21:52:15,352 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:15,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:15,353 INFO L82 PathProgramCache]: Analyzing trace with hash 847598467, now seen corresponding path program 2 times [2020-08-22 21:52:15,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:15,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970178472] [2020-08-22 21:52:15,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:52:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-08-22 21:52:15,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970178472] [2020-08-22 21:52:15,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:15,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 21:52:15,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175344718] [2020-08-22 21:52:15,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:52:15,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:15,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:52:15,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:52:15,487 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2020-08-22 21:52:15,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:15,581 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2020-08-22 21:52:15,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:52:15,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-08-22 21:52:15,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:15,583 INFO L225 Difference]: With dead ends: 77 [2020-08-22 21:52:15,583 INFO L226 Difference]: Without dead ends: 43 [2020-08-22 21:52:15,584 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-08-22 21:52:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-08-22 21:52:15,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-08-22 21:52:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-08-22 21:52:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2020-08-22 21:52:15,593 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 54 [2020-08-22 21:52:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:15,594 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2020-08-22 21:52:15,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:52:15,594 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-08-22 21:52:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-08-22 21:52:15,596 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:15,596 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-08-22 21:52:15,597 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 21:52:15,597 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1275966376, now seen corresponding path program 3 times [2020-08-22 21:52:15,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:15,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2076402928] [2020-08-22 21:52:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:15,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:52:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:15,759 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-08-22 21:52:15,760 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2076402928] [2020-08-22 21:52:15,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:15,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 21:52:15,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245535184] [2020-08-22 21:52:15,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 21:52:15,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:15,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 21:52:15,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-08-22 21:52:15,762 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 13 states. [2020-08-22 21:52:16,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:16,088 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-08-22 21:52:16,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 21:52:16,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-08-22 21:52:16,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:16,090 INFO L225 Difference]: With dead ends: 61 [2020-08-22 21:52:16,090 INFO L226 Difference]: Without dead ends: 55 [2020-08-22 21:52:16,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=526, Unknown=0, NotChecked=0, Total=650 [2020-08-22 21:52:16,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-08-22 21:52:16,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-08-22 21:52:16,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-22 21:52:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-08-22 21:52:16,102 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 55 [2020-08-22 21:52:16,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:16,102 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-08-22 21:52:16,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 21:52:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-08-22 21:52:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-22 21:52:16,104 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:16,104 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-08-22 21:52:16,105 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 21:52:16,105 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:16,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash -778718797, now seen corresponding path program 4 times [2020-08-22 21:52:16,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:16,106 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1301399884] [2020-08-22 21:52:16,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:52:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:52:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 57 proven. 70 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-08-22 21:52:16,253 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1301399884] [2020-08-22 21:52:16,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:16,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-08-22 21:52:16,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438321791] [2020-08-22 21:52:16,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 21:52:16,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:16,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 21:52:16,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-08-22 21:52:16,255 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 8 states. [2020-08-22 21:52:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:16,396 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-08-22 21:52:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 21:52:16,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-08-22 21:52:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:16,398 INFO L225 Difference]: With dead ends: 98 [2020-08-22 21:52:16,398 INFO L226 Difference]: Without dead ends: 62 [2020-08-22 21:52:16,399 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-08-22 21:52:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-08-22 21:52:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2020-08-22 21:52:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-08-22 21:52:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2020-08-22 21:52:16,412 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 90 [2020-08-22 21:52:16,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:16,412 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2020-08-22 21:52:16,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 21:52:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2020-08-22 21:52:16,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-08-22 21:52:16,414 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:16,414 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-08-22 21:52:16,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 21:52:16,414 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:16,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:16,415 INFO L82 PathProgramCache]: Analyzing trace with hash 237402259, now seen corresponding path program 5 times [2020-08-22 21:52:16,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:16,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948735002] [2020-08-22 21:52:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,447 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:52:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:52:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:52:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:52:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-08-22 21:52:16,681 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948735002] [2020-08-22 21:52:16,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:16,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-08-22 21:52:16,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947135948] [2020-08-22 21:52:16,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 21:52:16,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:16,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 21:52:16,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 21:52:16,684 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 10 states. [2020-08-22 21:52:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:16,948 INFO L93 Difference]: Finished difference Result 126 states and 169 transitions. [2020-08-22 21:52:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 21:52:16,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2020-08-22 21:52:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:16,952 INFO L225 Difference]: With dead ends: 126 [2020-08-22 21:52:16,952 INFO L226 Difference]: Without dead ends: 79 [2020-08-22 21:52:16,954 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-08-22 21:52:16,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-08-22 21:52:16,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2020-08-22 21:52:16,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-08-22 21:52:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2020-08-22 21:52:16,971 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 126 [2020-08-22 21:52:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:16,972 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2020-08-22 21:52:16,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 21:52:16,972 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-08-22 21:52:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-22 21:52:16,973 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:52:16,973 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-08-22 21:52:16,974 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 21:52:16,974 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:52:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:52:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1698410615, now seen corresponding path program 6 times [2020-08-22 21:52:16,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:52:16,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [523584531] [2020-08-22 21:52:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:52:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:52:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-08-22 21:52:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-08-22 21:52:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 21:52:17,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 21:52:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-08-22 21:52:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:52:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 8 proven. 109 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-08-22 21:52:17,234 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [523584531] [2020-08-22 21:52:17,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:52:17,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 21:52:17,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138670352] [2020-08-22 21:52:17,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 21:52:17,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:52:17,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 21:52:17,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-08-22 21:52:17,236 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 15 states. [2020-08-22 21:52:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:52:17,549 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-08-22 21:52:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 21:52:17,549 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-08-22 21:52:17,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:52:17,550 INFO L225 Difference]: With dead ends: 70 [2020-08-22 21:52:17,550 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 21:52:17,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2020-08-22 21:52:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 21:52:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 21:52:17,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 21:52:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 21:52:17,553 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2020-08-22 21:52:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:52:17,553 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 21:52:17,553 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 21:52:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 21:52:17,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 21:52:17,553 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 21:52:17,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 21:52:18,284 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-08-22 21:52:18,765 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2020-08-22 21:52:19,087 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-08-22 21:52:19,139 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-08-22 21:52:19,139 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-08-22 21:52:19,140 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= 2 |fibonacci_#in~n|)) [2020-08-22 21:52:19,140 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-08-22 21:52:19,140 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-08-22 21:52:19,141 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-08-22 21:52:19,141 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-08-22 21:52:19,141 INFO L264 CegarLoopResult]: At program point L17(lines 17 21) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (< 0 fibonacci_~n)) [2020-08-22 21:52:19,142 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-08-22 21:52:19,142 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= fibonacci_~n |fibonacci_#in~n|) (<= |fibonacci_#in~n| 0)) [2020-08-22 21:52:19,142 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-08-22 21:52:19,142 INFO L264 CegarLoopResult]: At program point L15(lines 15 21) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-08-22 21:52:19,143 INFO L264 CegarLoopResult]: At program point L20-5(line 20) the Hoare annotation is: (let ((.cse0 (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret1| |fibonacci_#t~ret0| 1))) (.cse1 (= fibonacci_~n |fibonacci_#in~n|)) (.cse2 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) .cse0 (<= 3 fibonacci_~n) .cse1 .cse2) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) .cse0 .cse1 .cse2 (<= 2 |fibonacci_#in~n|)))) [2020-08-22 21:52:19,143 INFO L264 CegarLoopResult]: At program point L20-6(line 20) the Hoare annotation is: (let ((.cse0 (= fibonacci_~n |fibonacci_#in~n|)) (.cse1 (<= |fibonacci_#in~n| (+ |fibonacci_#res| 1)))) (or (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 1)) .cse0 .cse1 (< 1 fibonacci_~n)) (and (<= |fibonacci_#in~n| (+ |fibonacci_#t~ret0| 2)) (<= 3 fibonacci_~n) .cse0 .cse1))) [2020-08-22 21:52:19,143 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 21:52:19,143 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 21:52:19,143 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 21:52:19,143 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 21:52:19,144 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 21:52:19,144 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 21:52:19,144 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-08-22 21:52:19,144 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) the Hoare annotation is: false [2020-08-22 21:52:19,144 INFO L264 CegarLoopResult]: At program point L31(lines 31 35) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-08-22 21:52:19,144 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-08-22 21:52:19,145 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-08-22 21:52:19,145 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-08-22 21:52:19,145 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-08-22 21:52:19,146 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-08-22 21:52:19,146 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-08-22 21:52:19,147 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-08-22 21:52:19,147 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-08-22 21:52:19,147 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-08-22 21:52:19,147 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 36) the Hoare annotation is: true [2020-08-22 21:52:19,147 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 36) the Hoare annotation is: true [2020-08-22 21:52:19,147 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-08-22 21:52:19,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 09:52:19 BoogieIcfgContainer [2020-08-22 21:52:19,171 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 21:52:19,173 INFO L168 Benchmark]: Toolchain (without parser) took 6503.48 ms. Allocated memory was 141.0 MB in the beginning and 302.5 MB in the end (delta: 161.5 MB). Free memory was 105.1 MB in the beginning and 247.0 MB in the end (delta: -141.9 MB). Peak memory consumption was 165.2 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:19,174 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 21:52:19,175 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.52 ms. Allocated memory is still 141.0 MB. Free memory was 104.8 MB in the beginning and 95.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:19,176 INFO L168 Benchmark]: Boogie Preprocessor took 106.90 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 95.4 MB in the beginning and 183.0 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:19,179 INFO L168 Benchmark]: RCFGBuilder took 242.28 ms. Allocated memory is still 204.5 MB. Free memory was 183.0 MB in the beginning and 170.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:19,179 INFO L168 Benchmark]: TraceAbstraction took 5882.02 ms. Allocated memory was 204.5 MB in the beginning and 302.5 MB in the end (delta: 98.0 MB). Free memory was 169.9 MB in the beginning and 247.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 166.7 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:19,187 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.21 ms. Allocated memory is still 141.0 MB. Free memory was 123.6 MB in the beginning and 123.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.52 ms. Allocated memory is still 141.0 MB. Free memory was 104.8 MB in the beginning and 95.4 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 106.90 ms. Allocated memory was 141.0 MB in the beginning and 204.5 MB in the end (delta: 63.4 MB). Free memory was 95.4 MB in the beginning and 183.0 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 242.28 ms. Allocated memory is still 204.5 MB. Free memory was 183.0 MB in the beginning and 170.6 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5882.02 ms. Allocated memory was 204.5 MB in the beginning and 302.5 MB in the end (delta: 98.0 MB). Free memory was 169.9 MB in the beginning and 247.0 MB in the end (delta: -77.0 MB). Peak memory consumption was 166.7 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.1s, OverallIterations: 10, TraceHistogramMax: 13, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 265 SDtfs, 344 SDslu, 999 SDs, 0 SdLazy, 962 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.4s 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, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 371 PreInvPairs, 650 NumberOfFragments, 340 HoareAnnotationTreeSize, 371 FomulaSimplifications, 12697 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 35 FomulaSimplificationsInter, 3456 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s 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...