/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci01-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:12:15,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:12:15,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:12:15,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:12:15,839 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:12:15,846 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:12:15,850 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:12:15,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:12:15,856 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:12:15,860 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:12:15,861 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:12:15,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:12:15,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:12:15,865 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:12:15,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:12:15,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:12:15,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:12:15,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:12:15,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:12:15,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:12:15,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:12:15,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:12:15,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:12:15,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:12:15,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:12:15,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:12:15,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:12:15,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:12:15,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:12:15,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:12:15,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:12:15,906 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:12:15,909 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:12:15,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:12:15,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:12:15,913 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:12:15,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:12:15,914 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:12:15,914 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:12:15,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:12:15,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:12:15,918 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 16:12:15,935 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:12:15,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:12:15,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:12:15,938 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:12:15,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:12:15,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:12:15,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:12:15,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:12:15,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:12:15,939 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:12:15,940 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:12:15,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:12:15,940 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:12:15,940 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:12:15,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:12:15,941 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:12:15,941 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:12:15,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:12:15,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:12:15,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:12:15,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:12:15,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:12:15,943 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:12:16,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:12:16,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:12:16,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:12:16,361 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:12:16,362 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:12:16,363 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 16:12:16,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/40617d466/80ee9c4ca87f4b67acb3c6d7519c48b8/FLAG5d427ec4d [2020-09-04 16:12:16,973 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:12:16,974 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci01-1.c [2020-09-04 16:12:16,982 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/40617d466/80ee9c4ca87f4b67acb3c6d7519c48b8/FLAG5d427ec4d [2020-09-04 16:12:17,330 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/40617d466/80ee9c4ca87f4b67acb3c6d7519c48b8 [2020-09-04 16:12:17,343 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:12:17,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:12:17,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:12:17,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:12:17,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:12:17,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,355 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f2544e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17, skipping insertion in model container [2020-09-04 16:12:17,355 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:12:17,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:12:17,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:12:17,615 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:12:17,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:12:17,646 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:12:17,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17 WrapperNode [2020-09-04 16:12:17,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:12:17,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:12:17,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:12:17,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:12:17,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (1/1) ... [2020-09-04 16:12:17,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:12:17,675 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:12:17,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:12:17,675 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:12:17,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (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 16:12:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:12:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:12:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-09-04 16:12:17,819 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-09-04 16:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:12:17,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:12:18,068 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:12:18,069 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:12:18,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:12:18 BoogieIcfgContainer [2020-09-04 16:12:18,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:12:18,078 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:12:18,078 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:12:18,081 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:12:18,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:12:17" (1/3) ... [2020-09-04 16:12:18,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e91441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:12:18, skipping insertion in model container [2020-09-04 16:12:18,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:12:17" (2/3) ... [2020-09-04 16:12:18,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e91441 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:12:18, skipping insertion in model container [2020-09-04 16:12:18,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:12:18" (3/3) ... [2020-09-04 16:12:18,087 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2020-09-04 16:12:18,100 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:12:18,112 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:12:18,137 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:12:18,166 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:12:18,167 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:12:18,167 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:12:18,167 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:12:18,168 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:12:18,168 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:12:18,168 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:12:18,168 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:12:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2020-09-04 16:12:18,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 16:12:18,202 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:18,203 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 16:12:18,204 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1379859160, now seen corresponding path program 1 times [2020-09-04 16:12:18,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:18,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240566057] [2020-09-04 16:12:18,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:18,296 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,546 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 16:12:18,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240566057] [2020-09-04 16:12:18,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:18,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:12:18,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744272263] [2020-09-04 16:12:18,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:12:18,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:12:18,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:12:18,579 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 7 states. [2020-09-04 16:12:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:18,799 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-09-04 16:12:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:12:18,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-09-04 16:12:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:18,816 INFO L225 Difference]: With dead ends: 50 [2020-09-04 16:12:18,816 INFO L226 Difference]: Without dead ends: 31 [2020-09-04 16:12:18,821 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 16:12:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-09-04 16:12:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-09-04 16:12:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-09-04 16:12:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-09-04 16:12:18,884 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2020-09-04 16:12:18,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:18,884 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-09-04 16:12:18,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:12:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-09-04 16:12:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-09-04 16:12:18,887 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:18,887 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 16:12:18,888 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:12:18,888 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:18,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2056866127, now seen corresponding path program 1 times [2020-09-04 16:12:18,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:18,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864434080] [2020-09-04 16:12:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:18,892 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:18,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,021 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 16:12:19,022 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864434080] [2020-09-04 16:12:19,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:19,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:12:19,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514410441] [2020-09-04 16:12:19,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:12:19,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:19,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:12:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:12:19,027 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 7 states. [2020-09-04 16:12:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:19,164 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-09-04 16:12:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:12:19,165 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-09-04 16:12:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:19,167 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:12:19,167 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:12:19,170 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 16:12:19,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:12:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2020-09-04 16:12:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-09-04 16:12:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-09-04 16:12:19,182 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 20 [2020-09-04 16:12:19,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:19,182 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-09-04 16:12:19,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:12:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-09-04 16:12:19,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 16:12:19,184 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:19,185 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 16:12:19,185 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:12:19,185 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1274124978, now seen corresponding path program 1 times [2020-09-04 16:12:19,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:19,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1440827768] [2020-09-04 16:12:19,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:19,189 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:12:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 16:12:19,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1440827768] [2020-09-04 16:12:19,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:19,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:12:19,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251760182] [2020-09-04 16:12:19,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:12:19,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:19,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:12:19,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:12:19,317 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2020-09-04 16:12:19,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:19,414 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2020-09-04 16:12:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:12:19,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-09-04 16:12:19,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:19,416 INFO L225 Difference]: With dead ends: 55 [2020-09-04 16:12:19,416 INFO L226 Difference]: Without dead ends: 33 [2020-09-04 16:12:19,417 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 16:12:19,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-09-04 16:12:19,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-09-04 16:12:19,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-09-04 16:12:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-09-04 16:12:19,428 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 36 [2020-09-04 16:12:19,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:19,429 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-09-04 16:12:19,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:12:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-09-04 16:12:19,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-09-04 16:12:19,431 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:19,432 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 16:12:19,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:12:19,432 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:19,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:19,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2043121517, now seen corresponding path program 1 times [2020-09-04 16:12:19,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:19,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [658307992] [2020-09-04 16:12:19,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:19,436 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:19,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:12:19,622 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [658307992] [2020-09-04 16:12:19,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:19,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:12:19,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293351731] [2020-09-04 16:12:19,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:12:19,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:12:19,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:12:19,625 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 11 states. [2020-09-04 16:12:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:19,919 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2020-09-04 16:12:19,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:12:19,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-09-04 16:12:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:19,922 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:12:19,922 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:12:19,923 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-09-04 16:12:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:12:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-09-04 16:12:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-09-04 16:12:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2020-09-04 16:12:19,936 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 37 [2020-09-04 16:12:19,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:19,937 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2020-09-04 16:12:19,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:12:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2020-09-04 16:12:19,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-09-04 16:12:19,940 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:19,940 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 16:12:19,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:12:19,940 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:19,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1985616609, now seen corresponding path program 1 times [2020-09-04 16:12:19,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:19,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1984704810] [2020-09-04 16:12:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:19,944 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:19,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 16:12:20,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1984704810] [2020-09-04 16:12:20,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:20,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:12:20,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136007756] [2020-09-04 16:12:20,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:12:20,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:20,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:12:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:12:20,147 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 6 states. [2020-09-04 16:12:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:20,288 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2020-09-04 16:12:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:12:20,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2020-09-04 16:12:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:20,290 INFO L225 Difference]: With dead ends: 76 [2020-09-04 16:12:20,290 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:12:20,292 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 16:12:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:12:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:12:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:12:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-09-04 16:12:20,303 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 56 [2020-09-04 16:12:20,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:20,304 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-09-04 16:12:20,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:12:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-09-04 16:12:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:12:20,307 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:20,307 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 16:12:20,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:12:20,307 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:20,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:20,308 INFO L82 PathProgramCache]: Analyzing trace with hash 847598467, now seen corresponding path program 2 times [2020-09-04 16:12:20,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:20,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [964482927] [2020-09-04 16:12:20,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:20,311 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:12:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 16:12:20,466 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [964482927] [2020-09-04 16:12:20,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:20,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:12:20,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840790703] [2020-09-04 16:12:20,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:12:20,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:20,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:12:20,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:12:20,470 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 7 states. [2020-09-04 16:12:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:20,572 INFO L93 Difference]: Finished difference Result 77 states and 91 transitions. [2020-09-04 16:12:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:12:20,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-09-04 16:12:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:20,574 INFO L225 Difference]: With dead ends: 77 [2020-09-04 16:12:20,574 INFO L226 Difference]: Without dead ends: 43 [2020-09-04 16:12:20,576 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 16:12:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-09-04 16:12:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-09-04 16:12:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-09-04 16:12:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2020-09-04 16:12:20,591 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 54 [2020-09-04 16:12:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:20,592 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2020-09-04 16:12:20,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:12:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2020-09-04 16:12:20,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-09-04 16:12:20,601 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:20,601 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 16:12:20,601 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:12:20,601 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:20,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1275966376, now seen corresponding path program 3 times [2020-09-04 16:12:20,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:20,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91559719] [2020-09-04 16:12:20,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:20,605 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:12:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-09-04 16:12:20,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [91559719] [2020-09-04 16:12:20,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:20,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:12:20,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792048185] [2020-09-04 16:12:20,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:12:20,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:20,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:12:20,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:12:20,853 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 13 states. [2020-09-04 16:12:21,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:21,201 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-09-04 16:12:21,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:12:21,201 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 55 [2020-09-04 16:12:21,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:21,203 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:12:21,203 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 16:12:21,205 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-09-04 16:12:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 16:12:21,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-09-04 16:12:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:12:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2020-09-04 16:12:21,215 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 55 [2020-09-04 16:12:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:21,215 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2020-09-04 16:12:21,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:12:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2020-09-04 16:12:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:12:21,217 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:21,217 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 16:12:21,217 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:12:21,218 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:21,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:21,218 INFO L82 PathProgramCache]: Analyzing trace with hash -778718797, now seen corresponding path program 4 times [2020-09-04 16:12:21,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:21,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [169797889] [2020-09-04 16:12:21,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:21,220 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:12:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:21,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:12:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 16 proven. 43 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2020-09-04 16:12:21,413 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [169797889] [2020-09-04 16:12:21,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:21,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:12:21,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893246439] [2020-09-04 16:12:21,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:12:21,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:21,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:12:21,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:12:21,416 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 8 states. [2020-09-04 16:12:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:21,620 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-09-04 16:12:21,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:12:21,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-09-04 16:12:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:21,623 INFO L225 Difference]: With dead ends: 98 [2020-09-04 16:12:21,623 INFO L226 Difference]: Without dead ends: 62 [2020-09-04 16:12:21,624 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 16:12:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-09-04 16:12:21,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2020-09-04 16:12:21,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-09-04 16:12:21,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2020-09-04 16:12:21,640 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 90 [2020-09-04 16:12:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:21,640 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2020-09-04 16:12:21,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:12:21,641 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2020-09-04 16:12:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 16:12:21,642 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:21,643 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 16:12:21,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:12:21,643 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:21,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:21,643 INFO L82 PathProgramCache]: Analyzing trace with hash 237402259, now seen corresponding path program 5 times [2020-09-04 16:12:21,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:21,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770336954] [2020-09-04 16:12:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:21,646 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:12:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:12:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:12:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:12:21,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 23 proven. 69 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2020-09-04 16:12:21,948 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770336954] [2020-09-04 16:12:21,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:21,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:12:21,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291941696] [2020-09-04 16:12:21,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:12:21,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:12:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:12:21,951 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 10 states. [2020-09-04 16:12:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:22,222 INFO L93 Difference]: Finished difference Result 126 states and 169 transitions. [2020-09-04 16:12:22,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:12:22,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 126 [2020-09-04 16:12:22,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:22,230 INFO L225 Difference]: With dead ends: 126 [2020-09-04 16:12:22,230 INFO L226 Difference]: Without dead ends: 79 [2020-09-04 16:12:22,231 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 16:12:22,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-09-04 16:12:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2020-09-04 16:12:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:12:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2020-09-04 16:12:22,264 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 126 [2020-09-04 16:12:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:22,265 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2020-09-04 16:12:22,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:12:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2020-09-04 16:12:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:12:22,266 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:12:22,266 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 16:12:22,267 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:12:22,267 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:12:22,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:12:22,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1698410615, now seen corresponding path program 6 times [2020-09-04 16:12:22,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:12:22,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [656012230] [2020-09-04 16:12:22,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:12:22,271 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:12:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:12:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-09-04 16:12:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:12:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:12:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:12:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:12:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:12:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-09-04 16:12:22,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [656012230] [2020-09-04 16:12:22,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:12:22,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:12:22,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061024578] [2020-09-04 16:12:22,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:12:22,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:12:22,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:12:22,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:12:22,561 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand 15 states. [2020-09-04 16:12:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:12:22,935 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2020-09-04 16:12:22,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:12:22,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 90 [2020-09-04 16:12:22,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:12:22,936 INFO L225 Difference]: With dead ends: 70 [2020-09-04 16:12:22,936 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:12:22,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:12:22,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:12:22,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:12:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:12:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:12:22,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90 [2020-09-04 16:12:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:12:22,939 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:12:22,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:12:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:12:22,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:12:22,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:12:22,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:12:24,695 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-09-04 16:12:25,208 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2020-09-04 16:12:25,575 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2020-09-04 16:12:25,625 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 16:12:25,626 INFO L271 CegarLoopResult]: At program point fibonacciENTRY(lines 14 22) the Hoare annotation is: true [2020-09-04 16:12:25,626 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 16:12:25,626 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 16:12:25,627 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 16:12:25,627 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 16:12:25,627 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 16:12:25,627 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 16:12:25,628 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 16:12:25,628 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 16:12:25,628 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 16:12:25,628 INFO L264 CegarLoopResult]: At program point L15(lines 15 21) the Hoare annotation is: (= fibonacci_~n |fibonacci_#in~n|) [2020-09-04 16:12:25,628 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-09-04 16:12:25,628 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-09-04 16:12:25,629 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:12:25,629 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:12:25,629 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:12:25,629 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:12:25,629 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:12:25,629 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:12:25,629 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-09-04 16:12:25,629 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 34) the Hoare annotation is: false [2020-09-04 16:12:25,630 INFO L264 CegarLoopResult]: At program point L31(lines 31 35) the Hoare annotation is: (<= main_~x~0 (+ main_~result~0 1)) [2020-09-04 16:12:25,630 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-09-04 16:12:25,630 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 36) the Hoare annotation is: true [2020-09-04 16:12:25,630 INFO L264 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-09-04 16:12:25,630 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-09-04 16:12:25,630 INFO L264 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (<= main_~x~0 (+ |main_#t~ret3| 1)) [2020-09-04 16:12:25,630 INFO L271 CegarLoopResult]: At program point L27(lines 27 29) the Hoare annotation is: true [2020-09-04 16:12:25,630 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 16:12:25,630 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-09-04 16:12:25,631 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-09-04 16:12:25,631 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 36) the Hoare annotation is: true [2020-09-04 16:12:25,631 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 36) the Hoare annotation is: true [2020-09-04 16:12:25,631 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-09-04 16:12:25,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:12:25 BoogieIcfgContainer [2020-09-04 16:12:25,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:12:25,652 INFO L168 Benchmark]: Toolchain (without parser) took 8307.55 ms. Allocated memory was 140.5 MB in the beginning and 301.5 MB in the end (delta: 161.0 MB). Free memory was 105.1 MB in the beginning and 263.3 MB in the end (delta: -158.2 MB). Peak memory consumption was 165.0 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:25,653 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:12:25,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.19 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 95.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:25,654 INFO L168 Benchmark]: Boogie Preprocessor took 27.29 ms. Allocated memory is still 140.5 MB. Free memory was 95.3 MB in the beginning and 93.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:25,655 INFO L168 Benchmark]: RCFGBuilder took 400.90 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 93.9 MB in the beginning and 170.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:25,656 INFO L168 Benchmark]: TraceAbstraction took 7572.30 ms. Allocated memory was 203.9 MB in the beginning and 301.5 MB in the end (delta: 97.5 MB). Free memory was 170.1 MB in the beginning and 263.3 MB in the end (delta: -93.2 MB). Peak memory consumption was 166.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:12:25,660 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.19 ms. Allocated memory is still 140.5 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 301.19 ms. Allocated memory is still 140.5 MB. Free memory was 104.9 MB in the beginning and 95.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.29 ms. Allocated memory is still 140.5 MB. Free memory was 95.3 MB in the beginning and 93.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 400.90 ms. Allocated memory was 140.5 MB in the beginning and 203.9 MB in the end (delta: 63.4 MB). Free memory was 93.9 MB in the beginning and 170.8 MB in the end (delta: -76.8 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7572.30 ms. Allocated memory was 203.9 MB in the beginning and 301.5 MB in the end (delta: 97.5 MB). Free memory was 170.1 MB in the beginning and 263.3 MB in the end (delta: -93.2 MB). Peak memory consumption was 166.6 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.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 265 SDtfs, 344 SDslu, 999 SDs, 0 SdLazy, 962 SolverSat, 133 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 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, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 35 LocationsWithAnnotation, 371 PreInvPairs, 650 NumberOfFragments, 340 HoareAnnotationTreeSize, 371 FomulaSimplifications, 12697 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 35 FomulaSimplificationsInter, 3456 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...