/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:05:40,069 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:05:40,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:05:40,084 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:05:40,085 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:05:40,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:05:40,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:05:40,089 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:05:40,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:05:40,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:05:40,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:05:40,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:05:40,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:05:40,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:05:40,095 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:05:40,096 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:05:40,097 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:05:40,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:05:40,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:05:40,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:05:40,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:05:40,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:05:40,105 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:05:40,105 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:05:40,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:05:40,108 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:05:40,108 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:05:40,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:05:40,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:05:40,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:05:40,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:05:40,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:05:40,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:05:40,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:05:40,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:05:40,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:05:40,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:05:40,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:05:40,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:05:40,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:05:40,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:05:40,116 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:05:40,125 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:05:40,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:05:40,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:05:40,126 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:05:40,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:05:40,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:05:40,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:05:40,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:05:40,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:05:40,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:05:40,128 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:05:40,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:05:40,128 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:05:40,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:05:40,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:05:40,129 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:05:40,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:05:40,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:05:40,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:05:40,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:05:40,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:05:40,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:05:40,130 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:05:40,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:05:40,489 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:05:40,492 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:05:40,494 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:05:40,494 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:05:40,495 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-17 17:05:40,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035a09384/33083d1fc3c34d8283faac9f844b90f4/FLAG3b3421538 [2020-07-17 17:05:40,987 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:05:40,988 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-07-17 17:05:40,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035a09384/33083d1fc3c34d8283faac9f844b90f4/FLAG3b3421538 [2020-07-17 17:05:41,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035a09384/33083d1fc3c34d8283faac9f844b90f4 [2020-07-17 17:05:41,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:05:41,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:05:41,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:05:41,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:05:41,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:05:41,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b30ae95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41, skipping insertion in model container [2020-07-17 17:05:41,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,382 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:05:41,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:05:41,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:05:41,602 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:05:41,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:05:41,639 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:05:41,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41 WrapperNode [2020-07-17 17:05:41,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:05:41,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:05:41,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:05:41,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:05:41,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,656 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (1/1) ... [2020-07-17 17:05:41,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:05:41,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:05:41,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:05:41,677 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:05:41,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (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-17 17:05:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:05:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:05:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-07-17 17:05:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:05:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:05:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:05:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-07-17 17:05:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:05:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:05:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:05:42,026 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:05:42,027 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:05:42,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:05:42 BoogieIcfgContainer [2020-07-17 17:05:42,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:05:42,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:05:42,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:05:42,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:05:42,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:05:41" (1/3) ... [2020-07-17 17:05:42,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fd907e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:05:42, skipping insertion in model container [2020-07-17 17:05:42,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:05:41" (2/3) ... [2020-07-17 17:05:42,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fd907e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:05:42, skipping insertion in model container [2020-07-17 17:05:42,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:05:42" (3/3) ... [2020-07-17 17:05:42,040 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-07-17 17:05:42,051 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:05:42,059 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:05:42,077 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:05:42,119 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:05:42,120 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:05:42,120 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:05:42,120 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:05:42,120 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:05:42,120 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:05:42,121 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:05:42,121 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:05:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-17 17:05:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 17:05:42,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:42,153 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:42,154 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:42,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-07-17 17:05:42,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:42,173 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1238369853] [2020-07-17 17:05:42,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,392 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-17 17:05:42,393 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1238369853] [2020-07-17 17:05:42,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:05:42,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:05:42,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526040526] [2020-07-17 17:05:42,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:05:42,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:05:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:05:42,412 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-07-17 17:05:42,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:42,548 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-07-17 17:05:42,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:05:42,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 17:05:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:42,562 INFO L225 Difference]: With dead ends: 48 [2020-07-17 17:05:42,562 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:05:42,567 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-17 17:05:42,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:05:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 17:05:42,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:05:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-17 17:05:42,613 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-07-17 17:05:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:42,614 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-17 17:05:42,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:05:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-17 17:05:42,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 17:05:42,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:42,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:42,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:05:42,618 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:42,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-07-17 17:05:42,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:42,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1015592068] [2020-07-17 17:05:42,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,687 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-17 17:05:42,687 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1015592068] [2020-07-17 17:05:42,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:05:42,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:05:42,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994293758] [2020-07-17 17:05:42,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:05:42,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:05:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:05:42,692 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-07-17 17:05:42,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:42,769 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-17 17:05:42,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:05:42,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 17:05:42,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:42,771 INFO L225 Difference]: With dead ends: 38 [2020-07-17 17:05:42,771 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 17:05:42,773 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-17 17:05:42,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 17:05:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-07-17 17:05:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:05:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-17 17:05:42,784 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-07-17 17:05:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:42,785 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-17 17:05:42,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:05:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-17 17:05:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 17:05:42,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:42,787 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:42,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:05:42,788 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:42,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:42,788 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-07-17 17:05:42,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:42,789 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157788720] [2020-07-17 17:05:42,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 17:05:42,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157788720] [2020-07-17 17:05:42,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:42,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:05:42,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100180111] [2020-07-17 17:05:42,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:05:42,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:05:42,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:05:42,900 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-17 17:05:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:42,987 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-07-17 17:05:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 17:05:42,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-17 17:05:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:42,990 INFO L225 Difference]: With dead ends: 54 [2020-07-17 17:05:42,990 INFO L226 Difference]: Without dead ends: 32 [2020-07-17 17:05:42,991 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:05:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-17 17:05:43,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-17 17:05:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 17:05:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-07-17 17:05:43,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-07-17 17:05:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:43,004 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-07-17 17:05:43,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:05:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-07-17 17:05:43,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 17:05:43,009 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:43,010 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:43,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:05:43,010 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:43,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:43,011 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-07-17 17:05:43,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:43,011 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615650295] [2020-07-17 17:05:43,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 17:05:43,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1615650295] [2020-07-17 17:05:43,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:43,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:05:43,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130982827] [2020-07-17 17:05:43,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:05:43,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:43,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:05:43,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:05:43,192 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-07-17 17:05:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:43,327 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-07-17 17:05:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:05:43,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-07-17 17:05:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:43,330 INFO L225 Difference]: With dead ends: 58 [2020-07-17 17:05:43,331 INFO L226 Difference]: Without dead ends: 52 [2020-07-17 17:05:43,331 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:05:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-17 17:05:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-07-17 17:05:43,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-17 17:05:43,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-07-17 17:05:43,349 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-07-17 17:05:43,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:43,349 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-07-17 17:05:43,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:05:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-07-17 17:05:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-17 17:05:43,352 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:43,352 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:43,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:05:43,353 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-07-17 17:05:43,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:43,354 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [690069251] [2020-07-17 17:05:43,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 17:05:43,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [690069251] [2020-07-17 17:05:43,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:43,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:05:43,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840905983] [2020-07-17 17:05:43,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:05:43,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:43,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:05:43,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:05:43,498 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-07-17 17:05:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:43,628 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-07-17 17:05:43,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:05:43,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-07-17 17:05:43,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:43,631 INFO L225 Difference]: With dead ends: 110 [2020-07-17 17:05:43,631 INFO L226 Difference]: Without dead ends: 66 [2020-07-17 17:05:43,633 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:05:43,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-17 17:05:43,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-07-17 17:05:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-07-17 17:05:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-07-17 17:05:43,649 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-07-17 17:05:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:43,650 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-07-17 17:05:43,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:05:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-07-17 17:05:43,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-17 17:05:43,653 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:43,653 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:43,653 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:05:43,653 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:43,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-07-17 17:05:43,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:43,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1898038257] [2020-07-17 17:05:43,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-17 17:05:43,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1898038257] [2020-07-17 17:05:43,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:43,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:05:43,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269676915] [2020-07-17 17:05:43,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:05:43,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:43,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:05:43,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:05:43,789 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-07-17 17:05:43,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:43,917 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-07-17 17:05:43,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:05:43,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-07-17 17:05:43,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:43,920 INFO L225 Difference]: With dead ends: 88 [2020-07-17 17:05:43,920 INFO L226 Difference]: Without dead ends: 82 [2020-07-17 17:05:43,921 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:05:43,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-07-17 17:05:43,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-07-17 17:05:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-17 17:05:43,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-07-17 17:05:43,940 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-07-17 17:05:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:43,941 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-07-17 17:05:43,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:05:43,941 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-07-17 17:05:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-07-17 17:05:43,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:43,945 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:43,945 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:05:43,945 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:43,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:43,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-07-17 17:05:43,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:43,946 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167377363] [2020-07-17 17:05:43,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-07-17 17:05:44,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167377363] [2020-07-17 17:05:44,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:44,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:05:44,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846892553] [2020-07-17 17:05:44,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:05:44,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:44,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:05:44,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:05:44,256 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-07-17 17:05:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:44,525 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-07-17 17:05:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:05:44,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-07-17 17:05:44,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:44,528 INFO L225 Difference]: With dead ends: 139 [2020-07-17 17:05:44,529 INFO L226 Difference]: Without dead ends: 70 [2020-07-17 17:05:44,530 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-07-17 17:05:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-17 17:05:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-07-17 17:05:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-17 17:05:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-07-17 17:05:44,544 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-07-17 17:05:44,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:44,545 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-07-17 17:05:44,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:05:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-07-17 17:05:44,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-07-17 17:05:44,546 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:44,547 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:44,547 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:05:44,547 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:44,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:44,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-07-17 17:05:44,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:44,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [582811999] [2020-07-17 17:05:44,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-07-17 17:05:44,693 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [582811999] [2020-07-17 17:05:44,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:44,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:05:44,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160669059] [2020-07-17 17:05:44,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:05:44,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:05:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:05:44,696 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-07-17 17:05:44,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:44,833 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-07-17 17:05:44,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 17:05:44,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-07-17 17:05:44,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:44,835 INFO L225 Difference]: With dead ends: 73 [2020-07-17 17:05:44,835 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 17:05:44,836 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-17 17:05:44,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 17:05:44,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-07-17 17:05:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-17 17:05:44,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-07-17 17:05:44,848 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-07-17 17:05:44,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:44,849 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-07-17 17:05:44,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:05:44,849 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-07-17 17:05:44,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-07-17 17:05:44,851 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:44,851 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:44,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:05:44,852 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:44,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:44,852 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-07-17 17:05:44,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:44,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [238261285] [2020-07-17 17:05:44,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-07-17 17:05:45,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [238261285] [2020-07-17 17:05:45,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:45,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 17:05:45,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933872747] [2020-07-17 17:05:45,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 17:05:45,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 17:05:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-17 17:05:45,209 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 9 states. [2020-07-17 17:05:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:45,409 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2020-07-17 17:05:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-17 17:05:45,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2020-07-17 17:05:45,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:45,413 INFO L225 Difference]: With dead ends: 169 [2020-07-17 17:05:45,413 INFO L226 Difference]: Without dead ends: 163 [2020-07-17 17:05:45,414 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:05:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-07-17 17:05:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2020-07-17 17:05:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-07-17 17:05:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2020-07-17 17:05:45,441 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 195 [2020-07-17 17:05:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:45,442 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2020-07-17 17:05:45,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 17:05:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2020-07-17 17:05:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-07-17 17:05:45,445 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:45,446 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:05:45,446 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:05:45,446 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:45,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash 764562375, now seen corresponding path program 7 times [2020-07-17 17:05:45,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:45,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1203108113] [2020-07-17 17:05:45,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 536 proven. 797 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2020-07-17 17:05:46,115 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1203108113] [2020-07-17 17:05:46,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:46,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-07-17 17:05:46,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076339144] [2020-07-17 17:05:46,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-17 17:05:46,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:46,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-17 17:05:46,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-07-17 17:05:46,119 INFO L87 Difference]: Start difference. First operand 145 states and 194 transitions. Second operand 14 states. [2020-07-17 17:05:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:46,665 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2020-07-17 17:05:46,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-17 17:05:46,666 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 265 [2020-07-17 17:05:46,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:46,668 INFO L225 Difference]: With dead ends: 251 [2020-07-17 17:05:46,668 INFO L226 Difference]: Without dead ends: 116 [2020-07-17 17:05:46,670 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2020-07-17 17:05:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-17 17:05:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2020-07-17 17:05:46,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-07-17 17:05:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2020-07-17 17:05:46,685 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 265 [2020-07-17 17:05:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:46,685 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2020-07-17 17:05:46,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-17 17:05:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2020-07-17 17:05:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-07-17 17:05:46,689 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:46,689 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, 1, 1] [2020-07-17 17:05:46,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:05:46,689 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:46,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash -753564480, now seen corresponding path program 8 times [2020-07-17 17:05:46,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:46,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [288746776] [2020-07-17 17:05:46,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 126 proven. 642 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2020-07-17 17:05:47,119 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [288746776] [2020-07-17 17:05:47,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:47,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:05:47,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719842988] [2020-07-17 17:05:47,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:05:47,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:05:47,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:05:47,121 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand 10 states. [2020-07-17 17:05:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:47,321 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2020-07-17 17:05:47,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-17 17:05:47,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2020-07-17 17:05:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:47,324 INFO L225 Difference]: With dead ends: 111 [2020-07-17 17:05:47,324 INFO L226 Difference]: Without dead ends: 105 [2020-07-17 17:05:47,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:05:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-17 17:05:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-07-17 17:05:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-07-17 17:05:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2020-07-17 17:05:47,341 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 230 [2020-07-17 17:05:47,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:47,343 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2020-07-17 17:05:47,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:05:47,343 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2020-07-17 17:05:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2020-07-17 17:05:47,350 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:47,350 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, 1, 1] [2020-07-17 17:05:47,350 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:05:47,351 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1790891897, now seen corresponding path program 9 times [2020-07-17 17:05:47,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:47,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [949759123] [2020-07-17 17:05:47,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:05:48,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 264 proven. 1364 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2020-07-17 17:05:48,308 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [949759123] [2020-07-17 17:05:48,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:05:48,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:05:48,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496235399] [2020-07-17 17:05:48,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:05:48,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:05:48,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:05:48,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:05:48,311 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 11 states. [2020-07-17 17:05:48,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:05:48,577 INFO L93 Difference]: Finished difference Result 352 states and 478 transitions. [2020-07-17 17:05:48,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 17:05:48,578 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 371 [2020-07-17 17:05:48,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:05:48,585 INFO L225 Difference]: With dead ends: 352 [2020-07-17 17:05:48,585 INFO L226 Difference]: Without dead ends: 346 [2020-07-17 17:05:48,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-07-17 17:05:48,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-07-17 17:05:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 316. [2020-07-17 17:05:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-07-17 17:05:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 433 transitions. [2020-07-17 17:05:48,639 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 433 transitions. Word has length 371 [2020-07-17 17:05:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:05:48,642 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 433 transitions. [2020-07-17 17:05:48,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:05:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 433 transitions. [2020-07-17 17:05:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2020-07-17 17:05:48,655 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:05:48,655 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, 1, 1] [2020-07-17 17:05:48,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-17 17:05:48,656 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:05:48,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:05:48,656 INFO L82 PathProgramCache]: Analyzing trace with hash -170434367, now seen corresponding path program 10 times [2020-07-17 17:05:48,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:05:48,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1666194349] [2020-07-17 17:05:48,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:05:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:05:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 17:05:49,065 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-17 17:05:49,065 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 17:05:49,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-17 17:05:49,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:05:49 BoogieIcfgContainer [2020-07-17 17:05:49,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:05:49,210 INFO L168 Benchmark]: Toolchain (without parser) took 7842.66 ms. Allocated memory was 136.3 MB in the beginning and 447.7 MB in the end (delta: 311.4 MB). Free memory was 102.0 MB in the beginning and 101.2 MB in the end (delta: 838.6 kB). Peak memory consumption was 312.3 MB. Max. memory is 7.1 GB. [2020-07-17 17:05:49,211 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 17:05:49,211 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.43 ms. Allocated memory is still 136.3 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2020-07-17 17:05:49,212 INFO L168 Benchmark]: Boogie Preprocessor took 35.57 ms. Allocated memory is still 136.3 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:05:49,213 INFO L168 Benchmark]: RCFGBuilder took 354.93 ms. Allocated memory was 136.3 MB in the beginning and 198.2 MB in the end (delta: 61.9 MB). Free memory was 91.1 MB in the beginning and 165.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:05:49,214 INFO L168 Benchmark]: TraceAbstraction took 7172.66 ms. Allocated memory was 198.2 MB in the beginning and 447.7 MB in the end (delta: 249.6 MB). Free memory was 165.1 MB in the beginning and 101.2 MB in the end (delta: 63.9 MB). Peak memory consumption was 313.5 MB. Max. memory is 7.1 GB. [2020-07-17 17:05:49,218 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 136.3 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.43 ms. Allocated memory is still 136.3 MB. Free memory was 101.6 MB in the beginning and 92.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.57 ms. Allocated memory is still 136.3 MB. Free memory was 92.4 MB in the beginning and 91.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 354.93 ms. Allocated memory was 136.3 MB in the beginning and 198.2 MB in the end (delta: 61.9 MB). Free memory was 91.1 MB in the beginning and 165.1 MB in the end (delta: -74.0 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7172.66 ms. Allocated memory was 198.2 MB in the beginning and 447.7 MB in the end (delta: 249.6 MB). Free memory was 165.1 MB in the beginning and 101.2 MB in the end (delta: 63.9 MB). Peak memory consumption was 313.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=8, x=8] [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=7, \result=13, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=8, \result=21, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); VAL [fibonacci(x)=21, result=21, x=8] [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.9s, OverallIterations: 13, TraceHistogramMax: 67, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 370 SDtfs, 631 SDslu, 1058 SDs, 0 SdLazy, 1052 SolverSat, 345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 94 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1478 ConstructedInterpolants, 0 QuantifiedInterpolants, 515326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 8261/11842 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...