/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-simple/fibo_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:54:53,504 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:54:53,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:54:53,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:54:53,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:54:53,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:54:53,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:54:53,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:54:53,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:54:53,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:54:53,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:54:53,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:54:53,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:54:53,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:54:53,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:54:53,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:54:53,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:54:53,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:54:53,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:54:53,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:54:53,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:54:53,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:54:53,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:54:53,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:54:53,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:54:53,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:54:53,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:54:53,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:54:53,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:54:53,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:54:53,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:54:53,588 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:54:53,589 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:54:53,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:54:53,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:54:53,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:54:53,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:54:53,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:54:53,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:54:53,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:54:53,598 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:54:53,599 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 21:54:53,634 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:54:53,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:54:53,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:54:53,642 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:54:53,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:54:53,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:54:53,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:54:53,643 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:54:53,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:54:53,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:54:53,643 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:54:53,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:54:53,644 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:54:53,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:54:53,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:54:53,644 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:54:53,644 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:54:53,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:54:53,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:54:53,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:54:53,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:54:53,646 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:54:53,647 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-09-04 21:54:54,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:54:54,174 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:54:54,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:54:54,184 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:54:54,185 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:54:54,186 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-2.c [2020-09-04 21:54:54,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/85bd5b2ed/255e09aa08d14397a49bcc01106d356f/FLAGc632cfc8e [2020-09-04 21:54:54,952 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:54:54,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_5-2.c [2020-09-04 21:54:54,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/85bd5b2ed/255e09aa08d14397a49bcc01106d356f/FLAGc632cfc8e [2020-09-04 21:54:55,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/85bd5b2ed/255e09aa08d14397a49bcc01106d356f [2020-09-04 21:54:55,313 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:54:55,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:54:55,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:54:55,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:54:55,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:54:55,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f16079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55, skipping insertion in model container [2020-09-04 21:54:55,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:54:55,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:54:55,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:54:55,623 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:54:55,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:54:55,661 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:54:55,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55 WrapperNode [2020-09-04 21:54:55,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:54:55,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:54:55,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:54:55,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:54:55,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (1/1) ... [2020-09-04 21:54:55,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:54:55,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:54:55,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:54:55,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:54:55,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (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 21:54:55,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:54:55,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:54:55,918 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 21:54:55,918 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:54:55,918 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 21:54:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:54:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:54:55,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:54:56,148 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:54:56,149 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:54:56,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:54:56 BoogieIcfgContainer [2020-09-04 21:54:56,156 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:54:56,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:54:56,158 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:54:56,162 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:54:56,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:54:55" (1/3) ... [2020-09-04 21:54:56,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5f2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:54:56, skipping insertion in model container [2020-09-04 21:54:56,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:54:55" (2/3) ... [2020-09-04 21:54:56,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e5f2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:54:56, skipping insertion in model container [2020-09-04 21:54:56,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:54:56" (3/3) ... [2020-09-04 21:54:56,167 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_5-2.c [2020-09-04 21:54:56,182 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:54:56,193 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:54:56,244 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:54:56,286 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:54:56,286 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:54:56,287 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:54:56,287 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:54:56,287 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:54:56,287 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:54:56,287 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:54:56,288 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:54:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-09-04 21:54:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-09-04 21:54:56,330 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:56,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:54:56,331 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-09-04 21:54:56,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:56,357 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [112241455] [2020-09-04 21:54:56,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,678 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 21:54:56,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [112241455] [2020-09-04 21:54:56,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:54:56,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:54:56,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184437457] [2020-09-04 21:54:56,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:54:56,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:54:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:54:56,711 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-09-04 21:54:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:56,861 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-09-04 21:54:56,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:54:56,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-09-04 21:54:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:56,878 INFO L225 Difference]: With dead ends: 44 [2020-09-04 21:54:56,878 INFO L226 Difference]: Without dead ends: 28 [2020-09-04 21:54:56,883 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:54:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-09-04 21:54:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-09-04 21:54:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:54:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:54:56,945 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-09-04 21:54:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:56,946 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:54:56,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:54:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:54:56,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-09-04 21:54:56,949 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:56,950 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 21:54:56,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:54:56,950 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:56,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:56,951 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-09-04 21:54:56,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:56,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1040468701] [2020-09-04 21:54:56,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:56,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,033 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 21:54:57,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1040468701] [2020-09-04 21:54:57,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:54:57,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:54:57,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354383463] [2020-09-04 21:54:57,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:54:57,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:54:57,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:54:57,038 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-09-04 21:54:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:57,117 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-09-04 21:54:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:54:57,118 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-09-04 21:54:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:57,120 INFO L225 Difference]: With dead ends: 36 [2020-09-04 21:54:57,121 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:54:57,122 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 21:54:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:54:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-09-04 21:54:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-09-04 21:54:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-09-04 21:54:57,137 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-09-04 21:54:57,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:57,137 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-09-04 21:54:57,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:54:57,138 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-09-04 21:54:57,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-09-04 21:54:57,140 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:57,140 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 21:54:57,140 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:54:57,141 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:57,141 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-09-04 21:54:57,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:57,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [932210045] [2020-09-04 21:54:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:54:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:54:57,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [932210045] [2020-09-04 21:54:57,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:57,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:54:57,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210860705] [2020-09-04 21:54:57,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:54:57,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:57,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:54:57,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:54:57,306 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-09-04 21:54:57,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:57,453 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-09-04 21:54:57,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:54:57,455 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-09-04 21:54:57,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:57,456 INFO L225 Difference]: With dead ends: 52 [2020-09-04 21:54:57,457 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:54:57,458 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 21:54:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:54:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:54:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:54:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:54:57,471 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-09-04 21:54:57,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:57,472 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:54:57,472 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:54:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:54:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:54:57,474 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:57,474 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 21:54:57,475 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:54:57,475 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:57,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:57,476 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-09-04 21:54:57,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:57,476 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580125203] [2020-09-04 21:54:57,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 21:54:57,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580125203] [2020-09-04 21:54:57,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:57,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:54:57,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022221786] [2020-09-04 21:54:57,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:54:57,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:57,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:54:57,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:54:57,610 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 21:54:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:57,776 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-09-04 21:54:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:54:57,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-09-04 21:54:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:57,780 INFO L225 Difference]: With dead ends: 56 [2020-09-04 21:54:57,781 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 21:54:57,782 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 21:54:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 21:54:57,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 21:54:57,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 21:54:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 21:54:57,801 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-09-04 21:54:57,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:57,801 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 21:54:57,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:54:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 21:54:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-09-04 21:54:57,804 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:57,805 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 21:54:57,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:54:57,805 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:57,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:57,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-09-04 21:54:57,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:57,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588092699] [2020-09-04 21:54:57,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:57,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,114 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 21:54:58,114 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588092699] [2020-09-04 21:54:58,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:58,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:54:58,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256974806] [2020-09-04 21:54:58,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:54:58,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:58,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:54:58,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:54:58,118 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-09-04 21:54:58,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:58,334 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-09-04 21:54:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 21:54:58,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-09-04 21:54:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:58,339 INFO L225 Difference]: With dead ends: 111 [2020-09-04 21:54:58,339 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 21:54:58,345 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 21:54:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 21:54:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-09-04 21:54:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 21:54:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-09-04 21:54:58,382 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-09-04 21:54:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:58,384 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-09-04 21:54:58,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:54:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-09-04 21:54:58,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:54:58,390 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:58,395 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 21:54:58,396 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:54:58,398 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-09-04 21:54:58,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:58,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [737063210] [2020-09-04 21:54:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:58,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 21:54:58,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [737063210] [2020-09-04 21:54:58,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:58,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:54:58,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7622224] [2020-09-04 21:54:58,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:54:58,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:58,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:54:58,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:54:58,582 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-09-04 21:54:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:58,712 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-09-04 21:54:58,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:54:58,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-09-04 21:54:58,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:58,716 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:54:58,716 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:54:58,717 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 21:54:58,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:54:58,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-09-04 21:54:58,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-09-04 21:54:58,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-09-04 21:54:58,736 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-09-04 21:54:58,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:58,737 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-09-04 21:54:58,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:54:58,737 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-09-04 21:54:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 21:54:58,741 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:58,742 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 21:54:58,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:54:58,742 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:58,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-09-04 21:54:58,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:58,744 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245555105] [2020-09-04 21:54:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:58,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:58,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,118 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-09-04 21:54:59,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245555105] [2020-09-04 21:54:59,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:54:59,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:54:59,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290505999] [2020-09-04 21:54:59,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:54:59,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:54:59,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:54:59,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:54:59,180 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-09-04 21:54:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:54:59,570 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-09-04 21:54:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:54:59,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-09-04 21:54:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:54:59,575 INFO L225 Difference]: With dead ends: 142 [2020-09-04 21:54:59,576 INFO L226 Difference]: Without dead ends: 73 [2020-09-04 21:54:59,577 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 21:54:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-09-04 21:54:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-09-04 21:54:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 21:54:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-09-04 21:54:59,594 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-09-04 21:54:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:54:59,595 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-09-04 21:54:59,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:54:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-09-04 21:54:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-09-04 21:54:59,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:54:59,598 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 21:54:59,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:54:59,598 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:54:59,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:54:59,599 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-09-04 21:54:59,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:54:59,600 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [698326900] [2020-09-04 21:54:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:54:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:54:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 21:54:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:54:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:54:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:54:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:54:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:54:59,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:54:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:00,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:55:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:55:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:55:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:55:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:55:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:55:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-09-04 21:55:00,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [698326900] [2020-09-04 21:55:00,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:55:00,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:55:00,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750671015] [2020-09-04 21:55:00,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:55:00,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:55:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:55:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:55:00,317 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-09-04 21:55:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:55:00,896 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-09-04 21:55:00,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:55:00,897 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-09-04 21:55:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:55:00,900 INFO L225 Difference]: With dead ends: 149 [2020-09-04 21:55:00,900 INFO L226 Difference]: Without dead ends: 92 [2020-09-04 21:55:00,902 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2020-09-04 21:55:00,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-09-04 21:55:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2020-09-04 21:55:00,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 21:55:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2020-09-04 21:55:00,921 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 193 [2020-09-04 21:55:00,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:55:00,922 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2020-09-04 21:55:00,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:55:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-09-04 21:55:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-09-04 21:55:00,924 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:55:00,924 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:55:00,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:55:00,925 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:55:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:55:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1618484333, now seen corresponding path program 6 times [2020-09-04 21:55:00,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:55:00,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586499760] [2020-09-04 21:55:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:55:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:00,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:00,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:55:00,978 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:55:01,016 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:55:01,016 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:55:01,017 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:55:01,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:55:01 BoogieIcfgContainer [2020-09-04 21:55:01,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:55:01,079 INFO L168 Benchmark]: Toolchain (without parser) took 5762.17 ms. Allocated memory was 138.9 MB in the beginning and 292.0 MB in the end (delta: 153.1 MB). Free memory was 103.8 MB in the beginning and 127.3 MB in the end (delta: -23.5 MB). Peak memory consumption was 129.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:01,079 INFO L168 Benchmark]: CDTParser took 1.00 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 21:55:01,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.67 ms. Allocated memory is still 138.9 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 21:55:01,081 INFO L168 Benchmark]: Boogie Preprocessor took 35.14 ms. Allocated memory is still 138.9 MB. Free memory was 94.2 MB in the beginning and 92.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:01,082 INFO L168 Benchmark]: RCFGBuilder took 457.63 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 92.6 MB in the beginning and 167.8 MB in the end (delta: -75.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:01,083 INFO L168 Benchmark]: TraceAbstraction took 4916.83 ms. Allocated memory was 201.3 MB in the beginning and 292.0 MB in the end (delta: 90.7 MB). Free memory was 167.8 MB in the beginning and 127.3 MB in the end (delta: 40.5 MB). Peak memory consumption was 131.2 MB. Max. memory is 7.1 GB. [2020-09-04 21:55:01,087 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 344.67 ms. Allocated memory is still 138.9 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 35.14 ms. Allocated memory is still 138.9 MB. Free memory was 94.2 MB in the beginning and 92.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 457.63 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 92.6 MB in the beginning and 167.8 MB in the end (delta: -75.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4916.83 ms. Allocated memory was 201.3 MB in the beginning and 292.0 MB in the end (delta: 90.7 MB). Free memory was 167.8 MB in the beginning and 127.3 MB in the end (delta: 40.5 MB). Peak memory consumption was 131.2 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 = 5; VAL [x=5] [L25] CALL, EXPR fibo(x) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=4, \result=3, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=2, \result=1, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=3, \result=2, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); VAL [\old(n)=5, \result=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L25] RET, EXPR fibo(x) VAL [fibo(x)=5, x=5] [L25] int result = fibo(x); VAL [fibo(x)=5, result=5, x=5] [L26] COND TRUE result == 5 VAL [result=5, x=5] [L27] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 21, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 229 SDtfs, 384 SDslu, 651 SDs, 0 SdLazy, 644 SolverSat, 165 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 232 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 36 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 659 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 112687 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 1298/1932 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...