/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 17:20:10,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 17:20:10,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 17:20:10,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 17:20:10,578 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 17:20:10,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 17:20:10,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 17:20:10,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 17:20:10,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 17:20:10,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 17:20:10,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 17:20:10,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 17:20:10,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 17:20:10,606 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 17:20:10,609 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 17:20:10,610 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 17:20:10,611 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 17:20:10,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 17:20:10,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 17:20:10,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 17:20:10,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 17:20:10,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 17:20:10,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 17:20:10,628 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 17:20:10,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 17:20:10,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 17:20:10,631 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 17:20:10,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 17:20:10,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 17:20:10,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 17:20:10,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 17:20:10,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 17:20:10,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 17:20:10,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 17:20:10,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 17:20:10,639 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 17:20:10,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 17:20:10,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 17:20:10,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 17:20:10,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 17:20:10,642 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 17:20:10,643 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 17:20:10,671 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 17:20:10,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 17:20:10,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 17:20:10,677 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 17:20:10,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 17:20:10,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 17:20:10,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 17:20:10,678 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 17:20:10,678 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 17:20:10,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 17:20:10,679 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 17:20:10,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 17:20:10,679 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 17:20:10,679 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 17:20:10,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 17:20:10,680 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 17:20:10,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 17:20:10,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 17:20:10,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:20:10,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 17:20:10,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 17:20:10,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 17:20:10,681 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-17 17:20:10,998 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 17:20:11,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 17:20:11,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 17:20:11,016 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 17:20:11,017 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 17:20:11,017 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-07-17 17:20:11,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6551a476/cc650db400234b24af0d170c1776ead8/FLAGba7db778b [2020-07-17 17:20:11,521 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 17:20:11,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_5-1.c [2020-07-17 17:20:11,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6551a476/cc650db400234b24af0d170c1776ead8/FLAGba7db778b [2020-07-17 17:20:11,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6551a476/cc650db400234b24af0d170c1776ead8 [2020-07-17 17:20:11,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 17:20:11,907 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 17:20:11,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 17:20:11,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 17:20:11,912 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 17:20:11,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:20:11" (1/1) ... [2020-07-17 17:20:11,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f338ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:11, skipping insertion in model container [2020-07-17 17:20:11,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 05:20:11" (1/1) ... [2020-07-17 17:20:11,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 17:20:11,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 17:20:12,106 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:20:12,111 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 17:20:12,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 17:20:12,136 INFO L208 MainTranslator]: Completed translation [2020-07-17 17:20:12,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12 WrapperNode [2020-07-17 17:20:12,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 17:20:12,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 17:20:12,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 17:20:12,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 17:20:12,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... [2020-07-17 17:20:12,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... [2020-07-17 17:20:12,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... [2020-07-17 17:20:12,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... [2020-07-17 17:20:12,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... [2020-07-17 17:20:12,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... [2020-07-17 17:20:12,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... [2020-07-17 17:20:12,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 17:20:12,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 17:20:12,160 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 17:20:12,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 17:20:12,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 17:20:12,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 17:20:12,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 17:20:12,329 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-07-17 17:20:12,329 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 17:20:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 17:20:12,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 17:20:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-07-17 17:20:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 17:20:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 17:20:12,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 17:20:12,521 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 17:20:12,522 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 17:20:12,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:20:12 BoogieIcfgContainer [2020-07-17 17:20:12,526 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 17:20:12,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 17:20:12,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 17:20:12,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 17:20:12,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 05:20:11" (1/3) ... [2020-07-17 17:20:12,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eee0c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:20:12, skipping insertion in model container [2020-07-17 17:20:12,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 05:20:12" (2/3) ... [2020-07-17 17:20:12,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eee0c6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 05:20:12, skipping insertion in model container [2020-07-17 17:20:12,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 05:20:12" (3/3) ... [2020-07-17 17:20:12,539 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_5-1.c [2020-07-17 17:20:12,549 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 17:20:12,555 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 17:20:12,569 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 17:20:12,590 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 17:20:12,591 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 17:20:12,591 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-17 17:20:12,591 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 17:20:12,591 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 17:20:12,591 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 17:20:12,591 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 17:20:12,592 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 17:20:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2020-07-17 17:20:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 17:20:12,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:12,616 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:12,616 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:12,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:12,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1756383024, now seen corresponding path program 1 times [2020-07-17 17:20:12,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:12,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2081842166] [2020-07-17 17:20:12,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:20:12,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2081842166] [2020-07-17 17:20:12,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:20:12,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:20:12,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162207310] [2020-07-17 17:20:12,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:20:12,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:12,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:20:12,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:20:12,858 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2020-07-17 17:20:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:13,074 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2020-07-17 17:20:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:20:13,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-17 17:20:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:13,088 INFO L225 Difference]: With dead ends: 44 [2020-07-17 17:20:13,088 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 17:20:13,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:20:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 17:20:13,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-17 17:20:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 17:20:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-17 17:20:13,141 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2020-07-17 17:20:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:13,141 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-17 17:20:13,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:20:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-17 17:20:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 17:20:13,144 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:13,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:13,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 17:20:13,145 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:13,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:13,146 INFO L82 PathProgramCache]: Analyzing trace with hash -389703589, now seen corresponding path program 1 times [2020-07-17 17:20:13,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:13,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1153824561] [2020-07-17 17:20:13,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 17:20:13,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1153824561] [2020-07-17 17:20:13,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 17:20:13,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 17:20:13,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304690098] [2020-07-17 17:20:13,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 17:20:13,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 17:20:13,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 17:20:13,225 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2020-07-17 17:20:13,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:13,305 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-17 17:20:13,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 17:20:13,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-17 17:20:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:13,308 INFO L225 Difference]: With dead ends: 36 [2020-07-17 17:20:13,308 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:20:13,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:20:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:20:13,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-17 17:20:13,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 17:20:13,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-17 17:20:13,322 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2020-07-17 17:20:13,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:13,322 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-17 17:20:13,322 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 17:20:13,323 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-17 17:20:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 17:20:13,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:13,325 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:13,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 17:20:13,325 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 50309368, now seen corresponding path program 1 times [2020-07-17 17:20:13,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:13,327 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1897501766] [2020-07-17 17:20:13,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-17 17:20:13,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1897501766] [2020-07-17 17:20:13,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:13,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:20:13,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066244233] [2020-07-17 17:20:13,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:20:13,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:13,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:20:13,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:20:13,453 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-07-17 17:20:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:13,557 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2020-07-17 17:20:13,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:20:13,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-17 17:20:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:13,560 INFO L225 Difference]: With dead ends: 52 [2020-07-17 17:20:13,560 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 17:20:13,562 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 17:20:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-17 17:20:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 17:20:13,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-17 17:20:13,575 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 33 [2020-07-17 17:20:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:13,575 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-17 17:20:13,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:20:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-17 17:20:13,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 17:20:13,578 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:13,578 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:13,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 17:20:13,579 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:13,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:13,579 INFO L82 PathProgramCache]: Analyzing trace with hash -643371531, now seen corresponding path program 1 times [2020-07-17 17:20:13,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:13,580 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1790200284] [2020-07-17 17:20:13,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 17:20:13,734 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1790200284] [2020-07-17 17:20:13,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:13,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 17:20:13,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177261442] [2020-07-17 17:20:13,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 17:20:13,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:13,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 17:20:13,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-17 17:20:13,737 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2020-07-17 17:20:13,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:13,873 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2020-07-17 17:20:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 17:20:13,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-17 17:20:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:13,879 INFO L225 Difference]: With dead ends: 56 [2020-07-17 17:20:13,879 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 17:20:13,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:20:13,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 17:20:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-07-17 17:20:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-17 17:20:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-07-17 17:20:13,897 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 34 [2020-07-17 17:20:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:13,897 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-07-17 17:20:13,897 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 17:20:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-07-17 17:20:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-17 17:20:13,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:13,900 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:13,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 17:20:13,901 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:13,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:13,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1274787059, now seen corresponding path program 2 times [2020-07-17 17:20:13,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:13,902 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1200671350] [2020-07-17 17:20:13,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 27 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-17 17:20:14,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1200671350] [2020-07-17 17:20:14,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:14,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 17:20:14,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978783459] [2020-07-17 17:20:14,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 17:20:14,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:14,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 17:20:14,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-17 17:20:14,055 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 8 states. [2020-07-17 17:20:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:14,207 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2020-07-17 17:20:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 17:20:14,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2020-07-17 17:20:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:14,211 INFO L225 Difference]: With dead ends: 111 [2020-07-17 17:20:14,211 INFO L226 Difference]: Without dead ends: 67 [2020-07-17 17:20:14,213 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:20:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-17 17:20:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2020-07-17 17:20:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 17:20:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-07-17 17:20:14,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 51 [2020-07-17 17:20:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:14,230 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-07-17 17:20:14,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 17:20:14,230 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2020-07-17 17:20:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-17 17:20:14,233 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:14,233 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:14,233 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 17:20:14,233 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:14,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash 99184320, now seen corresponding path program 3 times [2020-07-17 17:20:14,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:14,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [847171224] [2020-07-17 17:20:14,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-07-17 17:20:14,378 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [847171224] [2020-07-17 17:20:14,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:14,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 17:20:14,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667525359] [2020-07-17 17:20:14,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 17:20:14,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:14,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 17:20:14,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-17 17:20:14,381 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand 7 states. [2020-07-17 17:20:14,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:14,501 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2020-07-17 17:20:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 17:20:14,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2020-07-17 17:20:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:14,505 INFO L225 Difference]: With dead ends: 89 [2020-07-17 17:20:14,505 INFO L226 Difference]: Without dead ends: 83 [2020-07-17 17:20:14,506 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-17 17:20:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2020-07-17 17:20:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-17 17:20:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2020-07-17 17:20:14,526 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 52 [2020-07-17 17:20:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:14,526 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2020-07-17 17:20:14,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 17:20:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2020-07-17 17:20:14,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-07-17 17:20:14,535 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:14,535 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:14,538 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 17:20:14,539 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:14,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1883941443, now seen corresponding path program 4 times [2020-07-17 17:20:14,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:14,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [807981354] [2020-07-17 17:20:14,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:14,883 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 130 proven. 176 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2020-07-17 17:20:14,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [807981354] [2020-07-17 17:20:14,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:14,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-07-17 17:20:14,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779529738] [2020-07-17 17:20:14,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 17:20:14,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:14,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 17:20:14,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-17 17:20:14,887 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand 11 states. [2020-07-17 17:20:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:15,211 INFO L93 Difference]: Finished difference Result 142 states and 213 transitions. [2020-07-17 17:20:15,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 17:20:15,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2020-07-17 17:20:15,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:15,216 INFO L225 Difference]: With dead ends: 142 [2020-07-17 17:20:15,216 INFO L226 Difference]: Without dead ends: 73 [2020-07-17 17:20:15,218 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2020-07-17 17:20:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-17 17:20:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2020-07-17 17:20:15,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-17 17:20:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2020-07-17 17:20:15,233 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 123 [2020-07-17 17:20:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:15,234 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2020-07-17 17:20:15,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 17:20:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2020-07-17 17:20:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2020-07-17 17:20:15,236 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:15,237 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:15,237 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-17 17:20:15,237 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:15,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:15,238 INFO L82 PathProgramCache]: Analyzing trace with hash 532445701, now seen corresponding path program 5 times [2020-07-17 17:20:15,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:15,238 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1837320118] [2020-07-17 17:20:15,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1318 backedges. 375 proven. 413 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2020-07-17 17:20:15,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1837320118] [2020-07-17 17:20:15,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:15,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-17 17:20:15,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471003193] [2020-07-17 17:20:15,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 17:20:15,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 17:20:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-07-17 17:20:15,918 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 13 states. [2020-07-17 17:20:16,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:16,395 INFO L93 Difference]: Finished difference Result 149 states and 204 transitions. [2020-07-17 17:20:16,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-17 17:20:16,396 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 193 [2020-07-17 17:20:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:16,400 INFO L225 Difference]: With dead ends: 149 [2020-07-17 17:20:16,400 INFO L226 Difference]: Without dead ends: 92 [2020-07-17 17:20:16,402 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2020-07-17 17:20:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-17 17:20:16,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2020-07-17 17:20:16,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 17:20:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2020-07-17 17:20:16,431 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 193 [2020-07-17 17:20:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:16,433 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2020-07-17 17:20:16,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 17:20:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2020-07-17 17:20:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-07-17 17:20:16,440 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:16,443 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:16,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-17 17:20:16,444 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:16,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:16,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1618484333, now seen corresponding path program 6 times [2020-07-17 17:20:16,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:16,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [431174317] [2020-07-17 17:20:16,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2020-07-17 17:20:17,072 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [431174317] [2020-07-17 17:20:17,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:17,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 17:20:17,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354381497] [2020-07-17 17:20:17,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 17:20:17,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:17,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 17:20:17,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:20:17,080 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 16 states. [2020-07-17 17:20:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:17,620 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2020-07-17 17:20:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-17 17:20:17,621 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 140 [2020-07-17 17:20:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:17,623 INFO L225 Difference]: With dead ends: 103 [2020-07-17 17:20:17,624 INFO L226 Difference]: Without dead ends: 97 [2020-07-17 17:20:17,625 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2020-07-17 17:20:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-17 17:20:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2020-07-17 17:20:17,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-17 17:20:17,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2020-07-17 17:20:17,642 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 140 [2020-07-17 17:20:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:17,642 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2020-07-17 17:20:17,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 17:20:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2020-07-17 17:20:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2020-07-17 17:20:17,645 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:17,645 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:17,646 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-17 17:20:17,646 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:17,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1853518064, now seen corresponding path program 7 times [2020-07-17 17:20:17,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:17,647 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1983115426] [2020-07-17 17:20:17,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1062 backedges. 285 proven. 207 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2020-07-17 17:20:17,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1983115426] [2020-07-17 17:20:17,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:17,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 17:20:17,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078583872] [2020-07-17 17:20:17,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 17:20:17,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 17:20:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-17 17:20:17,969 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 10 states. [2020-07-17 17:20:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:18,162 INFO L93 Difference]: Finished difference Result 171 states and 210 transitions. [2020-07-17 17:20:18,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 17:20:18,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 175 [2020-07-17 17:20:18,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:18,164 INFO L225 Difference]: With dead ends: 171 [2020-07-17 17:20:18,164 INFO L226 Difference]: Without dead ends: 88 [2020-07-17 17:20:18,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-07-17 17:20:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-17 17:20:18,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2020-07-17 17:20:18,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-17 17:20:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2020-07-17 17:20:18,179 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 175 [2020-07-17 17:20:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:18,179 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2020-07-17 17:20:18,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 17:20:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2020-07-17 17:20:18,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2020-07-17 17:20:18,183 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 17:20:18,184 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 17:20:18,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-17 17:20:18,184 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 17:20:18,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 17:20:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash 2080077336, now seen corresponding path program 8 times [2020-07-17 17:20:18,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 17:20:18,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1817759752] [2020-07-17 17:20:18,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 17:20:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 17:20:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2955 backedges. 552 proven. 920 refuted. 0 times theorem prover too weak. 1483 trivial. 0 not checked. [2020-07-17 17:20:18,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1817759752] [2020-07-17 17:20:18,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 17:20:18,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-07-17 17:20:18,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797007181] [2020-07-17 17:20:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 17:20:18,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 17:20:18,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 17:20:18,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-07-17 17:20:18,829 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand 15 states. [2020-07-17 17:20:19,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 17:20:19,341 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2020-07-17 17:20:19,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-17 17:20:19,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 281 [2020-07-17 17:20:19,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 17:20:19,342 INFO L225 Difference]: With dead ends: 139 [2020-07-17 17:20:19,343 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 17:20:19,344 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=735, Unknown=0, NotChecked=0, Total=992 [2020-07-17 17:20:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 17:20:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 17:20:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 17:20:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 17:20:19,346 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2020-07-17 17:20:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 17:20:19,346 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 17:20:19,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 17:20:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 17:20:19,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 17:20:19,347 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 17:20:19,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 17:20:20,188 WARN L193 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-07-17 17:20:20,448 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2020-07-17 17:20:20,715 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 53 [2020-07-17 17:20:21,159 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2020-07-17 17:20:21,502 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2020-07-17 17:20:21,836 WARN L193 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2020-07-17 17:20:22,020 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2020-07-17 17:20:22,273 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2020-07-17 17:20:22,354 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:20:22,354 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:20:22,354 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 17:20:22,355 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 17:20:22,355 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 17:20:22,355 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 17:20:22,356 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) the Hoare annotation is: false [2020-07-17 17:20:22,356 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 23 30) the Hoare annotation is: true [2020-07-17 17:20:22,356 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-07-17 17:20:22,356 INFO L264 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-17 17:20:22,356 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= 5 main_~x~0)) [2020-07-17 17:20:22,356 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-17 17:20:22,357 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-07-17 17:20:22,357 INFO L264 CegarLoopResult]: At program point L26-2(lines 26 28) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-17 17:20:22,357 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0)) [2020-07-17 17:20:22,357 INFO L264 CegarLoopResult]: At program point L25-3(line 25) the Hoare annotation is: (and (<= main_~x~0 5) (<= |main_#t~ret2| 5) (<= 5 |main_#t~ret2|) (<= 5 main_~x~0) (< 4 main_~result~0) (<= main_~result~0 5)) [2020-07-17 17:20:22,357 INFO L264 CegarLoopResult]: At program point mainFINAL(lines 23 30) the Hoare annotation is: (<= 5 main_~x~0) [2020-07-17 17:20:22,358 INFO L264 CegarLoopResult]: At program point fiboEXIT(lines 5 13) the Hoare annotation is: (let ((.cse5 (<= 1 |fibo_#in~n|)) (.cse3 (<= |fibo_#in~n| 2)) (.cse0 (= fibo_~n |fibo_#in~n|)) (.cse7 (<= |fibo_#res| 1)) (.cse8 (<= 1 |fibo_#res|))) (let ((.cse6 (<= |fibo_#in~n| 3)) (.cse1 (and .cse3 .cse0 .cse7 (<= 2 |fibo_#in~n|) .cse8)) (.cse2 (and .cse7 .cse8 (<= |fibo_#in~n| 1))) (.cse4 (not .cse5))) (and (or (not (<= |fibo_#in~n| 5)) (and .cse0 (<= fibo_~n 4)) (and (<= 5 |fibo_#res|) (<= |fibo_#res| 5) .cse0)) (or .cse1 .cse2 (not .cse3) .cse4) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) .cse5) (or (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)) .cse6 (not (<= |fibo_#in~n| 4))) (or (not .cse6) (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2)) .cse1 .cse2 .cse4)))) [2020-07-17 17:20:22,358 INFO L264 CegarLoopResult]: At program point fiboFINAL(lines 5 13) the Hoare annotation is: (let ((.cse5 (<= 1 |fibo_#in~n|)) (.cse3 (<= |fibo_#in~n| 2)) (.cse0 (= fibo_~n |fibo_#in~n|)) (.cse7 (<= |fibo_#res| 1)) (.cse8 (<= 1 |fibo_#res|))) (let ((.cse6 (<= |fibo_#in~n| 3)) (.cse1 (and .cse3 .cse0 .cse7 (<= 2 |fibo_#in~n|) .cse8)) (.cse2 (and .cse7 .cse8 (<= |fibo_#in~n| 1))) (.cse4 (not .cse5))) (and (or (not (<= |fibo_#in~n| 5)) (and .cse0 (<= fibo_~n 4)) (and (<= 5 |fibo_#res|) (<= |fibo_#res| 5) .cse0)) (or .cse1 .cse2 (not .cse3) .cse4) (or (and (<= 0 |fibo_#res|) (<= |fibo_#res| 0)) .cse5) (or (and (<= |fibo_#res| 3) (<= 3 |fibo_#res|)) .cse6 (not (<= |fibo_#in~n| 4))) (or (not .cse6) (and (<= 2 |fibo_#res|) (<= |fibo_#res| 2)) .cse1 .cse2 .cse4)))) [2020-07-17 17:20:22,358 INFO L264 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (and (or (not (<= |fibo_#in~n| 5)) (= fibo_~n |fibo_#in~n|)) (not (<= |fibo_#in~n| 1))) [2020-07-17 17:20:22,359 INFO L264 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (not .cse0) (and (<= 1 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 1))) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 3 |fibo_#t~ret0|) .cse1 (<= |fibo_#t~ret0| 3)) (and .cse1 (<= fibo_~n 4)))) (not (<= |fibo_#in~n| 1)) (or (and (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|)) .cse0 (not (<= |fibo_#in~n| 4))))) [2020-07-17 17:20:22,359 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 1))) (and (or (and (= fibo_~n |fibo_#in~n|) (<= 1 |fibo_#in~n|)) (not .cse0)) (or (not (<= |fibo_#in~n| 5)) .cse0))) [2020-07-17 17:20:22,359 INFO L264 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (not .cse0) (and (<= 1 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 1))) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 3 |fibo_#t~ret0|) .cse1 (<= |fibo_#t~ret0| 3)) (and .cse1 (<= fibo_~n 4)))) (not (<= |fibo_#in~n| 1)) (or (and (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|)) .cse0 (not (<= |fibo_#in~n| 4))))) [2020-07-17 17:20:22,359 INFO L264 CegarLoopResult]: At program point L8(lines 8 12) the Hoare annotation is: (and (<= 1 |fibo_#in~n|) (or (not (<= |fibo_#in~n| 5)) (= fibo_~n |fibo_#in~n|))) [2020-07-17 17:20:22,360 INFO L264 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (let ((.cse1 (<= 1 |fibo_#t~ret0|)) (.cse3 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse2 (<= |fibo_#t~ret0| 1)) (.cse6 (<= |fibo_#in~n| 2))) (let ((.cse0 (<= |fibo_#in~n| 3)) (.cse4 (and (<= .cse3 1) .cse1 (<= 1 .cse3) .cse2 .cse6 (<= 2 |fibo_#in~n|)))) (and (or (not .cse0) (and .cse1 .cse2 (<= 2 .cse3) (<= .cse3 2)) .cse4) (or (and (<= 3 .cse3) (<= .cse3 3) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|)) .cse0 (not (<= |fibo_#in~n| 4))) (let ((.cse5 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and .cse5 (<= fibo_~n 4)) (and (<= 5 .cse3) (<= 3 |fibo_#t~ret0|) .cse5 (<= |fibo_#t~ret0| 3) (<= .cse3 5)))) (or .cse4 (not .cse6))))) [2020-07-17 17:20:22,360 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (or (= fibo_~n |fibo_#in~n|) (not (<= |fibo_#in~n| 1))) (or (not (<= |fibo_#in~n| 5)) (<= |fibo_#in~n| 0))) [2020-07-17 17:20:22,360 INFO L264 CegarLoopResult]: At program point L11-4(line 11) the Hoare annotation is: (let ((.cse1 (<= 1 |fibo_#t~ret0|)) (.cse3 (+ |fibo_#t~ret0| |fibo_#t~ret1|)) (.cse2 (<= |fibo_#t~ret0| 1)) (.cse6 (<= |fibo_#in~n| 2))) (let ((.cse0 (<= |fibo_#in~n| 3)) (.cse4 (and (<= .cse3 1) .cse1 (<= 1 .cse3) .cse2 .cse6 (<= 2 |fibo_#in~n|)))) (and (or (not .cse0) (and .cse1 .cse2 (<= 2 .cse3) (<= .cse3 2)) .cse4) (or (and (<= 3 .cse3) (<= .cse3 3) (<= |fibo_#t~ret0| 2) (<= 2 |fibo_#t~ret0|)) .cse0 (not (<= |fibo_#in~n| 4))) (let ((.cse5 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and .cse5 (<= fibo_~n 4)) (and (<= 5 .cse3) (<= 3 |fibo_#t~ret0|) .cse5 (<= |fibo_#t~ret0| 3) (<= .cse3 5)))) (or .cse4 (not .cse6))))) [2020-07-17 17:20:22,360 INFO L264 CegarLoopResult]: At program point L6(lines 6 12) the Hoare annotation is: (or (not (<= |fibo_#in~n| 5)) (= fibo_~n |fibo_#in~n|)) [2020-07-17 17:20:22,361 INFO L264 CegarLoopResult]: At program point L11-5(line 11) the Hoare annotation is: (let ((.cse2 (<= |fibo_#in~n| 3)) (.cse1 (+ |fibo_#t~ret0| |fibo_#t~ret1|))) (and (let ((.cse0 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and .cse0 (<= fibo_~n 4)) (and (<= 5 |fibo_#res|) (<= 5 .cse1) (<= 3 |fibo_#t~ret0|) (<= |fibo_#res| 5) .cse0 (<= |fibo_#t~ret0| 3) (<= .cse1 5)))) (or (and (<= 3 .cse1) (<= .cse1 3) (<= |fibo_#t~ret0| 2) (<= |fibo_#res| 3) (<= 2 |fibo_#t~ret0|) (<= 3 |fibo_#res|)) .cse2 (not (<= |fibo_#in~n| 4))) (let ((.cse3 (<= 1 |fibo_#t~ret0|)) (.cse4 (<= |fibo_#t~ret0| 1))) (or (not .cse2) (and (<= .cse1 1) .cse3 (<= 1 .cse1) .cse4 (<= |fibo_#in~n| 2) (<= |fibo_#res| 1) (<= 2 |fibo_#in~n|) (<= 1 |fibo_#res|)) (and .cse3 (<= 2 |fibo_#res|) .cse4 (<= 2 .cse1) (<= .cse1 2) (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|)))))) [2020-07-17 17:20:22,361 INFO L271 CegarLoopResult]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2020-07-17 17:20:22,361 INFO L264 CegarLoopResult]: At program point L11-6(line 11) the Hoare annotation is: (let ((.cse0 (<= |fibo_#in~n| 3))) (and (or (and (<= |fibo_#t~ret0| 2) (<= |fibo_#res| 3) (<= 2 |fibo_#t~ret0|) (<= 3 |fibo_#res|)) .cse0 (not (<= |fibo_#in~n| 4))) (let ((.cse1 (= fibo_~n |fibo_#in~n|))) (or (not (<= |fibo_#in~n| 5)) (and (<= 5 |fibo_#res|) (<= 3 |fibo_#t~ret0|) (<= |fibo_#res| 5) .cse1 (<= |fibo_#t~ret0| 3)) (and .cse1 (<= fibo_~n 4)))) (let ((.cse2 (<= 1 |fibo_#t~ret0|)) (.cse3 (<= |fibo_#t~ret0| 1))) (or (not .cse0) (and .cse2 (<= 2 |fibo_#res|) .cse3 (<= |fibo_#res| 2) (<= 3 |fibo_#in~n|)) (and .cse2 .cse3 (<= |fibo_#in~n| 2) (<= |fibo_#res| 1) (<= 2 |fibo_#in~n|) (<= 1 |fibo_#res|)))))) [2020-07-17 17:20:22,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 05:20:22 BoogieIcfgContainer [2020-07-17 17:20:22,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 17:20:22,396 INFO L168 Benchmark]: Toolchain (without parser) took 10489.84 ms. Allocated memory was 142.6 MB in the beginning and 391.1 MB in the end (delta: 248.5 MB). Free memory was 104.1 MB in the beginning and 248.0 MB in the end (delta: -143.9 MB). Peak memory consumption was 257.0 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:22,399 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 142.6 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-17 17:20:22,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.84 ms. Allocated memory is still 142.6 MB. Free memory was 103.7 MB in the beginning and 94.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:22,402 INFO L168 Benchmark]: Boogie Preprocessor took 22.27 ms. Allocated memory is still 142.6 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:22,403 INFO L168 Benchmark]: RCFGBuilder took 365.81 ms. Allocated memory was 142.6 MB in the beginning and 203.9 MB in the end (delta: 61.3 MB). Free memory was 92.6 MB in the beginning and 171.3 MB in the end (delta: -78.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:22,408 INFO L168 Benchmark]: TraceAbstraction took 9863.79 ms. Allocated memory was 203.9 MB in the beginning and 391.1 MB in the end (delta: 187.2 MB). Free memory was 170.6 MB in the beginning and 248.0 MB in the end (delta: -77.4 MB). Peak memory consumption was 262.2 MB. Max. memory is 7.1 GB. [2020-07-17 17:20:22,414 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.25 ms. Allocated memory is still 142.6 MB. Free memory was 122.3 MB in the beginning and 122.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 228.84 ms. Allocated memory is still 142.6 MB. Free memory was 103.7 MB in the beginning and 94.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.27 ms. Allocated memory is still 142.6 MB. Free memory was 94.0 MB in the beginning and 92.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 365.81 ms. Allocated memory was 142.6 MB in the beginning and 203.9 MB in the end (delta: 61.3 MB). Free memory was 92.6 MB in the beginning and 171.3 MB in the end (delta: -78.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9863.79 ms. Allocated memory was 203.9 MB in the beginning and 391.1 MB in the end (delta: 187.2 MB). Free memory was 170.6 MB in the beginning and 248.0 MB in the end (delta: -77.4 MB). Peak memory consumption was 262.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 5 <= x - ProcedureContractResult [Line: 5]: Procedure Contract for fibo Derived contract for procedure fibo: (((((!(\old(n) <= 5) || (n == \old(n) && n <= 4)) || ((5 <= \result && \result <= 5) && n == \old(n))) && (((((((\old(n) <= 2 && n == \old(n)) && \result <= 1) && 2 <= \old(n)) && 1 <= \result) || ((\result <= 1 && 1 <= \result) && \old(n) <= 1)) || !(\old(n) <= 2)) || !(1 <= \old(n)))) && ((0 <= \result && \result <= 0) || 1 <= \old(n))) && (((\result <= 3 && 3 <= \result) || \old(n) <= 3) || !(\old(n) <= 4))) && ((((!(\old(n) <= 3) || (2 <= \result && \result <= 2)) || ((((\old(n) <= 2 && n == \old(n)) && \result <= 1) && 2 <= \old(n)) && 1 <= \result)) || ((\result <= 1 && 1 <= \result) && \old(n) <= 1)) || !(1 <= \old(n))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.7s, OverallIterations: 11, TraceHistogramMax: 31, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 348 SDtfs, 527 SDslu, 1454 SDs, 0 SdLazy, 1310 SolverSat, 214 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 463 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 43 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 31 LocationsWithAnnotation, 703 PreInvPairs, 1073 NumberOfFragments, 997 HoareAnnotationTreeSize, 703 FomulaSimplifications, 5774 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 31 FomulaSimplificationsInter, 2547 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1115 NumberOfCodeBlocks, 1115 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1104 ConstructedInterpolants, 0 QuantifiedInterpolants, 381696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 4598/6595 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 correct! Received shutdown request...