/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:28:17,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:28:17,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:28:17,677 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:28:17,677 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:28:17,679 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:28:17,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:28:17,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:28:17,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:28:17,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:28:17,688 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:28:17,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:28:17,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:28:17,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:28:17,692 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:28:17,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:28:17,695 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:28:17,696 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:28:17,698 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:28:17,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:28:17,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:28:17,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:28:17,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:28:17,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:28:17,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:28:17,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:28:17,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:28:17,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:28:17,712 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:28:17,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:28:17,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:28:17,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:28:17,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:28:17,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:28:17,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:28:17,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:28:17,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:28:17,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:28:17,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:28:17,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:28:17,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:28:17,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:28:17,735 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:28:17,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:28:17,737 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:28:17,737 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:28:17,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:28:17,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:28:17,738 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:28:17,738 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:28:17,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:28:17,738 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:28:17,738 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:28:17,739 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:28:17,739 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:28:17,739 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:28:17,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:28:17,740 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:28:17,740 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:28:17,740 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:28:17,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:28:17,741 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:28:17,741 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:28:17,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:28:17,741 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:28:18,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:28:18,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:28:18,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:28:18,262 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:28:18,262 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:28:18,263 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-04 16:28:18,363 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/07d4f0111/c3b94e817ade4d628d2990919a0e9693/FLAGd942faf7a [2020-09-04 16:28:18,915 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:28:18,916 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-09-04 16:28:18,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/07d4f0111/c3b94e817ade4d628d2990919a0e9693/FLAGd942faf7a [2020-09-04 16:28:19,254 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/07d4f0111/c3b94e817ade4d628d2990919a0e9693 [2020-09-04 16:28:19,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:28:19,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:28:19,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:19,275 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:28:19,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:28:19,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6220607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19, skipping insertion in model container [2020-09-04 16:28:19,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:28:19,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:28:19,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:19,568 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:28:19,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:28:19,604 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:28:19,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19 WrapperNode [2020-09-04 16:28:19,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:28:19,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:28:19,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:28:19,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:28:19,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,627 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... [2020-09-04 16:28:19,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:28:19,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:28:19,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:28:19,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:28:19,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:28:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:28:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:28:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 16:28:19,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:28:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 16:28:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:28:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 16:28:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:28:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:28:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:28:20,131 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:28:20,132 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:28:20,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:20 BoogieIcfgContainer [2020-09-04 16:28:20,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:28:20,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:28:20,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:28:20,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:28:20,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:28:19" (1/3) ... [2020-09-04 16:28:20,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202fd409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:20, skipping insertion in model container [2020-09-04 16:28:20,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:28:19" (2/3) ... [2020-09-04 16:28:20,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@202fd409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:28:20, skipping insertion in model container [2020-09-04 16:28:20,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:28:20" (3/3) ... [2020-09-04 16:28:20,172 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-09-04 16:28:20,186 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:28:20,199 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:28:20,222 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:28:20,252 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:28:20,252 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:28:20,252 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:28:20,252 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:28:20,252 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:28:20,253 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:28:20,253 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:28:20,253 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:28:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-09-04 16:28:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 16:28:20,284 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:20,286 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:20,286 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-09-04 16:28:20,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:20,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1029198600] [2020-09-04 16:28:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:20,377 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:20,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:20,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:28:20,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1029198600] [2020-09-04 16:28:20,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:20,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:20,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342392293] [2020-09-04 16:28:20,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:20,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:20,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:20,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:20,651 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-09-04 16:28:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:20,845 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-09-04 16:28:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:28:20,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 16:28:20,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:20,869 INFO L225 Difference]: With dead ends: 44 [2020-09-04 16:28:20,869 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 16:28:20,875 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-09-04 16:28:20,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 16:28:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 16:28:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:28:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 16:28:20,958 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-09-04 16:28:20,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:20,959 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 16:28:20,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:20,959 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 16:28:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 16:28:20,962 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:20,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:20,963 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:28:20,963 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-09-04 16:28:20,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:20,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1770665083] [2020-09-04 16:28:20,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:20,967 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:20,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:20,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:21,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:28:21,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1770665083] [2020-09-04 16:28:21,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:21,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:28:21,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365858894] [2020-09-04 16:28:21,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:28:21,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:21,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:28:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:28:21,035 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-09-04 16:28:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:21,104 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-09-04 16:28:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:28:21,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 16:28:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:21,107 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:28:21,107 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:28:21,110 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-09-04 16:28:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:28:21,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-09-04 16:28:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 16:28:21,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 16:28:21,123 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-09-04 16:28:21,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:21,124 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 16:28:21,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:28:21,124 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 16:28:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 16:28:21,126 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:21,126 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:21,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:28:21,127 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:21,128 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-09-04 16:28:21,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:21,129 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [377304284] [2020-09-04 16:28:21,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:21,132 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 16:28:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 16:28:21,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [377304284] [2020-09-04 16:28:21,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:21,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:28:21,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814665212] [2020-09-04 16:28:21,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:28:21,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:21,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:28:21,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:28:21,331 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-09-04 16:28:21,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:21,456 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-09-04 16:28:21,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:28:21,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 16:28:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:21,458 INFO L225 Difference]: With dead ends: 52 [2020-09-04 16:28:21,459 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:28:21,460 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:28:21,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:28:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:28:21,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:28:21,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 16:28:21,473 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-09-04 16:28:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:21,474 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 16:28:21,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:28:21,474 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 16:28:21,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 16:28:21,476 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:21,477 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:21,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:28:21,477 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:21,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:21,478 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-09-04 16:28:21,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:21,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524557015] [2020-09-04 16:28:21,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:21,484 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 16:28:21,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524557015] [2020-09-04 16:28:21,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:21,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:28:21,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450223843] [2020-09-04 16:28:21,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:28:21,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:28:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:28:21,675 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 16:28:21,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:21,810 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-09-04 16:28:21,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:28:21,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 16:28:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:21,814 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:28:21,814 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:28:21,815 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-09-04 16:28:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:28:21,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:28:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:28:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 16:28:21,832 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-09-04 16:28:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:21,833 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 16:28:21,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:28:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 16:28:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 16:28:21,836 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:21,836 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:21,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:28:21,837 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:21,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-09-04 16:28:21,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:21,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1484009214] [2020-09-04 16:28:21,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:21,840 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:21,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,028 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-09-04 16:28:22,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1484009214] [2020-09-04 16:28:22,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:22,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:28:22,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107825669] [2020-09-04 16:28:22,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:28:22,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:22,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:28:22,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:28:22,031 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-09-04 16:28:22,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:22,195 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-09-04 16:28:22,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:28:22,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 16:28:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:22,199 INFO L225 Difference]: With dead ends: 111 [2020-09-04 16:28:22,199 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 16:28:22,201 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 16:28:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-09-04 16:28:22,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:28:22,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-09-04 16:28:22,222 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-09-04 16:28:22,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:22,223 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-09-04 16:28:22,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:28:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-09-04 16:28:22,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 16:28:22,225 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:22,226 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:22,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:28:22,226 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:22,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:22,227 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-09-04 16:28:22,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:22,227 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [442592831] [2020-09-04 16:28:22,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:22,229 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:22,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-09-04 16:28:22,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [442592831] [2020-09-04 16:28:22,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:22,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:28:22,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258853859] [2020-09-04 16:28:22,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:28:22,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:22,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:28:22,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:28:22,436 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-09-04 16:28:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:22,577 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-09-04 16:28:22,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:28:22,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-09-04 16:28:22,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:22,581 INFO L225 Difference]: With dead ends: 89 [2020-09-04 16:28:22,581 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 16:28:22,582 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-09-04 16:28:22,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 16:28:22,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-09-04 16:28:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 16:28:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-09-04 16:28:22,610 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-09-04 16:28:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:22,611 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-09-04 16:28:22,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:28:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-09-04 16:28:22,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 16:28:22,624 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:22,624 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:22,624 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:28:22,625 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:22,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-09-04 16:28:22,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:22,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2138228299] [2020-09-04 16:28:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:22,629 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:22,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:22,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 11 proven. 69 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2020-09-04 16:28:23,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2138228299] [2020-09-04 16:28:23,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:23,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:28:23,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434635922] [2020-09-04 16:28:23,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:28:23,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:23,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:28:23,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:28:23,116 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-09-04 16:28:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:23,457 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-09-04 16:28:23,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:28:23,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-09-04 16:28:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:23,461 INFO L225 Difference]: With dead ends: 142 [2020-09-04 16:28:23,462 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 16:28:23,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:28:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 16:28:23,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-09-04 16:28:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:28:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-09-04 16:28:23,478 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-09-04 16:28:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:23,479 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-09-04 16:28:23,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:28:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-09-04 16:28:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 16:28:23,486 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:23,486 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:23,486 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:28:23,487 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:23,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-09-04 16:28:23,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:23,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1575919941] [2020-09-04 16:28:23,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:23,490 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:23,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:23,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,032 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 48 proven. 97 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-09-04 16:28:24,032 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1575919941] [2020-09-04 16:28:24,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:24,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:28:24,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127318126] [2020-09-04 16:28:24,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:28:24,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:24,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:28:24,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:28:24,035 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-09-04 16:28:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:24,513 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-09-04 16:28:24,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:28:24,513 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-09-04 16:28:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:24,516 INFO L225 Difference]: With dead ends: 149 [2020-09-04 16:28:24,517 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 16:28:24,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:28:24,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 16:28:24,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2020-09-04 16:28:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 16:28:24,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2020-09-04 16:28:24,550 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 193 [2020-09-04 16:28:24,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:24,551 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2020-09-04 16:28:24,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:28:24,551 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2020-09-04 16:28:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-09-04 16:28:24,556 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:24,557 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:24,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:28:24,557 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:24,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 6 times [2020-09-04 16:28:24,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:24,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [175781779] [2020-09-04 16:28:24,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:24,562 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:28:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 16:28:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,772 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:24,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 16:28:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 16:28:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 16:28:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:28:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 16:28:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 16:28:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:28:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 30 proven. 152 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2020-09-04 16:28:25,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [175781779] [2020-09-04 16:28:25,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:28:25,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:28:25,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454255088] [2020-09-04 16:28:25,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:28:25,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:28:25,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:28:25,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:28:25,382 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand 15 states. [2020-09-04 16:28:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:28:26,083 INFO L93 Difference]: Finished difference Result 194 states and 284 transitions. [2020-09-04 16:28:26,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 16:28:26,084 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-09-04 16:28:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:28:26,089 INFO L225 Difference]: With dead ends: 194 [2020-09-04 16:28:26,089 INFO L226 Difference]: Without dead ends: 119 [2020-09-04 16:28:26,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=877, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:28:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-09-04 16:28:26,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2020-09-04 16:28:26,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-09-04 16:28:26,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 138 transitions. [2020-09-04 16:28:26,122 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 138 transitions. Word has length 281 [2020-09-04 16:28:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:28:26,123 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 138 transitions. [2020-09-04 16:28:26,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:28:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 138 transitions. [2020-09-04 16:28:26,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2020-09-04 16:28:26,131 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:28:26,131 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:28:26,131 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:28:26,131 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:28:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:28:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash 260846875, now seen corresponding path program 7 times [2020-09-04 16:28:26,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:28:26,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242359238] [2020-09-04 16:28:26,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:28:26,136 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:28:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:28:26,220 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:28:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:28:26,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:28:26,382 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 16:28:26,382 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 16:28:26,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:28:26,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:28:26 BoogieIcfgContainer [2020-09-04 16:28:26,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:28:26,427 INFO L168 Benchmark]: Toolchain (without parser) took 7153.71 ms. Allocated memory was 139.5 MB in the beginning and 317.2 MB in the end (delta: 177.7 MB). Free memory was 103.7 MB in the beginning and 135.7 MB in the end (delta: -32.0 MB). Peak memory consumption was 145.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:26,428 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. [2020-09-04 16:28:26,429 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.06 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 94.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:26,430 INFO L168 Benchmark]: Boogie Preprocessor took 30.72 ms. Allocated memory is still 139.5 MB. Free memory was 94.2 MB in the beginning and 92.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:26,431 INFO L168 Benchmark]: RCFGBuilder took 500.31 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 170.3 MB in the end (delta: -77.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:26,431 INFO L168 Benchmark]: TraceAbstraction took 6272.00 ms. Allocated memory was 203.4 MB in the beginning and 317.2 MB in the end (delta: 113.8 MB). Free memory was 170.3 MB in the beginning and 135.7 MB in the end (delta: 34.6 MB). Peak memory consumption was 148.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:28:26,435 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.24 ms. Allocated memory is still 139.5 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.8 kB). Peak memory consumption was 419.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 331.06 ms. Allocated memory is still 139.5 MB. Free memory was 103.3 MB in the beginning and 94.2 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.72 ms. Allocated memory is still 139.5 MB. Free memory was 94.2 MB in the beginning and 92.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 500.31 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 92.5 MB in the beginning and 170.3 MB in the end (delta: -77.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6272.00 ms. Allocated memory was 203.4 MB in the beginning and 317.2 MB in the end (delta: 113.8 MB). Free memory was 170.3 MB in the beginning and 135.7 MB in the end (delta: 34.6 MB). Peak memory consumption was 148.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; [L25] CALL, EXPR fibo(x) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND FALSE !(n == 1) [L11] CALL, EXPR fibo(n-1) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND TRUE n < 1 [L7] return 0; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) [L11] CALL, EXPR fibo(n-2) [L6] COND FALSE !(n < 1) [L8] COND TRUE n == 1 [L9] return 1; [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 13 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.1s, OverallIterations: 10, TraceHistogramMax: 41, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 273 SDtfs, 553 SDslu, 804 SDs, 0 SdLazy, 864 SolverSat, 279 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 331 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 40 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...