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/Problem01_label02_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:48:44,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:48:44,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:48:44,727 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:48:44,728 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:48:44,729 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:48:44,730 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:48:44,732 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:48:44,734 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:48:44,735 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:48:44,736 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:48:44,736 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:48:44,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:48:44,742 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:48:44,748 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:48:44,749 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:48:44,750 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:48:44,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:48:44,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:48:44,762 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:48:44,765 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:48:44,768 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:48:44,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:48:44,771 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:48:44,773 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:48:44,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:48:44,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:48:44,776 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:48:44,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:48:44,782 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:48:44,782 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:48:44,783 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:48:44,783 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:48:44,783 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:48:44,785 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:48:44,785 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:48:44,786 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-24 14:48:44,813 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:48:44,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:48:44,814 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:48:44,815 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:48:44,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:48:44,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:48:44,816 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:48:44,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:48:44,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:48:44,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:48:44,817 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:48:44,817 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:48:44,817 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:48:44,817 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:48:44,818 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:48:44,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:48:44,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:48:44,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:48:44,819 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:48:44,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:48:44,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:48:44,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:48:44,821 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:48:44,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:48:44,822 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:48:44,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:48:44,822 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:48:44,822 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:48:44,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:48:44,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:48:44,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:48:44,895 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:48:44,896 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:48:44,896 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label02_true-unreach-call_false-termination.c [2018-10-24 14:48:44,961 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0605834ef/5c77078b9a104d9d90918520cffcb1b8/FLAG62f25d7e2 [2018-10-24 14:48:45,551 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:48:45,552 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label02_true-unreach-call_false-termination.c [2018-10-24 14:48:45,569 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0605834ef/5c77078b9a104d9d90918520cffcb1b8/FLAG62f25d7e2 [2018-10-24 14:48:45,585 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/0605834ef/5c77078b9a104d9d90918520cffcb1b8 [2018-10-24 14:48:45,600 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:48:45,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:48:45,605 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:48:45,605 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:48:45,611 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:48:45,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:48:45" (1/1) ... [2018-10-24 14:48:45,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7203e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:45, skipping insertion in model container [2018-10-24 14:48:45,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:48:45" (1/1) ... [2018-10-24 14:48:45,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:48:45,703 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:48:46,145 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:48:46,157 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:48:46,286 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:48:46,302 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:48:46,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46 WrapperNode [2018-10-24 14:48:46,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:48:46,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:48:46,304 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:48:46,304 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:48:46,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:48:46,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:48:46,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:48:46,506 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:48:46,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,579 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,587 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (1/1) ... [2018-10-24 14:48:46,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:48:46,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:48:46,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:48:46,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:48:46,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (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-24 14:48:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:48:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:48:46,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:48:49,849 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:48:49,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:48:49 BoogieIcfgContainer [2018-10-24 14:48:49,850 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:48:49,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:48:49,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:48:49,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:48:49,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:48:45" (1/3) ... [2018-10-24 14:48:49,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32066c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:48:49, skipping insertion in model container [2018-10-24 14:48:49,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:48:46" (2/3) ... [2018-10-24 14:48:49,862 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32066c95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:48:49, skipping insertion in model container [2018-10-24 14:48:49,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:48:49" (3/3) ... [2018-10-24 14:48:49,865 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label02_true-unreach-call_false-termination.c [2018-10-24 14:48:49,876 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:48:49,887 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:48:49,904 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:48:49,939 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:48:49,940 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:48:49,940 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:48:49,940 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:48:49,940 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:48:49,940 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:48:49,941 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:48:49,941 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:48:49,941 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:48:49,963 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:48:49,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-24 14:48:49,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:48:49,975 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, 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-24 14:48:49,977 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:48:49,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:48:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash 358784151, now seen corresponding path program 1 times [2018-10-24 14:48:49,984 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:48:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:48:50,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:50,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:48:50,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:48:50,634 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-24 14:48:50,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:48:50,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:48:50,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:48:50,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:48:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:48:50,665 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:48:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:48:53,549 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-10-24 14:48:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:48:53,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-10-24 14:48:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:48:53,575 INFO L225 Difference]: With dead ends: 666 [2018-10-24 14:48:53,575 INFO L226 Difference]: Without dead ends: 460 [2018-10-24 14:48:53,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:48:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-24 14:48:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-10-24 14:48:53,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-24 14:48:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 732 transitions. [2018-10-24 14:48:53,653 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 732 transitions. Word has length 91 [2018-10-24 14:48:53,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:48:53,654 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 732 transitions. [2018-10-24 14:48:53,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:48:53,654 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 732 transitions. [2018-10-24 14:48:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 14:48:53,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:48:53,660 INFO L375 BasicCegarLoop]: trace histogram [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, 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-24 14:48:53,661 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:48:53,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:48:53,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1270960612, now seen corresponding path program 1 times [2018-10-24 14:48:53,661 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:48:53,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:48:53,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:53,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:48:53,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:48:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:48:53,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:48:53,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:48:53,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:48:53,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:48:53,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:48:53,769 INFO L87 Difference]: Start difference. First operand 460 states and 732 transitions. Second operand 4 states. [2018-10-24 14:48:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:48:55,177 INFO L93 Difference]: Finished difference Result 1710 states and 2800 transitions. [2018-10-24 14:48:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:48:55,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-10-24 14:48:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:48:55,187 INFO L225 Difference]: With dead ends: 1710 [2018-10-24 14:48:55,188 INFO L226 Difference]: Without dead ends: 1252 [2018-10-24 14:48:55,191 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-24 14:48:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-24 14:48:55,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2018-10-24 14:48:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-24 14:48:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1863 transitions. [2018-10-24 14:48:55,256 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1863 transitions. Word has length 98 [2018-10-24 14:48:55,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:48:55,257 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1863 transitions. [2018-10-24 14:48:55,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:48:55,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1863 transitions. [2018-10-24 14:48:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-24 14:48:55,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:48:55,266 INFO L375 BasicCegarLoop]: trace histogram [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, 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-24 14:48:55,266 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:48:55,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:48:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1528267645, now seen corresponding path program 1 times [2018-10-24 14:48:55,267 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:48:55,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:48:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:55,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:48:55,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:48:55,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:48:55,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:48:55,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:48:55,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:48:55,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:48:55,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:48:55,432 INFO L87 Difference]: Start difference. First operand 1252 states and 1863 transitions. Second operand 3 states. [2018-10-24 14:48:59,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:48:59,714 INFO L93 Difference]: Finished difference Result 3690 states and 5524 transitions. [2018-10-24 14:48:59,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:48:59,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-10-24 14:48:59,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:48:59,731 INFO L225 Difference]: With dead ends: 3690 [2018-10-24 14:48:59,731 INFO L226 Difference]: Without dead ends: 2440 [2018-10-24 14:48:59,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 14:48:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2018-10-24 14:48:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2440. [2018-10-24 14:48:59,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2440 states. [2018-10-24 14:48:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3429 transitions. [2018-10-24 14:48:59,791 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3429 transitions. Word has length 99 [2018-10-24 14:48:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:48:59,793 INFO L481 AbstractCegarLoop]: Abstraction has 2440 states and 3429 transitions. [2018-10-24 14:48:59,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:48:59,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3429 transitions. [2018-10-24 14:48:59,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-24 14:48:59,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:48:59,809 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 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-24 14:48:59,809 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:48:59,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:48:59,810 INFO L82 PathProgramCache]: Analyzing trace with hash -678996595, now seen corresponding path program 1 times [2018-10-24 14:48:59,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:48:59,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:48:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:59,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:48:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:48:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:48:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:48:59,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:48:59,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:48:59,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:48:59,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:48:59,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:48:59,935 INFO L87 Difference]: Start difference. First operand 2440 states and 3429 transitions. Second operand 3 states. [2018-10-24 14:49:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:00,886 INFO L93 Difference]: Finished difference Result 5406 states and 7715 transitions. [2018-10-24 14:49:00,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:00,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2018-10-24 14:49:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:00,901 INFO L225 Difference]: With dead ends: 5406 [2018-10-24 14:49:00,901 INFO L226 Difference]: Without dead ends: 2968 [2018-10-24 14:49:00,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 14:49:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2018-10-24 14:49:00,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2018-10-24 14:49:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2018-10-24 14:49:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4192 transitions. [2018-10-24 14:49:00,960 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 4192 transitions. Word has length 119 [2018-10-24 14:49:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:00,961 INFO L481 AbstractCegarLoop]: Abstraction has 2968 states and 4192 transitions. [2018-10-24 14:49:00,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 4192 transitions. [2018-10-24 14:49:00,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-24 14:49:00,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:00,967 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:00,967 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:00,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -219790958, now seen corresponding path program 1 times [2018-10-24 14:49:00,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:00,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:00,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:00,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-24 14:49:01,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:01,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:01,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:01,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:01,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:01,109 INFO L87 Difference]: Start difference. First operand 2968 states and 4192 transitions. Second operand 3 states. [2018-10-24 14:49:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:02,038 INFO L93 Difference]: Finished difference Result 8310 states and 11652 transitions. [2018-10-24 14:49:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:02,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2018-10-24 14:49:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:02,060 INFO L225 Difference]: With dead ends: 8310 [2018-10-24 14:49:02,061 INFO L226 Difference]: Without dead ends: 5344 [2018-10-24 14:49:02,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 14:49:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2018-10-24 14:49:02,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5344. [2018-10-24 14:49:02,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2018-10-24 14:49:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 6994 transitions. [2018-10-24 14:49:02,155 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 6994 transitions. Word has length 137 [2018-10-24 14:49:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:02,155 INFO L481 AbstractCegarLoop]: Abstraction has 5344 states and 6994 transitions. [2018-10-24 14:49:02,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 6994 transitions. [2018-10-24 14:49:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-24 14:49:02,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:02,162 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:02,163 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:02,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:02,163 INFO L82 PathProgramCache]: Analyzing trace with hash -873036279, now seen corresponding path program 1 times [2018-10-24 14:49:02,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:02,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:02,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:02,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:02,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 14:49:02,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:02,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:49:02,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:02,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:02,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:02,344 INFO L87 Difference]: Start difference. First operand 5344 states and 6994 transitions. Second operand 3 states. [2018-10-24 14:49:03,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:03,399 INFO L93 Difference]: Finished difference Result 10818 states and 14181 transitions. [2018-10-24 14:49:03,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:03,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2018-10-24 14:49:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:03,425 INFO L225 Difference]: With dead ends: 10818 [2018-10-24 14:49:03,425 INFO L226 Difference]: Without dead ends: 5476 [2018-10-24 14:49:03,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-24 14:49:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5476 states. [2018-10-24 14:49:03,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5476 to 5476. [2018-10-24 14:49:03,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5476 states. [2018-10-24 14:49:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7090 transitions. [2018-10-24 14:49:03,516 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7090 transitions. Word has length 159 [2018-10-24 14:49:03,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:03,517 INFO L481 AbstractCegarLoop]: Abstraction has 5476 states and 7090 transitions. [2018-10-24 14:49:03,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7090 transitions. [2018-10-24 14:49:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 14:49:03,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:03,525 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:03,525 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:03,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1133935695, now seen corresponding path program 1 times [2018-10-24 14:49:03,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:03,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:03,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:03,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:04,096 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-10-24 14:49:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-10-24 14:49:04,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:04,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:49:04,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:49:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:49:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:49:04,208 INFO L87 Difference]: Start difference. First operand 5476 states and 7090 transitions. Second operand 7 states. [2018-10-24 14:49:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:06,274 INFO L93 Difference]: Finished difference Result 11026 states and 14254 transitions. [2018-10-24 14:49:06,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:49:06,274 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2018-10-24 14:49:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:06,296 INFO L225 Difference]: With dead ends: 11026 [2018-10-24 14:49:06,296 INFO L226 Difference]: Without dead ends: 5552 [2018-10-24 14:49:06,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:49:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5552 states. [2018-10-24 14:49:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5552 to 5476. [2018-10-24 14:49:06,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5476 states. [2018-10-24 14:49:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5476 states to 5476 states and 7066 transitions. [2018-10-24 14:49:06,387 INFO L78 Accepts]: Start accepts. Automaton has 5476 states and 7066 transitions. Word has length 164 [2018-10-24 14:49:06,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:06,388 INFO L481 AbstractCegarLoop]: Abstraction has 5476 states and 7066 transitions. [2018-10-24 14:49:06,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:49:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5476 states and 7066 transitions. [2018-10-24 14:49:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-24 14:49:06,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:06,396 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:49:06,396 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:06,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1153467840, now seen corresponding path program 1 times [2018-10-24 14:49:06,397 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:06,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:06,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:06,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:06,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:06,608 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-10-24 14:49:06,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:06,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:49:06,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:06,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:06,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:06,610 INFO L87 Difference]: Start difference. First operand 5476 states and 7066 transitions. Second operand 4 states. [2018-10-24 14:49:09,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:09,989 INFO L93 Difference]: Finished difference Result 11753 states and 15226 transitions. [2018-10-24 14:49:09,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:09,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-24 14:49:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:10,012 INFO L225 Difference]: With dead ends: 11753 [2018-10-24 14:49:10,013 INFO L226 Difference]: Without dead ends: 6279 [2018-10-24 14:49:10,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:10,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6279 states. [2018-10-24 14:49:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6279 to 6277. [2018-10-24 14:49:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6277 states. [2018-10-24 14:49:10,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6277 states to 6277 states and 7662 transitions. [2018-10-24 14:49:10,120 INFO L78 Accepts]: Start accepts. Automaton has 6277 states and 7662 transitions. Word has length 197 [2018-10-24 14:49:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:10,120 INFO L481 AbstractCegarLoop]: Abstraction has 6277 states and 7662 transitions. [2018-10-24 14:49:10,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6277 states and 7662 transitions. [2018-10-24 14:49:10,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-24 14:49:10,128 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:10,128 INFO L375 BasicCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:49:10,128 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:10,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1927525299, now seen corresponding path program 1 times [2018-10-24 14:49:10,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:10,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:10,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-10-24 14:49:10,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:10,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:49:10,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:49:10,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:49:10,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:49:10,350 INFO L87 Difference]: Start difference. First operand 6277 states and 7662 transitions. Second operand 3 states. [2018-10-24 14:49:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:11,755 INFO L93 Difference]: Finished difference Result 17436 states and 21237 transitions. [2018-10-24 14:49:11,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:11,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2018-10-24 14:49:11,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:11,784 INFO L225 Difference]: With dead ends: 17436 [2018-10-24 14:49:11,784 INFO L226 Difference]: Without dead ends: 11161 [2018-10-24 14:49:11,791 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-24 14:49:11,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2018-10-24 14:49:11,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 11161. [2018-10-24 14:49:11,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11161 states. [2018-10-24 14:49:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 13298 transitions. [2018-10-24 14:49:11,919 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 13298 transitions. Word has length 198 [2018-10-24 14:49:11,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:11,919 INFO L481 AbstractCegarLoop]: Abstraction has 11161 states and 13298 transitions. [2018-10-24 14:49:11,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:49:11,919 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 13298 transitions. [2018-10-24 14:49:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-24 14:49:11,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:11,930 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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-24 14:49:11,931 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:11,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:11,932 INFO L82 PathProgramCache]: Analyzing trace with hash -278100145, now seen corresponding path program 1 times [2018-10-24 14:49:11,932 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:11,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:11,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:11,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:12,099 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-24 14:49:12,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:12,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:49:12,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:12,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:12,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:12,101 INFO L87 Difference]: Start difference. First operand 11161 states and 13298 transitions. Second operand 4 states. [2018-10-24 14:49:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:13,403 INFO L93 Difference]: Finished difference Result 22188 states and 26456 transitions. [2018-10-24 14:49:13,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:49:13,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 203 [2018-10-24 14:49:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:13,428 INFO L225 Difference]: With dead ends: 22188 [2018-10-24 14:49:13,428 INFO L226 Difference]: Without dead ends: 11161 [2018-10-24 14:49:13,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 14:49:13,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11161 states. [2018-10-24 14:49:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11161 to 11161. [2018-10-24 14:49:13,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11161 states. [2018-10-24 14:49:13,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11161 states to 11161 states and 13262 transitions. [2018-10-24 14:49:13,603 INFO L78 Accepts]: Start accepts. Automaton has 11161 states and 13262 transitions. Word has length 203 [2018-10-24 14:49:13,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:13,604 INFO L481 AbstractCegarLoop]: Abstraction has 11161 states and 13262 transitions. [2018-10-24 14:49:13,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:13,604 INFO L276 IsEmpty]: Start isEmpty. Operand 11161 states and 13262 transitions. [2018-10-24 14:49:13,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-24 14:49:13,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:13,615 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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, 1, 1] [2018-10-24 14:49:13,615 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:13,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:13,616 INFO L82 PathProgramCache]: Analyzing trace with hash 67715166, now seen corresponding path program 1 times [2018-10-24 14:49:13,616 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:13,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:13,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:13,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:13,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-24 14:49:13,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:49:13,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-24 14:49:13,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 14:49:13,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 14:49:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:49:13,940 INFO L87 Difference]: Start difference. First operand 11161 states and 13262 transitions. Second operand 6 states. [2018-10-24 14:49:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:15,351 INFO L93 Difference]: Finished difference Result 21913 states and 25954 transitions. [2018-10-24 14:49:15,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:49:15,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2018-10-24 14:49:15,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:15,368 INFO L225 Difference]: With dead ends: 21913 [2018-10-24 14:49:15,369 INFO L226 Difference]: Without dead ends: 10886 [2018-10-24 14:49:15,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-24 14:49:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10886 states. [2018-10-24 14:49:15,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10886 to 10230. [2018-10-24 14:49:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10230 states. [2018-10-24 14:49:15,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10230 states to 10230 states and 11632 transitions. [2018-10-24 14:49:15,508 INFO L78 Accepts]: Start accepts. Automaton has 10230 states and 11632 transitions. Word has length 225 [2018-10-24 14:49:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:15,508 INFO L481 AbstractCegarLoop]: Abstraction has 10230 states and 11632 transitions. [2018-10-24 14:49:15,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 14:49:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 10230 states and 11632 transitions. [2018-10-24 14:49:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-24 14:49:15,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:49:15,518 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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-24 14:49:15,518 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:49:15,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:49:15,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1038965227, now seen corresponding path program 1 times [2018-10-24 14:49:15,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:49:15,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:49:15,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:15,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:15,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:49:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 202 proven. 5 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-10-24 14:49:15,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 14:49:15,889 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-24 14:49:15,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:49:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:49:16,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 14:49:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 202 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-10-24 14:49:16,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-24 14:49:16,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-24 14:49:16,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:49:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:49:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:49:16,174 INFO L87 Difference]: Start difference. First operand 10230 states and 11632 transitions. Second operand 4 states. [2018-10-24 14:49:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:49:20,341 INFO L93 Difference]: Finished difference Result 16334 states and 18439 transitions. [2018-10-24 14:49:20,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:49:20,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 247 [2018-10-24 14:49:20,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:49:20,342 INFO L225 Difference]: With dead ends: 16334 [2018-10-24 14:49:20,342 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:49:20,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 248 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-24 14:49:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:49:20,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:49:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:49:20,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:49:20,354 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2018-10-24 14:49:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:49:20,354 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:49:20,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:49:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:49:20,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:49:20,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:49:20,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,446 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,452 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,491 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 75 [2018-10-24 14:49:20,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:20,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-24 14:49:21,574 WARN L179 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2018-10-24 14:49:21,868 WARN L179 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,872 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:49:21,873 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:49:21,874 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,875 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:49:21,876 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:49:21,877 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:49:21,877 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:49:21,877 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:49:21,877 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 446) no Hoare annotation was computed. [2018-10-24 14:49:21,877 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse1 (= ~a17~0 1)) (.cse10 (= ~a16~0 6))) (let ((.cse5 (= ~a16~0 4)) (.cse6 (<= ~a17~0 0)) (.cse3 (= ~a20~0 1)) (.cse7 (not (= ~a8~0 13))) (.cse4 (<= ~a21~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse8 (not .cse10)) (.cse2 (= ~a21~0 1)) (.cse9 (not .cse1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse1) (and .cse5 .cse6 .cse2 .cse7) (and .cse0 (= ~a8~0 15) .cse2) (and .cse8 .cse1 .cse2 .cse3) (and .cse2 .cse9 .cse7 (= ~a16~0 5)) (and .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9)))) [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L442(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:49:21,878 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,879 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:49:21,880 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:49:21,881 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:49:21,882 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:49:21,883 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,883 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,883 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,883 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse1 (= ~a17~0 1)) (.cse10 (= ~a16~0 6))) (let ((.cse5 (= ~a16~0 4)) (.cse6 (<= ~a17~0 0)) (.cse3 (= ~a20~0 1)) (.cse7 (not (= ~a8~0 13))) (.cse4 (<= ~a21~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse8 (not .cse10)) (.cse2 (= ~a21~0 1)) (.cse9 (not .cse1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6) (and .cse4 .cse1) (and .cse5 .cse6 .cse2 .cse7) (and .cse0 (= ~a8~0 15) .cse2) (and .cse8 .cse1 .cse2 .cse3) (and .cse2 .cse9 .cse7 (= ~a16~0 5)) (and .cse4 .cse10) (and .cse0 .cse8 .cse2 .cse9)))) [2018-10-24 14:49:21,883 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,883 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,883 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:49:21,883 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,884 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:49:21,885 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,886 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:49:21,887 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:49:21,888 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:49:21,889 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:49:21,890 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:49:21,891 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:49:21,892 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:49:21,892 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:49:21,892 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:49:21,892 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:49:21,892 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:49:21,892 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:49:21,892 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:49:21,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:49:21 BoogieIcfgContainer [2018-10-24 14:49:21,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:49:21,914 INFO L168 Benchmark]: Toolchain (without parser) took 36313.00 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -276.8 MB). Peak memory consumption was 826.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:21,915 INFO L168 Benchmark]: CDTParser took 0.24 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-24 14:49:21,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 698.17 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:21,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 201.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:21,917 INFO L168 Benchmark]: Boogie Preprocessor took 95.67 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:21,918 INFO L168 Benchmark]: RCFGBuilder took 3247.48 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: 119.3 MB). Peak memory consumption was 119.3 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:21,919 INFO L168 Benchmark]: TraceAbstraction took 32057.16 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 365.4 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 385.2 MB). Peak memory consumption was 750.7 MB. Max. memory is 7.1 GB. [2018-10-24 14:49:21,924 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 698.17 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 201.92 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -816.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.67 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3247.48 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: 119.3 MB). Peak memory consumption was 119.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32057.16 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 365.4 MB). Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 385.2 MB). Peak memory consumption was 750.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 446]: 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: 583]: Loop Invariant Derived loop invariant: ((((((((((!(a7 == 1) && a17 == 1) && a21 == 1) && a20 == 1) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a17 == 1)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((!(a7 == 1) && a8 == 15) && a21 == 1)) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a21 == 1 && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (a21 <= 0 && a16 == 6)) || (((!(a7 == 1) && !(a16 == 6)) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((!(a7 == 1) && a17 == 1) && a21 == 1) && a20 == 1) || ((a21 <= 0 && a16 == 4) && a17 <= 0)) || (a21 <= 0 && a17 == 1)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((!(a7 == 1) && a8 == 15) && a21 == 1)) || (((!(a16 == 6) && a17 == 1) && a21 == 1) && a20 == 1)) || (((a21 == 1 && !(a17 == 1)) && !(a8 == 13)) && a16 == 5)) || (a21 <= 0 && a16 == 6)) || (((!(a7 == 1) && !(a16 == 6)) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 199 locations, 1 error locations. SAFE Result, 31.9s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 25.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 2073 SDtfs, 3154 SDslu, 900 SDs, 0 SdLazy, 7493 SolverSat, 1674 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 263 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11161occurred in iteration=9, 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.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 734 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 100 NumberOfFragments, 219 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5189 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 770 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2184 NumberOfCodeBlocks, 2184 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2171 ConstructedInterpolants, 0 QuantifiedInterpolants, 938656 SizeOfPredicates, 1 NumberOfNonLiveVariables, 451 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1924/1929 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...