/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-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 13:03:52,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 13:03:52,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 13:03:53,010 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 13:03:53,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 13:03:53,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 13:03:53,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 13:03:53,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 13:03:53,016 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 13:03:53,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 13:03:53,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 13:03:53,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 13:03:53,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 13:03:53,021 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 13:03:53,022 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 13:03:53,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 13:03:53,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 13:03:53,024 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 13:03:53,026 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 13:03:53,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 13:03:53,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 13:03:53,031 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 13:03:53,032 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 13:03:53,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 13:03:53,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 13:03:53,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 13:03:53,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 13:03:53,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 13:03:53,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 13:03:53,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 13:03:53,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 13:03:53,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 13:03:53,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 13:03:53,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 13:03:53,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 13:03:53,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 13:03:53,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 13:03:53,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 13:03:53,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 13:03:53,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 13:03:53,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 13:03:53,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-07 13:03:53,057 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 13:03:53,057 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 13:03:53,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 13:03:53,059 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 13:03:53,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 13:03:53,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 13:03:53,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 13:03:53,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 13:03:53,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 13:03:53,060 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 13:03:53,060 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 13:03:53,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 13:03:53,060 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 13:03:53,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 13:03:53,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 13:03:53,061 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-07 13:03:53,061 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 13:03:53,061 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 13:03:53,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 13:03:53,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 13:03:53,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-07 13:03:53,062 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 13:03:53,062 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-07 13:03:53,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 13:03:53,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 13:03:53,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 13:03:53,359 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 13:03:53,360 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 13:03:53,360 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-07 13:03:53,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4084555c4/06e862f9f65c401da308132c7cb5f0f8/FLAG3e6c699f5 [2020-07-07 13:03:53,851 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 13:03:53,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-07-07 13:03:53,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4084555c4/06e862f9f65c401da308132c7cb5f0f8/FLAG3e6c699f5 [2020-07-07 13:03:54,252 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4084555c4/06e862f9f65c401da308132c7cb5f0f8 [2020-07-07 13:03:54,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 13:03:54,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 13:03:54,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:54,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 13:03:54,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 13:03:54,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c7ec94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54, skipping insertion in model container [2020-07-07 13:03:54,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 13:03:54,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 13:03:54,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:54,454 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 13:03:54,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 13:03:54,484 INFO L208 MainTranslator]: Completed translation [2020-07-07 13:03:54,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54 WrapperNode [2020-07-07 13:03:54,484 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 13:03:54,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 13:03:54,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 13:03:54,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 13:03:54,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,507 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (1/1) ... [2020-07-07 13:03:54,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 13:03:54,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 13:03:54,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 13:03:54,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 13:03:54,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (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-07-07 13:03:54,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 13:03:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 13:03:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-07 13:03:54,637 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 13:03:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 13:03:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 13:03:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-07 13:03:54,637 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 13:03:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 13:03:54,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 13:03:54,804 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 13:03:54,804 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-07 13:03:54,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:54 BoogieIcfgContainer [2020-07-07 13:03:54,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 13:03:54,810 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 13:03:54,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 13:03:54,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 13:03:54,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 01:03:54" (1/3) ... [2020-07-07 13:03:54,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df87f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:54, skipping insertion in model container [2020-07-07 13:03:54,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 01:03:54" (2/3) ... [2020-07-07 13:03:54,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7df87f54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 01:03:54, skipping insertion in model container [2020-07-07 13:03:54,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 01:03:54" (3/3) ... [2020-07-07 13:03:54,816 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-07-07 13:03:54,826 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-07 13:03:54,834 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 13:03:54,849 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 13:03:54,872 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 13:03:54,873 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 13:03:54,873 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-07 13:03:54,873 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 13:03:54,873 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 13:03:54,874 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 13:03:54,874 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 13:03:54,874 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 13:03:54,893 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-07 13:03:54,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-07 13:03:54,907 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:54,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:54,909 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:54,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:54,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-07-07 13:03:54,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:54,928 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1865752897] [2020-07-07 13:03:54,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:03:55,178 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:55,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1865752897] [2020-07-07 13:03:55,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:55,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:55,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027520621] [2020-07-07 13:03:55,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:55,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:55,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:55,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:55,201 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-07-07 13:03:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:55,294 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-07 13:03:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:55,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-07 13:03:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:55,306 INFO L225 Difference]: With dead ends: 44 [2020-07-07 13:03:55,306 INFO L226 Difference]: Without dead ends: 28 [2020-07-07 13:03:55,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:03:55,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-07 13:03:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-07 13:03:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:03:55,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:03:55,357 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-07 13:03:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:55,358 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:03:55,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:03:55,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-07 13:03:55,360 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:55,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:55,361 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 13:03:55,361 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:55,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:55,362 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-07-07 13:03:55,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:55,363 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1309814827] [2020-07-07 13:03:55,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 13:03:55,438 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:55,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1309814827] [2020-07-07 13:03:55,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:55,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 13:03:55,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492212321] [2020-07-07 13:03:55,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 13:03:55,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:55,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 13:03:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 13:03:55,442 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-07 13:03:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:55,501 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-07 13:03:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 13:03:55,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-07 13:03:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:55,503 INFO L225 Difference]: With dead ends: 36 [2020-07-07 13:03:55,504 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:03:55,505 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 13:03:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:03:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-07 13:03:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-07 13:03:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-07 13:03:55,518 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-07-07 13:03:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:55,519 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-07 13:03:55,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 13:03:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-07 13:03:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 13:03:55,521 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:55,521 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] [2020-07-07 13:03:55,521 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 13:03:55,522 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:55,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:55,522 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-07-07 13:03:55,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:55,523 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [171072196] [2020-07-07 13:03:55,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-07 13:03:55,680 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:55,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [171072196] [2020-07-07 13:03:55,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:55,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:03:55,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788132435] [2020-07-07 13:03:55,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:03:55,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:03:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:03:55,682 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-07-07 13:03:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:55,791 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-07 13:03:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:55,792 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-07 13:03:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:55,794 INFO L225 Difference]: With dead ends: 52 [2020-07-07 13:03:55,794 INFO L226 Difference]: Without dead ends: 30 [2020-07-07 13:03:55,795 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:03:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-07 13:03:55,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-07 13:03:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-07 13:03:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-07 13:03:55,807 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-07-07 13:03:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:55,808 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-07 13:03:55,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:03:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-07 13:03:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-07 13:03:55,810 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:55,811 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] [2020-07-07 13:03:55,811 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 13:03:55,811 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:55,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:55,812 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-07-07 13:03:55,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:55,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [528226875] [2020-07-07 13:03:55,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-07 13:03:55,940 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:55,940 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [528226875] [2020-07-07 13:03:55,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:55,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 13:03:55,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100529943] [2020-07-07 13:03:55,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 13:03:55,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 13:03:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 13:03:55,943 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2020-07-07 13:03:56,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:56,065 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-07 13:03:56,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 13:03:56,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-07-07 13:03:56,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:56,068 INFO L225 Difference]: With dead ends: 56 [2020-07-07 13:03:56,068 INFO L226 Difference]: Without dead ends: 50 [2020-07-07 13:03:56,069 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 13:03:56,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-07 13:03:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-07 13:03:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-07 13:03:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-07-07 13:03:56,089 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-07-07 13:03:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:56,092 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-07-07 13:03:56,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 13:03:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-07 13:03:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-07 13:03:56,095 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:56,095 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] [2020-07-07 13:03:56,095 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 13:03:56,096 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-07-07 13:03:56,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:56,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [784496717] [2020-07-07 13:03:56,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-07 13:03:56,255 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:56,256 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [784496717] [2020-07-07 13:03:56,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:56,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:03:56,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770845503] [2020-07-07 13:03:56,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:03:56,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:56,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:03:56,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:03:56,258 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 9 states. [2020-07-07 13:03:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:56,381 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-07-07 13:03:56,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 13:03:56,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2020-07-07 13:03:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:56,384 INFO L225 Difference]: With dead ends: 111 [2020-07-07 13:03:56,384 INFO L226 Difference]: Without dead ends: 67 [2020-07-07 13:03:56,386 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-07 13:03:56,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-07 13:03:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-07 13:03:56,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 13:03:56,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-07 13:03:56,400 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-07-07 13:03:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:56,401 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-07 13:03:56,401 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:03:56,401 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-07 13:03:56,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-07 13:03:56,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:56,404 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] [2020-07-07 13:03:56,404 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 13:03:56,404 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-07-07 13:03:56,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:56,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770853488] [2020-07-07 13:03:56,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-07 13:03:56,544 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:56,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770853488] [2020-07-07 13:03:56,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:56,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 13:03:56,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824389475] [2020-07-07 13:03:56,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 13:03:56,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 13:03:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 13:03:56,549 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 9 states. [2020-07-07 13:03:56,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:56,676 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-07 13:03:56,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-07 13:03:56,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-07-07 13:03:56,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:56,679 INFO L225 Difference]: With dead ends: 89 [2020-07-07 13:03:56,679 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 13:03:56,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-07 13:03:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 13:03:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-07 13:03:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-07 13:03:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-07 13:03:56,700 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-07-07 13:03:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:56,701 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-07 13:03:56,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 13:03:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-07 13:03:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-07 13:03:56,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:56,710 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] [2020-07-07 13:03:56,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 13:03:56,710 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:56,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:56,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-07-07 13:03:56,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:56,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [91843734] [2020-07-07 13:03:56,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 13:03:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 17 proven. 70 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-07-07 13:03:57,120 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:57,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [91843734] [2020-07-07 13:03:57,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:57,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:03:57,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806088961] [2020-07-07 13:03:57,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:03:57,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:57,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:03:57,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:03:57,123 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 15 states. [2020-07-07 13:03:57,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:57,408 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-07-07 13:03:57,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:03:57,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 123 [2020-07-07 13:03:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:57,412 INFO L225 Difference]: With dead ends: 142 [2020-07-07 13:03:57,412 INFO L226 Difference]: Without dead ends: 73 [2020-07-07 13:03:57,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:03:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-07 13:03:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-07 13:03:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-07 13:03:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 86 transitions. [2020-07-07 13:03:57,428 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 86 transitions. Word has length 123 [2020-07-07 13:03:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:57,429 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 86 transitions. [2020-07-07 13:03:57,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:03:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 86 transitions. [2020-07-07 13:03:57,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-07 13:03:57,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:57,431 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:57,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 13:03:57,431 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:57,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:57,432 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-07-07 13:03:57,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:57,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [800214228] [2020-07-07 13:03:57,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,155 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 47 proven. 92 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2020-07-07 13:03:58,156 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:58,156 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [800214228] [2020-07-07 13:03:58,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:58,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-07 13:03:58,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213195953] [2020-07-07 13:03:58,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-07 13:03:58,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:58,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-07 13:03:58,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:03:58,160 INFO L87 Difference]: Start difference. First operand 70 states and 86 transitions. Second operand 18 states. [2020-07-07 13:03:58,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:58,563 INFO L93 Difference]: Finished difference Result 149 states and 214 transitions. [2020-07-07 13:03:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 13:03:58,563 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 193 [2020-07-07 13:03:58,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:58,566 INFO L225 Difference]: With dead ends: 149 [2020-07-07 13:03:58,566 INFO L226 Difference]: Without dead ends: 92 [2020-07-07 13:03:58,567 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=622, Unknown=0, NotChecked=0, Total=812 [2020-07-07 13:03:58,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-07 13:03:58,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-07-07 13:03:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-07 13:03:58,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 104 transitions. [2020-07-07 13:03:58,581 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 104 transitions. Word has length 193 [2020-07-07 13:03:58,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:58,585 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 104 transitions. [2020-07-07 13:03:58,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-07 13:03:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 104 transitions. [2020-07-07 13:03:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2020-07-07 13:03:58,592 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:58,592 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:58,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 13:03:58,592 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:58,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1227428144, now seen corresponding path program 6 times [2020-07-07 13:03:58,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:58,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1696888793] [2020-07-07 13:03:58,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2020-07-07 13:03:59,153 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:03:59,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1696888793] [2020-07-07 13:03:59,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:03:59,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-07 13:03:59,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447158876] [2020-07-07 13:03:59,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-07 13:03:59,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:03:59,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-07 13:03:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2020-07-07 13:03:59,161 INFO L87 Difference]: Start difference. First operand 85 states and 104 transitions. Second operand 15 states. [2020-07-07 13:03:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:03:59,394 INFO L93 Difference]: Finished difference Result 248 states and 331 transitions. [2020-07-07 13:03:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-07 13:03:59,395 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 228 [2020-07-07 13:03:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:03:59,401 INFO L225 Difference]: With dead ends: 248 [2020-07-07 13:03:59,401 INFO L226 Difference]: Without dead ends: 242 [2020-07-07 13:03:59,402 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-07 13:03:59,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-07-07 13:03:59,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 218. [2020-07-07 13:03:59,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-07 13:03:59,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 295 transitions. [2020-07-07 13:03:59,452 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 295 transitions. Word has length 228 [2020-07-07 13:03:59,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:03:59,453 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 295 transitions. [2020-07-07 13:03:59,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-07 13:03:59,454 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 295 transitions. [2020-07-07 13:03:59,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-07-07 13:03:59,462 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:03:59,463 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:03:59,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 13:03:59,463 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:03:59,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:03:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-07-07 13:03:59,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:03:59,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744213086] [2020-07-07 13:03:59,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:03:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:03:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2020-07-07 13:04:00,261 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:04:00,261 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744213086] [2020-07-07 13:04:00,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:04:00,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-07 13:04:00,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673549481] [2020-07-07 13:04:00,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 13:04:00,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:04:00,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 13:04:00,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2020-07-07 13:04:00,266 INFO L87 Difference]: Start difference. First operand 218 states and 295 transitions. Second operand 17 states. [2020-07-07 13:04:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:04:00,613 INFO L93 Difference]: Finished difference Result 559 states and 806 transitions. [2020-07-07 13:04:00,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-07 13:04:00,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 369 [2020-07-07 13:04:00,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:04:00,625 INFO L225 Difference]: With dead ends: 559 [2020-07-07 13:04:00,625 INFO L226 Difference]: Without dead ends: 553 [2020-07-07 13:04:00,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-07-07 13:04:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2020-07-07 13:04:00,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 523. [2020-07-07 13:04:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2020-07-07 13:04:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 763 transitions. [2020-07-07 13:04:00,724 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 763 transitions. Word has length 369 [2020-07-07 13:04:00,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:04:00,724 INFO L479 AbstractCegarLoop]: Abstraction has 523 states and 763 transitions. [2020-07-07 13:04:00,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 13:04:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 763 transitions. [2020-07-07 13:04:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2020-07-07 13:04:00,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:04:00,740 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:04:00,740 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 13:04:00,741 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:04:00,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:04:00,741 INFO L82 PathProgramCache]: Analyzing trace with hash -554586347, now seen corresponding path program 8 times [2020-07-07 13:04:00,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:04:00,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2033848894] [2020-07-07 13:04:00,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:04:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2657 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 2297 trivial. 0 not checked. [2020-07-07 13:04:02,787 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:04:02,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2033848894] [2020-07-07 13:04:02,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:04:02,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-07-07 13:04:02,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941157078] [2020-07-07 13:04:02,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 13:04:02,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:04:02,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 13:04:02,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2020-07-07 13:04:02,790 INFO L87 Difference]: Start difference. First operand 523 states and 763 transitions. Second operand 19 states. [2020-07-07 13:04:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:04:03,212 INFO L93 Difference]: Finished difference Result 1224 states and 1887 transitions. [2020-07-07 13:04:03,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-07 13:04:03,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 598 [2020-07-07 13:04:03,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:04:03,228 INFO L225 Difference]: With dead ends: 1224 [2020-07-07 13:04:03,228 INFO L226 Difference]: Without dead ends: 1218 [2020-07-07 13:04:03,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-07-07 13:04:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-07-07 13:04:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1182. [2020-07-07 13:04:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1182 states. [2020-07-07 13:04:03,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1837 transitions. [2020-07-07 13:04:03,346 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1837 transitions. Word has length 598 [2020-07-07 13:04:03,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:04:03,347 INFO L479 AbstractCegarLoop]: Abstraction has 1182 states and 1837 transitions. [2020-07-07 13:04:03,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 13:04:03,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1837 transitions. [2020-07-07 13:04:03,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2020-07-07 13:04:03,381 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:04:03,381 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 34, 34, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:04:03,381 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 13:04:03,382 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:04:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:04:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash -668436832, now seen corresponding path program 9 times [2020-07-07 13:04:03,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:04:03,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [961782387] [2020-07-07 13:04:03,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.001s / 0.001s total Resizing node table from 113 to 223 [2020-07-07 13:04:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6959 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 6364 trivial. 0 not checked. [2020-07-07 13:04:07,752 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:04:07,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [961782387] [2020-07-07 13:04:07,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:04:07,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-07-07 13:04:07,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636521262] [2020-07-07 13:04:07,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-07 13:04:07,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:04:07,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-07 13:04:07,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2020-07-07 13:04:07,755 INFO L87 Difference]: Start difference. First operand 1182 states and 1837 transitions. Second operand 21 states. [2020-07-07 13:04:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:04:08,353 INFO L93 Difference]: Finished difference Result 2607 states and 4268 transitions. [2020-07-07 13:04:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-07 13:04:08,353 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 968 [2020-07-07 13:04:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:04:08,401 INFO L225 Difference]: With dead ends: 2607 [2020-07-07 13:04:08,401 INFO L226 Difference]: Without dead ends: 2601 [2020-07-07 13:04:08,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-07-07 13:04:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2601 states. [2020-07-07 13:04:08,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2601 to 2559. [2020-07-07 13:04:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2559 states. [2020-07-07 13:04:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4211 transitions. [2020-07-07 13:04:08,776 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4211 transitions. Word has length 968 [2020-07-07 13:04:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:04:08,777 INFO L479 AbstractCegarLoop]: Abstraction has 2559 states and 4211 transitions. [2020-07-07 13:04:08,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-07 13:04:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4211 transitions. [2020-07-07 13:04:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1938 [2020-07-07 13:04:08,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:04:08,979 INFO L422 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 109, 109, 109, 68, 68, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:04:08,979 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 13:04:08,979 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:04:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:04:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash -108146952, now seen corresponding path program 10 times [2020-07-07 13:04:08,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:04:08,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1840028262] [2020-07-07 13:04:08,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:04:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:12,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 13:04:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 27981 backedges. 309 proven. 1397 refuted. 0 times theorem prover too weak. 26275 trivial. 0 not checked. [2020-07-07 13:04:19,680 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:04:19,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1840028262] [2020-07-07 13:04:19,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 13:04:19,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2020-07-07 13:04:19,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489481672] [2020-07-07 13:04:19,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-07-07 13:04:19,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-07 13:04:19,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-07-07 13:04:19,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1000, Unknown=0, NotChecked=0, Total=1260 [2020-07-07 13:04:19,684 INFO L87 Difference]: Start difference. First operand 2559 states and 4211 transitions. Second operand 36 states. [2020-07-07 13:04:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 13:04:21,127 INFO L93 Difference]: Finished difference Result 2813 states and 4872 transitions. [2020-07-07 13:04:21,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2020-07-07 13:04:21,129 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1937 [2020-07-07 13:04:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 13:04:21,138 INFO L225 Difference]: With dead ends: 2813 [2020-07-07 13:04:21,138 INFO L226 Difference]: Without dead ends: 264 [2020-07-07 13:04:21,168 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=799, Invalid=3491, Unknown=0, NotChecked=0, Total=4290 [2020-07-07 13:04:21,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-07-07 13:04:21,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 175. [2020-07-07 13:04:21,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2020-07-07 13:04:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 241 transitions. [2020-07-07 13:04:21,189 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 241 transitions. Word has length 1937 [2020-07-07 13:04:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 13:04:21,191 INFO L479 AbstractCegarLoop]: Abstraction has 175 states and 241 transitions. [2020-07-07 13:04:21,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-07-07 13:04:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 241 transitions. [2020-07-07 13:04:21,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1568 [2020-07-07 13:04:21,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 13:04:21,212 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 88, 88, 88, 55, 55, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 13:04:21,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 13:04:21,213 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 13:04:21,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 13:04:21,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1218167635, now seen corresponding path program 11 times [2020-07-07 13:04:21,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-07 13:04:21,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153069486] [2020-07-07 13:04:21,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Garbage collection #1: 17 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 17 to 31 Garbage collection #2: 31 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 31 to 61 Garbage collection #3: 61 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 61 to 113 Garbage collection #4: 113 nodes / 0 free / 0.0s / 0.0s total Resizing node table from 113 to 223 [2020-07-07 13:04:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:04:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 13:04:22,396 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-07 13:04:22,397 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-07 13:04:22,397 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 13:04:22,399 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 13:04:22,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 01:04:22 BoogieIcfgContainer [2020-07-07 13:04:22,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 13:04:22,473 INFO L168 Benchmark]: Toolchain (without parser) took 28209.31 ms. Allocated memory was 135.8 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 99.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2020-07-07 13:04:22,474 INFO L168 Benchmark]: CDTParser took 0.82 ms. Allocated memory is still 135.8 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-07 13:04:22,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.51 ms. Allocated memory is still 135.8 MB. Free memory was 99.2 MB in the beginning and 89.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:22,475 INFO L168 Benchmark]: Boogie Preprocessor took 26.46 ms. Allocated memory is still 135.8 MB. Free memory was 89.8 MB in the beginning and 88.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:22,476 INFO L168 Benchmark]: RCFGBuilder took 296.61 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 88.4 MB in the beginning and 166.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-07 13:04:22,476 INFO L168 Benchmark]: TraceAbstraction took 27661.57 ms. Allocated memory was 199.2 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 166.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2020-07-07 13:04:22,479 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.82 ms. Allocated memory is still 135.8 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 219.51 ms. Allocated memory is still 135.8 MB. Free memory was 99.2 MB in the beginning and 89.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.46 ms. Allocated memory is still 135.8 MB. Free memory was 89.8 MB in the beginning and 88.4 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 296.61 ms. Allocated memory was 135.8 MB in the beginning and 199.2 MB in the end (delta: 63.4 MB). Free memory was 88.4 MB in the beginning and 166.6 MB in the end (delta: -78.2 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27661.57 ms. Allocated memory was 199.2 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 166.6 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 55 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 27.5s, OverallIterations: 14, TraceHistogramMax: 219, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 421 SDtfs, 1494 SDslu, 1712 SDs, 0 SdLazy, 2387 SolverSat, 1471 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1295 GetRequests, 1078 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2559occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 251 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 incorrect! Received shutdown request...