java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label07_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-26 21:33:03,669 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 21:33:03,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 21:33:03,685 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 21:33:03,685 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 21:33:03,686 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 21:33:03,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 21:33:03,689 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 21:33:03,691 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 21:33:03,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 21:33:03,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 21:33:03,693 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 21:33:03,694 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 21:33:03,695 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 21:33:03,696 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 21:33:03,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 21:33:03,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 21:33:03,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 21:33:03,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 21:33:03,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 21:33:03,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 21:33:03,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 21:33:03,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 21:33:03,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 21:33:03,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 21:33:03,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 21:33:03,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 21:33:03,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 21:33:03,712 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 21:33:03,713 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 21:33:03,713 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 21:33:03,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 21:33:03,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 21:33:03,714 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 21:33:03,715 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 21:33:03,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 21:33:03,716 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-10-26 21:33:03,732 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 21:33:03,732 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 21:33:03,733 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 21:33:03,733 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 21:33:03,734 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 21:33:03,734 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 21:33:03,734 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 21:33:03,734 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 21:33:03,735 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 21:33:03,735 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 21:33:03,735 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 21:33:03,735 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 21:33:03,735 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 21:33:03,736 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 21:33:03,736 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 21:33:03,736 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 21:33:03,736 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 21:33:03,736 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 21:33:03,737 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 21:33:03,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 21:33:03,737 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 21:33:03,737 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 21:33:03,737 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 21:33:03,738 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 21:33:03,738 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 21:33:03,738 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 21:33:03,738 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 21:33:03,738 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-26 21:33:03,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 21:33:03,811 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 21:33:03,816 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 21:33:03,817 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 21:33:03,818 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 21:33:03,818 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label07_true-unreach-call_false-termination.c [2018-10-26 21:33:03,881 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cbe6b9c6d/c3144e277364418b92932db4650e7b0d/FLAG03b05a709 [2018-10-26 21:33:04,574 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 21:33:04,575 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label07_true-unreach-call_false-termination.c [2018-10-26 21:33:04,605 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cbe6b9c6d/c3144e277364418b92932db4650e7b0d/FLAG03b05a709 [2018-10-26 21:33:04,628 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cbe6b9c6d/c3144e277364418b92932db4650e7b0d [2018-10-26 21:33:04,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 21:33:04,641 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 21:33:04,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 21:33:04,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 21:33:04,647 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 21:33:04,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:33:04" (1/1) ... [2018-10-26 21:33:04,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11290b0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:04, skipping insertion in model container [2018-10-26 21:33:04,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 09:33:04" (1/1) ... [2018-10-26 21:33:04,660 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 21:33:04,746 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 21:33:05,255 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:33:05,260 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 21:33:05,398 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 21:33:05,420 INFO L193 MainTranslator]: Completed translation [2018-10-26 21:33:05,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05 WrapperNode [2018-10-26 21:33:05,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 21:33:05,422 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 21:33:05,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 21:33:05,426 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 21:33:05,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,479 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,692 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 21:33:05,693 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 21:33:05,693 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 21:33:05,693 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 21:33:05,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... [2018-10-26 21:33:05,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 21:33:05,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 21:33:05,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 21:33:05,799 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 21:33:05,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-26 21:33:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-26 21:33:05,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 21:33:05,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 21:33:09,323 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 21:33:09,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:33:09 BoogieIcfgContainer [2018-10-26 21:33:09,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 21:33:09,326 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 21:33:09,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 21:33:09,330 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 21:33:09,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 09:33:04" (1/3) ... [2018-10-26 21:33:09,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f144de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:33:09, skipping insertion in model container [2018-10-26 21:33:09,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 09:33:05" (2/3) ... [2018-10-26 21:33:09,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f144de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 09:33:09, skipping insertion in model container [2018-10-26 21:33:09,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 09:33:09" (3/3) ... [2018-10-26 21:33:09,334 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label07_true-unreach-call_false-termination.c [2018-10-26 21:33:09,344 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 21:33:09,352 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 21:33:09,369 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 21:33:09,406 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 21:33:09,407 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 21:33:09,407 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 21:33:09,407 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 21:33:09,407 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 21:33:09,408 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 21:33:09,408 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 21:33:09,408 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 21:33:09,408 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 21:33:09,430 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states. [2018-10-26 21:33:09,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 21:33:09,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:09,441 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:09,443 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:09,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:09,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1660793902, now seen corresponding path program 1 times [2018-10-26 21:33:09,450 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:09,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:09,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:09,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:09,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:33:09,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:09,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:33:09,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:33:09,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:33:09,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:09,972 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 4 states. [2018-10-26 21:33:13,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:13,413 INFO L93 Difference]: Finished difference Result 870 states and 1578 transitions. [2018-10-26 21:33:13,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:33:13,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-10-26 21:33:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:13,438 INFO L225 Difference]: With dead ends: 870 [2018-10-26 21:33:13,438 INFO L226 Difference]: Without dead ends: 617 [2018-10-26 21:33:13,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-26 21:33:13,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 422. [2018-10-26 21:33:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-26 21:33:13,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 648 transitions. [2018-10-26 21:33:13,520 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 648 transitions. Word has length 48 [2018-10-26 21:33:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:13,521 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 648 transitions. [2018-10-26 21:33:13,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:33:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 648 transitions. [2018-10-26 21:33:13,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-26 21:33:13,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:13,527 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:13,528 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:13,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:13,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1983347323, now seen corresponding path program 1 times [2018-10-26 21:33:13,528 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:13,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:13,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:13,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 21:33:14,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:14,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:33:14,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:33:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:33:14,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:33:14,136 INFO L87 Difference]: Start difference. First operand 422 states and 648 transitions. Second operand 6 states. [2018-10-26 21:33:18,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:18,144 INFO L93 Difference]: Finished difference Result 1918 states and 2928 transitions. [2018-10-26 21:33:18,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 21:33:18,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2018-10-26 21:33:18,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:18,153 INFO L225 Difference]: With dead ends: 1918 [2018-10-26 21:33:18,153 INFO L226 Difference]: Without dead ends: 1498 [2018-10-26 21:33:18,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:33:18,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2018-10-26 21:33:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1138. [2018-10-26 21:33:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-26 21:33:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1555 transitions. [2018-10-26 21:33:18,215 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1555 transitions. Word has length 128 [2018-10-26 21:33:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:18,216 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1555 transitions. [2018-10-26 21:33:18,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:33:18,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1555 transitions. [2018-10-26 21:33:18,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-26 21:33:18,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:18,225 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:18,226 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:18,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:18,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1869261591, now seen corresponding path program 1 times [2018-10-26 21:33:18,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:18,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:18,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:18,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 21:33:18,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:18,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:33:18,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:33:18,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:33:18,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:18,375 INFO L87 Difference]: Start difference. First operand 1138 states and 1555 transitions. Second operand 4 states. [2018-10-26 21:33:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:21,890 INFO L93 Difference]: Finished difference Result 3527 states and 5049 transitions. [2018-10-26 21:33:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:33:21,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-10-26 21:33:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:21,906 INFO L225 Difference]: With dead ends: 3527 [2018-10-26 21:33:21,906 INFO L226 Difference]: Without dead ends: 2391 [2018-10-26 21:33:21,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2018-10-26 21:33:21,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2018-10-26 21:33:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2391 states. [2018-10-26 21:33:21,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3166 transitions. [2018-10-26 21:33:21,963 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3166 transitions. Word has length 224 [2018-10-26 21:33:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:21,963 INFO L481 AbstractCegarLoop]: Abstraction has 2391 states and 3166 transitions. [2018-10-26 21:33:21,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:33:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3166 transitions. [2018-10-26 21:33:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-26 21:33:21,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:21,974 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:21,974 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:21,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:21,975 INFO L82 PathProgramCache]: Analyzing trace with hash 586512812, now seen corresponding path program 1 times [2018-10-26 21:33:21,975 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:21,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:21,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:21,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:22,397 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-26 21:33:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 150 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 21:33:22,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:22,620 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:33:22,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:22,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-10-26 21:33:23,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:33:23,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-26 21:33:23,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 21:33:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 21:33:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-26 21:33:23,058 INFO L87 Difference]: Start difference. First operand 2391 states and 3166 transitions. Second operand 6 states. [2018-10-26 21:33:23,936 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2018-10-26 21:33:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:29,099 INFO L93 Difference]: Finished difference Result 6407 states and 8224 transitions. [2018-10-26 21:33:29,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:33:29,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 238 [2018-10-26 21:33:29,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:29,117 INFO L225 Difference]: With dead ends: 6407 [2018-10-26 21:33:29,117 INFO L226 Difference]: Without dead ends: 3837 [2018-10-26 21:33:29,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:33:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3837 states. [2018-10-26 21:33:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3837 to 2569. [2018-10-26 21:33:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2018-10-26 21:33:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 2998 transitions. [2018-10-26 21:33:29,184 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 2998 transitions. Word has length 238 [2018-10-26 21:33:29,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:29,184 INFO L481 AbstractCegarLoop]: Abstraction has 2569 states and 2998 transitions. [2018-10-26 21:33:29,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 21:33:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 2998 transitions. [2018-10-26 21:33:29,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-26 21:33:29,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:29,192 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:29,192 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:29,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash 613355324, now seen corresponding path program 1 times [2018-10-26 21:33:29,193 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:29,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:29,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:29,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:29,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:29,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-10-26 21:33:29,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:29,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:33:29,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:33:29,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:33:29,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:29,732 INFO L87 Difference]: Start difference. First operand 2569 states and 2998 transitions. Second operand 4 states. [2018-10-26 21:33:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:31,984 INFO L93 Difference]: Finished difference Result 7105 states and 8535 transitions. [2018-10-26 21:33:31,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:33:31,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2018-10-26 21:33:31,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:32,008 INFO L225 Difference]: With dead ends: 7105 [2018-10-26 21:33:32,009 INFO L226 Difference]: Without dead ends: 4717 [2018-10-26 21:33:32,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:32,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4717 states. [2018-10-26 21:33:32,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4717 to 4717. [2018-10-26 21:33:32,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4717 states. [2018-10-26 21:33:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4717 states to 4717 states and 5447 transitions. [2018-10-26 21:33:32,097 INFO L78 Accepts]: Start accepts. Automaton has 4717 states and 5447 transitions. Word has length 331 [2018-10-26 21:33:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:32,098 INFO L481 AbstractCegarLoop]: Abstraction has 4717 states and 5447 transitions. [2018-10-26 21:33:32,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:33:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4717 states and 5447 transitions. [2018-10-26 21:33:32,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-26 21:33:32,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:32,110 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:32,111 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:32,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:32,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1074191665, now seen corresponding path program 1 times [2018-10-26 21:33:32,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:32,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:32,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:32,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:32,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:32,698 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 526 trivial. 0 not checked. [2018-10-26 21:33:32,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:32,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:33:32,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:33:32,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:33:32,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:33:32,702 INFO L87 Difference]: Start difference. First operand 4717 states and 5447 transitions. Second operand 3 states. [2018-10-26 21:33:33,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:33,541 INFO L93 Difference]: Finished difference Result 9969 states and 11609 transitions. [2018-10-26 21:33:33,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:33:33,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 440 [2018-10-26 21:33:33,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:33,569 INFO L225 Difference]: With dead ends: 9969 [2018-10-26 21:33:33,569 INFO L226 Difference]: Without dead ends: 5433 [2018-10-26 21:33:33,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:33:33,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2018-10-26 21:33:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 5254. [2018-10-26 21:33:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5254 states. [2018-10-26 21:33:33,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 6088 transitions. [2018-10-26 21:33:33,662 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 6088 transitions. Word has length 440 [2018-10-26 21:33:33,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:33,663 INFO L481 AbstractCegarLoop]: Abstraction has 5254 states and 6088 transitions. [2018-10-26 21:33:33,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:33:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 6088 transitions. [2018-10-26 21:33:33,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 589 [2018-10-26 21:33:33,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:33,685 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:33,686 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:33,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:33,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1952228200, now seen corresponding path program 1 times [2018-10-26 21:33:33,686 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:33,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:33,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:34,493 WARN L179 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-10-26 21:33:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2018-10-26 21:33:34,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:34,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:33:34,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:33:34,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:33:34,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:33:34,917 INFO L87 Difference]: Start difference. First operand 5254 states and 6088 transitions. Second operand 7 states. [2018-10-26 21:33:36,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:36,862 INFO L93 Difference]: Finished difference Result 10741 states and 12461 transitions. [2018-10-26 21:33:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:33:36,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 588 [2018-10-26 21:33:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:36,879 INFO L225 Difference]: With dead ends: 10741 [2018-10-26 21:33:36,880 INFO L226 Difference]: Without dead ends: 5072 [2018-10-26 21:33:36,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:33:36,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2018-10-26 21:33:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 5072. [2018-10-26 21:33:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5072 states. [2018-10-26 21:33:36,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5072 states to 5072 states and 5793 transitions. [2018-10-26 21:33:36,965 INFO L78 Accepts]: Start accepts. Automaton has 5072 states and 5793 transitions. Word has length 588 [2018-10-26 21:33:36,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:36,966 INFO L481 AbstractCegarLoop]: Abstraction has 5072 states and 5793 transitions. [2018-10-26 21:33:36,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:33:36,966 INFO L276 IsEmpty]: Start isEmpty. Operand 5072 states and 5793 transitions. [2018-10-26 21:33:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2018-10-26 21:33:36,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:36,995 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:36,995 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:36,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:36,996 INFO L82 PathProgramCache]: Analyzing trace with hash 65993565, now seen corresponding path program 1 times [2018-10-26 21:33:36,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 774 proven. 46 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-10-26 21:33:38,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:33:38,006 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:33:38,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:38,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:33:38,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 797 proven. 23 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2018-10-26 21:33:38,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 21:33:38,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-10-26 21:33:38,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 21:33:38,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 21:33:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-10-26 21:33:38,884 INFO L87 Difference]: Start difference. First operand 5072 states and 5793 transitions. Second operand 9 states. [2018-10-26 21:33:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:44,870 INFO L93 Difference]: Finished difference Result 10230 states and 11675 transitions. [2018-10-26 21:33:44,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 21:33:44,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 685 [2018-10-26 21:33:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:44,898 INFO L225 Difference]: With dead ends: 10230 [2018-10-26 21:33:44,899 INFO L226 Difference]: Without dead ends: 5159 [2018-10-26 21:33:44,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 683 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2018-10-26 21:33:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5159 states. [2018-10-26 21:33:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5159 to 4892. [2018-10-26 21:33:45,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4892 states. [2018-10-26 21:33:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4892 states to 4892 states and 5585 transitions. [2018-10-26 21:33:45,052 INFO L78 Accepts]: Start accepts. Automaton has 4892 states and 5585 transitions. Word has length 685 [2018-10-26 21:33:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:45,053 INFO L481 AbstractCegarLoop]: Abstraction has 4892 states and 5585 transitions. [2018-10-26 21:33:45,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 21:33:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 4892 states and 5585 transitions. [2018-10-26 21:33:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 792 [2018-10-26 21:33:45,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:45,068 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:45,069 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:45,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:45,069 INFO L82 PathProgramCache]: Analyzing trace with hash -715870865, now seen corresponding path program 1 times [2018-10-26 21:33:45,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:45,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:45,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:45,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:45,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:45,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:45,610 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-10-26 21:33:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1803 backedges. 1260 proven. 0 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2018-10-26 21:33:45,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:45,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:33:45,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:33:45,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:33:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:45,873 INFO L87 Difference]: Start difference. First operand 4892 states and 5585 transitions. Second operand 4 states. [2018-10-26 21:33:47,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:47,275 INFO L93 Difference]: Finished difference Result 12109 states and 14006 transitions. [2018-10-26 21:33:47,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:33:47,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 791 [2018-10-26 21:33:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:47,290 INFO L225 Difference]: With dead ends: 12109 [2018-10-26 21:33:47,291 INFO L226 Difference]: Without dead ends: 7398 [2018-10-26 21:33:47,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2018-10-26 21:33:47,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 7398. [2018-10-26 21:33:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7398 states. [2018-10-26 21:33:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7398 states to 7398 states and 8235 transitions. [2018-10-26 21:33:47,391 INFO L78 Accepts]: Start accepts. Automaton has 7398 states and 8235 transitions. Word has length 791 [2018-10-26 21:33:47,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:47,392 INFO L481 AbstractCegarLoop]: Abstraction has 7398 states and 8235 transitions. [2018-10-26 21:33:47,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:33:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7398 states and 8235 transitions. [2018-10-26 21:33:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2018-10-26 21:33:47,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:47,413 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:47,413 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:47,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash 899198215, now seen corresponding path program 1 times [2018-10-26 21:33:47,414 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:47,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:47,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:47,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:47,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:48,191 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-10-26 21:33:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 1365 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2018-10-26 21:33:48,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:48,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:33:48,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:33:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:33:48,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:48,849 INFO L87 Difference]: Start difference. First operand 7398 states and 8235 transitions. Second operand 4 states. [2018-10-26 21:33:51,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:51,942 INFO L93 Difference]: Finished difference Result 14615 states and 16288 transitions. [2018-10-26 21:33:51,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:33:51,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 820 [2018-10-26 21:33:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:51,960 INFO L225 Difference]: With dead ends: 14615 [2018-10-26 21:33:51,960 INFO L226 Difference]: Without dead ends: 7398 [2018-10-26 21:33:51,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:33:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7398 states. [2018-10-26 21:33:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7398 to 7219. [2018-10-26 21:33:52,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7219 states. [2018-10-26 21:33:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7219 states to 7219 states and 7865 transitions. [2018-10-26 21:33:52,050 INFO L78 Accepts]: Start accepts. Automaton has 7219 states and 7865 transitions. Word has length 820 [2018-10-26 21:33:52,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:52,051 INFO L481 AbstractCegarLoop]: Abstraction has 7219 states and 7865 transitions. [2018-10-26 21:33:52,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:33:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7219 states and 7865 transitions. [2018-10-26 21:33:52,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2018-10-26 21:33:52,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:52,071 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:52,071 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:52,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1439729184, now seen corresponding path program 1 times [2018-10-26 21:33:52,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:52,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:52,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:52,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:52,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2254 backedges. 1499 proven. 0 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2018-10-26 21:33:52,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:52,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:33:52,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:33:52,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:33:52,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:33:52,656 INFO L87 Difference]: Start difference. First operand 7219 states and 7865 transitions. Second operand 3 states. [2018-10-26 21:33:53,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:53,418 INFO L93 Difference]: Finished difference Result 16405 states and 17889 transitions. [2018-10-26 21:33:53,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:33:53,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 848 [2018-10-26 21:33:53,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:53,438 INFO L225 Difference]: With dead ends: 16405 [2018-10-26 21:33:53,439 INFO L226 Difference]: Without dead ends: 9367 [2018-10-26 21:33:53,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:33:53,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9367 states. [2018-10-26 21:33:53,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9367 to 9188. [2018-10-26 21:33:53,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9188 states. [2018-10-26 21:33:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9188 states to 9188 states and 9936 transitions. [2018-10-26 21:33:53,560 INFO L78 Accepts]: Start accepts. Automaton has 9188 states and 9936 transitions. Word has length 848 [2018-10-26 21:33:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:53,561 INFO L481 AbstractCegarLoop]: Abstraction has 9188 states and 9936 transitions. [2018-10-26 21:33:53,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:33:53,561 INFO L276 IsEmpty]: Start isEmpty. Operand 9188 states and 9936 transitions. [2018-10-26 21:33:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1101 [2018-10-26 21:33:53,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:53,584 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:53,584 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:53,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:53,585 INFO L82 PathProgramCache]: Analyzing trace with hash -987237664, now seen corresponding path program 1 times [2018-10-26 21:33:53,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:53,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:53,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:53,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:33:55,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 2395 proven. 0 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2018-10-26 21:33:55,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:33:55,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 21:33:55,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 21:33:55,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 21:33:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:33:55,130 INFO L87 Difference]: Start difference. First operand 9188 states and 9936 transitions. Second operand 5 states. [2018-10-26 21:33:57,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:33:57,320 INFO L93 Difference]: Finished difference Result 20356 states and 22043 transitions. [2018-10-26 21:33:57,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 21:33:57,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1100 [2018-10-26 21:33:57,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:33:57,335 INFO L225 Difference]: With dead ends: 20356 [2018-10-26 21:33:57,336 INFO L226 Difference]: Without dead ends: 11349 [2018-10-26 21:33:57,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-26 21:33:57,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11349 states. [2018-10-26 21:33:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11349 to 9905. [2018-10-26 21:33:57,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9905 states. [2018-10-26 21:33:57,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9905 states to 9905 states and 10715 transitions. [2018-10-26 21:33:57,462 INFO L78 Accepts]: Start accepts. Automaton has 9905 states and 10715 transitions. Word has length 1100 [2018-10-26 21:33:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:33:57,463 INFO L481 AbstractCegarLoop]: Abstraction has 9905 states and 10715 transitions. [2018-10-26 21:33:57,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 21:33:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 9905 states and 10715 transitions. [2018-10-26 21:33:57,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1446 [2018-10-26 21:33:57,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:33:57,496 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:33:57,496 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:33:57,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:33:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash 123095321, now seen corresponding path program 1 times [2018-10-26 21:33:57,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:33:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:33:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:57,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:33:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:33:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6263 backedges. 3790 proven. 0 refuted. 0 times theorem prover too weak. 2473 trivial. 0 not checked. [2018-10-26 21:34:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:00,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 21:34:00,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:34:00,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:34:00,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:34:00,042 INFO L87 Difference]: Start difference. First operand 9905 states and 10715 transitions. Second operand 8 states. [2018-10-26 21:34:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:04,194 INFO L93 Difference]: Finished difference Result 19570 states and 21156 transitions. [2018-10-26 21:34:04,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 21:34:04,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1445 [2018-10-26 21:34:04,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:04,208 INFO L225 Difference]: With dead ends: 19570 [2018-10-26 21:34:04,208 INFO L226 Difference]: Without dead ends: 9846 [2018-10-26 21:34:04,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-10-26 21:34:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9846 states. [2018-10-26 21:34:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9846 to 9543. [2018-10-26 21:34:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9543 states. [2018-10-26 21:34:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9543 states to 9543 states and 10211 transitions. [2018-10-26 21:34:04,334 INFO L78 Accepts]: Start accepts. Automaton has 9543 states and 10211 transitions. Word has length 1445 [2018-10-26 21:34:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:04,335 INFO L481 AbstractCegarLoop]: Abstraction has 9543 states and 10211 transitions. [2018-10-26 21:34:04,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:34:04,335 INFO L276 IsEmpty]: Start isEmpty. Operand 9543 states and 10211 transitions. [2018-10-26 21:34:04,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1740 [2018-10-26 21:34:04,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:04,370 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:04,371 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:04,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:04,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1933271993, now seen corresponding path program 1 times [2018-10-26 21:34:04,372 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:34:04,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:34:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:04,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:04,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:05,891 WARN L179 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-10-26 21:34:06,104 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 12 [2018-10-26 21:34:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9027 backedges. 3059 proven. 0 refuted. 0 times theorem prover too weak. 5968 trivial. 0 not checked. [2018-10-26 21:34:08,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:08,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 21:34:08,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 21:34:08,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 21:34:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:34:08,106 INFO L87 Difference]: Start difference. First operand 9543 states and 10211 transitions. Second operand 7 states. [2018-10-26 21:34:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:10,981 INFO L93 Difference]: Finished difference Result 19723 states and 21104 transitions. [2018-10-26 21:34:10,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 21:34:10,982 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1739 [2018-10-26 21:34:10,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:10,993 INFO L225 Difference]: With dead ends: 19723 [2018-10-26 21:34:10,993 INFO L226 Difference]: Without dead ends: 9539 [2018-10-26 21:34:11,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-26 21:34:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9539 states. [2018-10-26 21:34:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9539 to 9539. [2018-10-26 21:34:11,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9539 states. [2018-10-26 21:34:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9539 states to 9539 states and 10186 transitions. [2018-10-26 21:34:11,087 INFO L78 Accepts]: Start accepts. Automaton has 9539 states and 10186 transitions. Word has length 1739 [2018-10-26 21:34:11,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:11,088 INFO L481 AbstractCegarLoop]: Abstraction has 9539 states and 10186 transitions. [2018-10-26 21:34:11,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 21:34:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 9539 states and 10186 transitions. [2018-10-26 21:34:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1776 [2018-10-26 21:34:11,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:11,113 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 9, 9, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:34:11,114 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:11,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:11,114 INFO L82 PathProgramCache]: Analyzing trace with hash 963727222, now seen corresponding path program 1 times [2018-10-26 21:34:11,114 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:34:11,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:34:11,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:11,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:11,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:12,297 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-26 21:34:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10066 backedges. 3208 proven. 0 refuted. 0 times theorem prover too weak. 6858 trivial. 0 not checked. [2018-10-26 21:34:14,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:14,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:34:14,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:34:14,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:34:14,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:34:14,159 INFO L87 Difference]: Start difference. First operand 9539 states and 10186 transitions. Second operand 4 states. [2018-10-26 21:34:15,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:15,521 INFO L93 Difference]: Finished difference Result 18897 states and 20190 transitions. [2018-10-26 21:34:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:34:15,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1775 [2018-10-26 21:34:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:15,530 INFO L225 Difference]: With dead ends: 18897 [2018-10-26 21:34:15,530 INFO L226 Difference]: Without dead ends: 9359 [2018-10-26 21:34:15,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:34:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9359 states. [2018-10-26 21:34:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9359 to 9359. [2018-10-26 21:34:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9359 states. [2018-10-26 21:34:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9359 states to 9359 states and 9981 transitions. [2018-10-26 21:34:15,619 INFO L78 Accepts]: Start accepts. Automaton has 9359 states and 9981 transitions. Word has length 1775 [2018-10-26 21:34:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:15,620 INFO L481 AbstractCegarLoop]: Abstraction has 9359 states and 9981 transitions. [2018-10-26 21:34:15,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:34:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 9359 states and 9981 transitions. [2018-10-26 21:34:15,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1799 [2018-10-26 21:34:15,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:15,648 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:34:15,648 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:15,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:15,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1390564882, now seen corresponding path program 1 times [2018-10-26 21:34:15,649 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:34:15,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:34:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:15,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:15,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:17,077 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-10-26 21:34:17,327 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-10-26 21:34:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10236 backedges. 7044 proven. 35 refuted. 0 times theorem prover too weak. 3157 trivial. 0 not checked. [2018-10-26 21:34:19,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 21:34:19,096 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 21:34:19,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:19,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 21:34:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10236 backedges. 3348 proven. 0 refuted. 0 times theorem prover too weak. 6888 trivial. 0 not checked. [2018-10-26 21:34:21,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 21:34:21,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2018-10-26 21:34:21,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 21:34:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 21:34:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-26 21:34:21,962 INFO L87 Difference]: Start difference. First operand 9359 states and 9981 transitions. Second operand 8 states. [2018-10-26 21:34:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:25,182 INFO L93 Difference]: Finished difference Result 18716 states and 19962 transitions. [2018-10-26 21:34:25,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 21:34:25,182 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 1798 [2018-10-26 21:34:25,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:25,191 INFO L225 Difference]: With dead ends: 18716 [2018-10-26 21:34:25,191 INFO L226 Difference]: Without dead ends: 9538 [2018-10-26 21:34:25,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1819 GetRequests, 1804 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-26 21:34:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9538 states. [2018-10-26 21:34:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9538 to 9359. [2018-10-26 21:34:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9359 states. [2018-10-26 21:34:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9359 states to 9359 states and 9897 transitions. [2018-10-26 21:34:25,278 INFO L78 Accepts]: Start accepts. Automaton has 9359 states and 9897 transitions. Word has length 1798 [2018-10-26 21:34:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:25,279 INFO L481 AbstractCegarLoop]: Abstraction has 9359 states and 9897 transitions. [2018-10-26 21:34:25,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 21:34:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 9359 states and 9897 transitions. [2018-10-26 21:34:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1816 [2018-10-26 21:34:25,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:25,299 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 21:34:25,299 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:25,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:25,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1216762575, now seen corresponding path program 1 times [2018-10-26 21:34:25,300 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:34:25,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:34:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:25,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10051 backedges. 4251 proven. 0 refuted. 0 times theorem prover too weak. 5800 trivial. 0 not checked. [2018-10-26 21:34:27,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:27,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 21:34:27,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 21:34:27,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 21:34:27,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:34:27,635 INFO L87 Difference]: Start difference. First operand 9359 states and 9897 transitions. Second operand 4 states. [2018-10-26 21:34:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:28,749 INFO L93 Difference]: Finished difference Result 21401 states and 22686 transitions. [2018-10-26 21:34:28,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 21:34:28,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1815 [2018-10-26 21:34:28,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:28,754 INFO L225 Difference]: With dead ends: 21401 [2018-10-26 21:34:28,754 INFO L226 Difference]: Without dead ends: 5203 [2018-10-26 21:34:28,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 21:34:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5203 states. [2018-10-26 21:34:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5203 to 5203. [2018-10-26 21:34:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5203 states. [2018-10-26 21:34:28,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 5341 transitions. [2018-10-26 21:34:28,812 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 5341 transitions. Word has length 1815 [2018-10-26 21:34:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:28,813 INFO L481 AbstractCegarLoop]: Abstraction has 5203 states and 5341 transitions. [2018-10-26 21:34:28,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 21:34:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 5341 transitions. [2018-10-26 21:34:28,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1888 [2018-10-26 21:34:28,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 21:34:28,839 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-26 21:34:28,839 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 21:34:28,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 21:34:28,840 INFO L82 PathProgramCache]: Analyzing trace with hash -151180586, now seen corresponding path program 1 times [2018-10-26 21:34:28,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 21:34:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 21:34:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 21:34:28,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 21:34:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 21:34:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 11432 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 10743 trivial. 0 not checked. [2018-10-26 21:34:31,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 21:34:31,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 21:34:31,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 21:34:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 21:34:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:34:31,092 INFO L87 Difference]: Start difference. First operand 5203 states and 5341 transitions. Second operand 3 states. [2018-10-26 21:34:31,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 21:34:31,814 INFO L93 Difference]: Finished difference Result 10223 states and 10499 transitions. [2018-10-26 21:34:31,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 21:34:31,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1887 [2018-10-26 21:34:31,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 21:34:31,816 INFO L225 Difference]: With dead ends: 10223 [2018-10-26 21:34:31,816 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 21:34:31,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 21:34:31,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 21:34:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 21:34:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 21:34:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 21:34:31,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1887 [2018-10-26 21:34:31,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 21:34:31,822 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 21:34:31,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 21:34:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 21:34:31,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 21:34:31,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 21:34:31,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:31,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:31,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:31,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:31,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,162 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,203 WARN L179 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 206 [2018-10-26 21:34:32,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,332 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,390 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,524 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,540 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 21:34:32,554 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 206 [2018-10-26 21:34:34,330 WARN L179 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 173 DAG size of output: 55 [2018-10-26 21:34:35,106 WARN L179 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 55 [2018-10-26 21:34:35,109 INFO L425 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2018-10-26 21:34:35,109 INFO L425 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2018-10-26 21:34:35,109 INFO L425 ceAbstractionStarter]: For program point L168(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,109 INFO L425 ceAbstractionStarter]: For program point L102(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L36(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L171(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L105(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L39(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,110 INFO L425 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L174(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L108(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L42(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-10-26 21:34:35,111 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L177(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L111(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L45(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2018-10-26 21:34:35,112 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L180(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L114(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L48(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,113 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2018-10-26 21:34:35,114 INFO L425 ceAbstractionStarter]: For program point L183(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L117(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L51(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2018-10-26 21:34:35,115 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L186(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L120(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L54(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2018-10-26 21:34:35,116 INFO L425 ceAbstractionStarter]: For program point L189(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L123(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L57(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2018-10-26 21:34:35,117 INFO L425 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L192(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L126(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L60(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2018-10-26 21:34:35,118 INFO L425 ceAbstractionStarter]: For program point L195(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L129(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L63(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L198(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L132(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L66(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,119 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L201(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L135(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L69(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-10-26 21:34:35,120 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L138(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L72(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2018-10-26 21:34:35,121 INFO L425 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L141(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L75(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-10-26 21:34:35,122 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2018-10-26 21:34:35,123 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2018-10-26 21:34:35,123 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2018-10-26 21:34:35,123 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,123 INFO L425 ceAbstractionStarter]: For program point L78(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L421 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse11 (= ~a21~0 6)) (.cse9 (= ~a15~0 8))) (let ((.cse8 (<= 12 ~a12~0)) (.cse12 (<= ~a12~0 73282)) (.cse1 (= ~a21~0 10)) (.cse10 (<= (+ ~a12~0 43) 0)) (.cse5 (not .cse9)) (.cse7 (<= ~a12~0 80)) (.cse13 (not (= 9 ~a21~0))) (.cse3 (not .cse11)) (.cse6 (<= ~a15~0 8)) (.cse2 (= ~a15~0 9)) (.cse0 (= ~a24~0 1)) (.cse4 (= ~a15~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 (not .cse4) .cse0 .cse5 .cse6) (and .cse0 (= ~a15~0 6)) (and .cse7 .cse8 .cse3 .cse0 .cse6) (and .cse9 .cse0 .cse1) (and .cse0 .cse10 .cse6) (and .cse8 .cse0 .cse2) (and .cse11 .cse8 .cse9 .cse0) (and .cse12 .cse3 .cse13 .cse9 .cse0) (and .cse12 .cse0 .cse1 .cse6) (and .cse3 .cse9 .cse0 (<= ~a12~0 11)) (and .cse11 .cse10 .cse5 .cse6) (and .cse7 .cse13 .cse3 .cse0 .cse6) (and (= ~a15~0 7) .cse0) (and .cse0 (= ~a21~0 8) .cse2) (and .cse11 .cse0 .cse4)))) [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2018-10-26 21:34:35,124 INFO L425 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L147(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L81(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L428 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2018-10-26 21:34:35,125 INFO L425 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L150(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L84(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2018-10-26 21:34:35,126 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2018-10-26 21:34:35,127 INFO L425 ceAbstractionStarter]: For program point L153(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,127 INFO L425 ceAbstractionStarter]: For program point L87(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,127 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-10-26 21:34:35,127 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,127 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 889) no Hoare annotation was computed. [2018-10-26 21:34:35,127 INFO L425 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L421 ceAbstractionStarter]: At program point L880-3(lines 880 889) the Hoare annotation is: (let ((.cse11 (= ~a21~0 6)) (.cse9 (= ~a15~0 8))) (let ((.cse8 (<= 12 ~a12~0)) (.cse12 (<= ~a12~0 73282)) (.cse1 (= ~a21~0 10)) (.cse10 (<= (+ ~a12~0 43) 0)) (.cse5 (not .cse9)) (.cse7 (<= ~a12~0 80)) (.cse13 (not (= 9 ~a21~0))) (.cse3 (not .cse11)) (.cse6 (<= ~a15~0 8)) (.cse2 (= ~a15~0 9)) (.cse0 (= ~a24~0 1)) (.cse4 (= ~a15~0 5))) (or (and .cse0 .cse1 .cse2) (and .cse3 (not .cse4) .cse0 .cse5 .cse6) (and .cse0 (= ~a15~0 6)) (and .cse7 .cse8 .cse3 .cse0 .cse6) (and .cse9 .cse0 .cse1) (and .cse0 .cse10 .cse6) (and .cse8 .cse0 .cse2) (and .cse11 .cse8 .cse9 .cse0) (and .cse12 .cse3 .cse13 .cse9 .cse0) (and .cse12 .cse0 .cse1 .cse6) (and .cse3 .cse9 .cse0 (<= ~a12~0 11)) (and .cse11 .cse10 .cse5 .cse6) (and .cse7 .cse13 .cse3 .cse0 .cse6) (and (= ~a15~0 7) .cse0) (and .cse0 (= ~a21~0 8) .cse2) (and .cse11 .cse0 .cse4)))) [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2018-10-26 21:34:35,128 INFO L425 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L156(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L90(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L24(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2018-10-26 21:34:35,129 INFO L425 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L159(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L93(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L27(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-10-26 21:34:35,130 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L162(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L96(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L30(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-10-26 21:34:35,131 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L165(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L99(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L33(lines 20 872) no Hoare annotation was computed. [2018-10-26 21:34:35,132 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2018-10-26 21:34:35,133 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-10-26 21:34:35,133 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-10-26 21:34:35,133 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-10-26 21:34:35,133 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2018-10-26 21:34:35,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 09:34:35 BoogieIcfgContainer [2018-10-26 21:34:35,159 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 21:34:35,160 INFO L168 Benchmark]: Toolchain (without parser) took 90519.77 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.5 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2018-10-26 21:34:35,161 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-26 21:34:35,162 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. [2018-10-26 21:34:35,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 270.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2018-10-26 21:34:35,163 INFO L168 Benchmark]: Boogie Preprocessor took 105.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2018-10-26 21:34:35,164 INFO L168 Benchmark]: RCFGBuilder took 3526.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. [2018-10-26 21:34:35,165 INFO L168 Benchmark]: TraceAbstraction took 85832.77 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-10-26 21:34:35,170 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.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 270.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 744.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -842.9 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.62 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3526.19 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 118.2 MB). Peak memory consumption was 118.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85832.77 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.1 GB in the beginning and 3.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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 - InvariantResult [Line: 880]: Loop Invariant Derived loop invariant: ((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) || ((((!(a21 == 6) && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (a24 == 1 && a15 == 6)) || ((((a12 <= 80 && 12 <= a12) && !(a21 == 6)) && a24 == 1) && a15 <= 8)) || ((a15 == 8 && a24 == 1) && a21 == 10)) || ((a24 == 1 && a12 + 43 <= 0) && a15 <= 8)) || ((12 <= a12 && a24 == 1) && a15 == 9)) || (((a21 == 6 && 12 <= a12) && a15 == 8) && a24 == 1)) || ((((a12 <= 73282 && !(a21 == 6)) && !(9 == a21)) && a15 == 8) && a24 == 1)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 <= 8)) || (((!(a21 == 6) && a15 == 8) && a24 == 1) && a12 <= 11)) || (((a21 == 6 && a12 + 43 <= 0) && !(a15 == 8)) && a15 <= 8)) || ((((a12 <= 80 && !(9 == a21)) && !(a21 == 6)) && a24 == 1) && a15 <= 8)) || (a15 == 7 && a24 == 1)) || ((a24 == 1 && a21 == 8) && a15 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((((((((((((a24 == 1 && a21 == 10) && a15 == 9) || ((((!(a21 == 6) && !(a15 == 5)) && a24 == 1) && !(a15 == 8)) && a15 <= 8)) || (a24 == 1 && a15 == 6)) || ((((a12 <= 80 && 12 <= a12) && !(a21 == 6)) && a24 == 1) && a15 <= 8)) || ((a15 == 8 && a24 == 1) && a21 == 10)) || ((a24 == 1 && a12 + 43 <= 0) && a15 <= 8)) || ((12 <= a12 && a24 == 1) && a15 == 9)) || (((a21 == 6 && 12 <= a12) && a15 == 8) && a24 == 1)) || ((((a12 <= 73282 && !(a21 == 6)) && !(9 == a21)) && a15 == 8) && a24 == 1)) || (((a12 <= 73282 && a24 == 1) && a21 == 10) && a15 <= 8)) || (((!(a21 == 6) && a15 == 8) && a24 == 1) && a12 <= 11)) || (((a21 == 6 && a12 + 43 <= 0) && !(a15 == 8)) && a15 <= 8)) || ((((a12 <= 80 && !(9 == a21)) && !(a21 == 6)) && a24 == 1) && a15 <= 8)) || (a15 == 7 && a24 == 1)) || ((a24 == 1 && a21 == 8) && a15 == 9)) || ((a21 == 6 && a24 == 1) && a15 == 5) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 246 locations, 1 error locations. SAFE Result, 85.7s OverallTime, 18 OverallIterations, 16 TraceHistogramMax, 49.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 2250 SDtfs, 9916 SDslu, 1954 SDs, 0 SdLazy, 23959 SolverSat, 2921 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 41.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2842 GetRequests, 2749 SyntacticMatches, 19 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9905occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 4553 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 166 NumberOfFragments, 411 HoareAnnotationTreeSize, 3 FomulaSimplifications, 44626 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 3 FomulaSimplificationsInter, 7490 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 19421 NumberOfCodeBlocks, 19421 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 19400 ConstructedInterpolants, 0 QuantifiedInterpolants, 62887070 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3311 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 82164/82273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...