/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:38:21,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:38:21,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:38:21,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:38:21,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:38:21,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:38:21,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:38:21,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:38:21,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:38:21,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:38:21,846 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:38:21,847 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:38:21,847 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:38:21,848 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:38:21,849 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:38:21,850 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:38:21,851 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:38:21,852 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:38:21,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:38:21,857 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:38:21,859 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:38:21,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:38:21,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:38:21,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:38:21,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:38:21,865 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:38:21,865 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:38:21,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:38:21,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:38:21,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:38:21,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:38:21,869 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:38:21,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:38:21,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:38:21,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:38:21,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:38:21,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:38:21,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:38:21,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:38:21,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:38:21,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:38:21,876 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:38:21,887 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:38:21,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:38:21,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:38:21,888 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:38:21,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:38:21,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:38:21,889 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:38:21,889 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:38:21,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:38:21,890 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:38:21,890 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:38:21,890 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:38:21,890 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:38:21,890 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:38:21,891 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:38:21,891 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:38:21,891 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:38:21,891 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:38:21,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:38:21,892 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:38:21,892 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:38:21,892 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:38:21,892 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:38:22,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:38:22,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:38:22,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:38:22,352 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:38:22,352 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:38:22,353 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-09-04 21:38:22,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c002e88f8/c1ecb649cfa74f1fb41f014e3fea2dbe/FLAG42d3f6256 [2020-09-04 21:38:22,967 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:38:22,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-09-04 21:38:22,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c002e88f8/c1ecb649cfa74f1fb41f014e3fea2dbe/FLAG42d3f6256 [2020-09-04 21:38:23,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c002e88f8/c1ecb649cfa74f1fb41f014e3fea2dbe [2020-09-04 21:38:23,333 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:38:23,336 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:38:23,337 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:38:23,337 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:38:23,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:38:23,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c38a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23, skipping insertion in model container [2020-09-04 21:38:23,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:38:23,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:38:23,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:38:23,602 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:38:23,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:38:23,639 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:38:23,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23 WrapperNode [2020-09-04 21:38:23,640 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:38:23,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:38:23,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:38:23,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:38:23,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (1/1) ... [2020-09-04 21:38:23,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:38:23,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:38:23,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:38:23,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:38:23,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (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:38:23,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:38:23,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:38:23,825 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-09-04 21:38:23,825 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:38:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:38:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:38:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-09-04 21:38:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:38:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:38:23,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:38:24,068 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:38:24,068 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:38:24,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:38:24 BoogieIcfgContainer [2020-09-04 21:38:24,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:38:24,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:38:24,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:38:24,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:38:24,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:38:23" (1/3) ... [2020-09-04 21:38:24,084 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fb0f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:38:24, skipping insertion in model container [2020-09-04 21:38:24,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:38:23" (2/3) ... [2020-09-04 21:38:24,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58fb0f51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:38:24, skipping insertion in model container [2020-09-04 21:38:24,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:38:24" (3/3) ... [2020-09-04 21:38:24,088 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-09-04 21:38:24,100 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:38:24,110 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:38:24,144 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:38:24,176 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:38:24,177 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:38:24,177 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:38:24,177 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:38:24,178 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:38:24,178 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:38:24,178 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:38:24,179 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:38:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-09-04 21:38:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 21:38:24,214 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:24,215 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:24,216 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:24,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2064988448, now seen corresponding path program 1 times [2020-09-04 21:38:24,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:24,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2009942706] [2020-09-04 21:38:24,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,538 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:38:24,540 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2009942706] [2020-09-04 21:38:24,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:24,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:38:24,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424561348] [2020-09-04 21:38:24,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:38:24,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:24,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:38:24,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:38:24,576 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2020-09-04 21:38:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:24,711 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-09-04 21:38:24,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:38:24,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 21:38:24,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:24,732 INFO L225 Difference]: With dead ends: 48 [2020-09-04 21:38:24,732 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 21:38:24,737 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:38:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 21:38:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 21:38:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:38:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:38:24,793 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 18 [2020-09-04 21:38:24,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:24,794 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:38:24,794 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:38:24,794 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:38:24,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-09-04 21:38:24,797 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:24,797 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:24,797 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:38:24,798 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:24,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:24,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1678486471, now seen corresponding path program 1 times [2020-09-04 21:38:24,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:24,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1524474948] [2020-09-04 21:38:24,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:24,889 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:38:24,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1524474948] [2020-09-04 21:38:24,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:38:24,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 21:38:24,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479370332] [2020-09-04 21:38:24,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:38:24,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:24,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:38:24,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:38:24,896 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-09-04 21:38:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:25,010 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-09-04 21:38:25,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:38:25,012 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-09-04 21:38:25,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:25,015 INFO L225 Difference]: With dead ends: 38 [2020-09-04 21:38:25,015 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 21:38:25,016 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:38:25,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 21:38:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-09-04 21:38:25,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 21:38:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-09-04 21:38:25,041 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 19 [2020-09-04 21:38:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:25,041 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-09-04 21:38:25,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:38:25,043 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-09-04 21:38:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-09-04 21:38:25,048 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:25,048 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:25,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:38:25,049 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:25,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:25,049 INFO L82 PathProgramCache]: Analyzing trace with hash 961212118, now seen corresponding path program 1 times [2020-09-04 21:38:25,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:25,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [97269454] [2020-09-04 21:38:25,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:38:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,188 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:38:25,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [97269454] [2020-09-04 21:38:25,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:25,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:38:25,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807757994] [2020-09-04 21:38:25,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:25,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:25,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:25,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:25,191 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-09-04 21:38:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:25,304 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2020-09-04 21:38:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 21:38:25,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-09-04 21:38:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:25,307 INFO L225 Difference]: With dead ends: 54 [2020-09-04 21:38:25,307 INFO L226 Difference]: Without dead ends: 32 [2020-09-04 21:38:25,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:38:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-09-04 21:38:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-09-04 21:38:25,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-09-04 21:38:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2020-09-04 21:38:25,320 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 35 [2020-09-04 21:38:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:25,320 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2020-09-04 21:38:25,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:25,321 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2020-09-04 21:38:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 21:38:25,323 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:25,323 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:25,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:38:25,324 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:25,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash -125795935, now seen corresponding path program 1 times [2020-09-04 21:38:25,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:25,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1765449682] [2020-09-04 21:38:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,504 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:38:25,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1765449682] [2020-09-04 21:38:25,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:25,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-09-04 21:38:25,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608489953] [2020-09-04 21:38:25,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 21:38:25,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:25,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 21:38:25,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 21:38:25,509 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2020-09-04 21:38:25,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:25,642 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2020-09-04 21:38:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:38:25,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-09-04 21:38:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:25,646 INFO L225 Difference]: With dead ends: 58 [2020-09-04 21:38:25,646 INFO L226 Difference]: Without dead ends: 52 [2020-09-04 21:38:25,647 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:38:25,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-09-04 21:38:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2020-09-04 21:38:25,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-09-04 21:38:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2020-09-04 21:38:25,663 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 36 [2020-09-04 21:38:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:25,664 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2020-09-04 21:38:25,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 21:38:25,664 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2020-09-04 21:38:25,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 21:38:25,666 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:25,667 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:25,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:38:25,667 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:25,668 INFO L82 PathProgramCache]: Analyzing trace with hash 331377205, now seen corresponding path program 2 times [2020-09-04 21:38:25,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:25,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592921227] [2020-09-04 21:38:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:25,811 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:38:25,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592921227] [2020-09-04 21:38:25,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:25,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:38:25,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124055696] [2020-09-04 21:38:25,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:38:25,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:25,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:38:25,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:38:25,814 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand 7 states. [2020-09-04 21:38:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:25,932 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2020-09-04 21:38:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:38:25,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2020-09-04 21:38:25,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:25,936 INFO L225 Difference]: With dead ends: 110 [2020-09-04 21:38:25,936 INFO L226 Difference]: Without dead ends: 66 [2020-09-04 21:38:25,938 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-09-04 21:38:25,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2020-09-04 21:38:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-09-04 21:38:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2020-09-04 21:38:25,954 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 53 [2020-09-04 21:38:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:25,954 INFO L479 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2020-09-04 21:38:25,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:38:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2020-09-04 21:38:25,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 21:38:25,957 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:25,957 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:25,958 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:38:25,958 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2068833840, now seen corresponding path program 3 times [2020-09-04 21:38:25,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:25,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230975055] [2020-09-04 21:38:25,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,158 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:38:26,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230975055] [2020-09-04 21:38:26,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:26,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:38:26,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649527718] [2020-09-04 21:38:26,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:38:26,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:26,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:38:26,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:38:26,161 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 7 states. [2020-09-04 21:38:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:26,321 INFO L93 Difference]: Finished difference Result 88 states and 116 transitions. [2020-09-04 21:38:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:38:26,322 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2020-09-04 21:38:26,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:26,324 INFO L225 Difference]: With dead ends: 88 [2020-09-04 21:38:26,325 INFO L226 Difference]: Without dead ends: 82 [2020-09-04 21:38:26,325 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:38:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-09-04 21:38:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2020-09-04 21:38:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-09-04 21:38:26,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2020-09-04 21:38:26,344 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 54 [2020-09-04 21:38:26,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:26,345 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2020-09-04 21:38:26,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:38:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2020-09-04 21:38:26,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-09-04 21:38:26,351 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:26,351 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:26,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:38:26,351 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1575340027, now seen corresponding path program 4 times [2020-09-04 21:38:26,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:26,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [643725777] [2020-09-04 21:38:26,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:26,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:26,707 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:38:26,707 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [643725777] [2020-09-04 21:38:26,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:26,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:26,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763108020] [2020-09-04 21:38:26,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:26,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:26,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:26,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:26,710 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand 10 states. [2020-09-04 21:38:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:27,007 INFO L93 Difference]: Finished difference Result 139 states and 201 transitions. [2020-09-04 21:38:27,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:38:27,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 125 [2020-09-04 21:38:27,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:27,011 INFO L225 Difference]: With dead ends: 139 [2020-09-04 21:38:27,012 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 21:38:27,013 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2020-09-04 21:38:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 21:38:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2020-09-04 21:38:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-09-04 21:38:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2020-09-04 21:38:27,027 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 125 [2020-09-04 21:38:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:27,027 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2020-09-04 21:38:27,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2020-09-04 21:38:27,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-09-04 21:38:27,030 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:27,030 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:27,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:38:27,031 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:27,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:27,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1005193447, now seen corresponding path program 5 times [2020-09-04 21:38:27,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:27,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [913281606] [2020-09-04 21:38:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 105 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2020-09-04 21:38:27,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [913281606] [2020-09-04 21:38:27,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:27,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-09-04 21:38:27,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213442548] [2020-09-04 21:38:27,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:38:27,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:38:27,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:38:27,239 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand 8 states. [2020-09-04 21:38:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:27,378 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2020-09-04 21:38:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:38:27,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-09-04 21:38:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:27,380 INFO L225 Difference]: With dead ends: 73 [2020-09-04 21:38:27,380 INFO L226 Difference]: Without dead ends: 67 [2020-09-04 21:38:27,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 21:38:27,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-09-04 21:38:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2020-09-04 21:38:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-09-04 21:38:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2020-09-04 21:38:27,393 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 89 [2020-09-04 21:38:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:27,394 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2020-09-04 21:38:27,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:38:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2020-09-04 21:38:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2020-09-04 21:38:27,396 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:27,396 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:27,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:38:27,397 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:27,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash -750862549, now seen corresponding path program 6 times [2020-09-04 21:38:27,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:27,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1970015298] [2020-09-04 21:38:27,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:27,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 78 proven. 452 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [2020-09-04 21:38:27,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1970015298] [2020-09-04 21:38:27,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:27,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-09-04 21:38:27,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040564470] [2020-09-04 21:38:27,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 21:38:27,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 21:38:27,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 21:38:27,906 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 9 states. [2020-09-04 21:38:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:28,162 INFO L93 Difference]: Finished difference Result 169 states and 222 transitions. [2020-09-04 21:38:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:38:28,162 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2020-09-04 21:38:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:28,165 INFO L225 Difference]: With dead ends: 169 [2020-09-04 21:38:28,165 INFO L226 Difference]: Without dead ends: 163 [2020-09-04 21:38:28,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:38:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2020-09-04 21:38:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 145. [2020-09-04 21:38:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 21:38:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 194 transitions. [2020-09-04 21:38:28,192 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 194 transitions. Word has length 195 [2020-09-04 21:38:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:28,193 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 194 transitions. [2020-09-04 21:38:28,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 21:38:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 194 transitions. [2020-09-04 21:38:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2020-09-04 21:38:28,197 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:28,197 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 9, 9, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:28,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:38:28,198 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:28,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash 764562375, now seen corresponding path program 7 times [2020-09-04 21:38:28,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:28,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1282997641] [2020-09-04 21:38:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:28,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:38:28,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:28,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 536 proven. 797 refuted. 0 times theorem prover too weak. 1232 trivial. 0 not checked. [2020-09-04 21:38:29,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1282997641] [2020-09-04 21:38:29,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:29,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:38:29,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053286547] [2020-09-04 21:38:29,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:38:29,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:29,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:38:29,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:38:29,014 INFO L87 Difference]: Start difference. First operand 145 states and 194 transitions. Second operand 14 states. [2020-09-04 21:38:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:29,562 INFO L93 Difference]: Finished difference Result 251 states and 382 transitions. [2020-09-04 21:38:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 21:38:29,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 265 [2020-09-04 21:38:29,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:29,566 INFO L225 Difference]: With dead ends: 251 [2020-09-04 21:38:29,566 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 21:38:29,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2020-09-04 21:38:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 21:38:29,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2020-09-04 21:38:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-09-04 21:38:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2020-09-04 21:38:29,594 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 265 [2020-09-04 21:38:29,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:29,595 INFO L479 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2020-09-04 21:38:29,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:38:29,595 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2020-09-04 21:38:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2020-09-04 21:38:29,600 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:29,600 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:29,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:38:29,600 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:29,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash -753564480, now seen corresponding path program 8 times [2020-09-04 21:38:29,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:29,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548441984] [2020-09-04 21:38:29,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:29,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:29,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:30,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:38:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 126 proven. 642 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2020-09-04 21:38:30,135 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548441984] [2020-09-04 21:38:30,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:30,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-09-04 21:38:30,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777312589] [2020-09-04 21:38:30,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:38:30,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:30,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:38:30,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:38:30,137 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand 10 states. [2020-09-04 21:38:30,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:30,371 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2020-09-04 21:38:30,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 21:38:30,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 230 [2020-09-04 21:38:30,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:30,374 INFO L225 Difference]: With dead ends: 111 [2020-09-04 21:38:30,374 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 21:38:30,375 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:38:30,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 21:38:30,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 21:38:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 21:38:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2020-09-04 21:38:30,392 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 230 [2020-09-04 21:38:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:30,393 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2020-09-04 21:38:30,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:38:30,393 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2020-09-04 21:38:30,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2020-09-04 21:38:30,404 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:30,404 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 13, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:30,405 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 21:38:30,405 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:30,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:30,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1790891897, now seen corresponding path program 9 times [2020-09-04 21:38:30,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:30,406 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1144183796] [2020-09-04 21:38:30,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:38:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-09-04 21:38:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:30,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2020-09-04 21:38:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2020-09-04 21:38:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-09-04 21:38:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2020-09-04 21:38:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 21:38:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-09-04 21:38:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2020-09-04 21:38:31,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:38:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5244 backedges. 264 proven. 1364 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2020-09-04 21:38:31,334 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1144183796] [2020-09-04 21:38:31,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:38:31,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:38:31,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197731223] [2020-09-04 21:38:31,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:38:31,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:38:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:38:31,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:38:31,336 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 11 states. [2020-09-04 21:38:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:38:31,617 INFO L93 Difference]: Finished difference Result 352 states and 478 transitions. [2020-09-04 21:38:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:38:31,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 371 [2020-09-04 21:38:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:38:31,623 INFO L225 Difference]: With dead ends: 352 [2020-09-04 21:38:31,623 INFO L226 Difference]: Without dead ends: 346 [2020-09-04 21:38:31,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:38:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2020-09-04 21:38:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 316. [2020-09-04 21:38:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2020-09-04 21:38:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 433 transitions. [2020-09-04 21:38:31,673 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 433 transitions. Word has length 371 [2020-09-04 21:38:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:38:31,676 INFO L479 AbstractCegarLoop]: Abstraction has 316 states and 433 transitions. [2020-09-04 21:38:31,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:38:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 433 transitions. [2020-09-04 21:38:31,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2020-09-04 21:38:31,689 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:38:31,690 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 21, 21, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:38:31,690 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 21:38:31,690 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:38:31,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:38:31,691 INFO L82 PathProgramCache]: Analyzing trace with hash -170434367, now seen corresponding path program 10 times [2020-09-04 21:38:31,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:38:31,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1583159315] [2020-09-04 21:38:31,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:38:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:38:31,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:38:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 21:38:32,104 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 21:38:32,199 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 21:38:32,199 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 21:38:32,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 21:38:32,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:38:32 BoogieIcfgContainer [2020-09-04 21:38:32,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:38:32,298 INFO L168 Benchmark]: Toolchain (without parser) took 8962.26 ms. Allocated memory was 137.4 MB in the beginning and 448.8 MB in the end (delta: 311.4 MB). Free memory was 101.3 MB in the beginning and 367.4 MB in the end (delta: -266.1 MB). Peak memory consumption was 327.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:32,301 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 21:38:32,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.22 ms. Allocated memory is still 137.4 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:32,303 INFO L168 Benchmark]: Boogie Preprocessor took 108.56 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.8 MB in the beginning and 179.4 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:32,305 INFO L168 Benchmark]: RCFGBuilder took 328.90 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 165.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:32,306 INFO L168 Benchmark]: TraceAbstraction took 8216.17 ms. Allocated memory was 200.3 MB in the beginning and 448.8 MB in the end (delta: 248.5 MB). Free memory was 165.6 MB in the beginning and 367.4 MB in the end (delta: -201.8 MB). Peak memory consumption was 328.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:38:32,309 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 303.22 ms. Allocated memory is still 137.4 MB. Free memory was 101.1 MB in the beginning and 91.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.56 ms. Allocated memory was 137.4 MB in the beginning and 200.3 MB in the end (delta: 62.9 MB). Free memory was 91.8 MB in the beginning and 179.4 MB in the end (delta: -87.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 328.90 ms. Allocated memory is still 200.3 MB. Free memory was 179.0 MB in the beginning and 165.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8216.17 ms. Allocated memory was 200.3 MB in the beginning and 448.8 MB in the end (delta: 248.5 MB). Free memory was 165.6 MB in the beginning and 367.4 MB in the end (delta: -201.8 MB). Peak memory consumption was 328.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=8, x=8] [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=7, \result=13, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=5, \result=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=3, \result=2, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 VAL [\old(n)=1, n=1] [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 VAL [\old(n)=0, n=0] [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=2, \result=1, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=4, \result=3, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=6, \result=8, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); VAL [\old(n)=8, \result=21, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); VAL [fibonacci(x)=21, result=21, x=8] [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.0s, OverallIterations: 13, TraceHistogramMax: 67, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 370 SDtfs, 631 SDslu, 1058 SDs, 0 SdLazy, 1046 SolverSat, 343 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 503 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=316occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 94 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1478 ConstructedInterpolants, 0 QuantifiedInterpolants, 515326 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 8261/11842 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...