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_label59_true-unreach-call_false-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 14:51:50,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 14:51:50,683 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 14:51:50,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 14:51:50,697 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 14:51:50,698 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 14:51:50,699 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 14:51:50,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 14:51:50,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 14:51:50,706 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 14:51:50,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 14:51:50,707 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 14:51:50,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 14:51:50,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 14:51:50,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 14:51:50,712 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 14:51:50,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 14:51:50,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 14:51:50,716 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 14:51:50,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 14:51:50,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 14:51:50,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 14:51:50,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 14:51:50,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 14:51:50,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 14:51:50,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 14:51:50,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 14:51:50,731 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 14:51:50,732 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 14:51:50,733 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 14:51:50,733 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 14:51:50,733 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 14:51:50,734 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 14:51:50,734 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 14:51:50,735 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 14:51:50,736 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 14:51:50,736 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:51:50,761 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 14:51:50,761 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 14:51:50,762 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 14:51:50,762 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-24 14:51:50,763 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-24 14:51:50,763 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-24 14:51:50,763 INFO L133 SettingsManager]: * Use SBE=true [2018-10-24 14:51:50,763 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 14:51:50,764 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 14:51:50,764 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 14:51:50,764 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 14:51:50,764 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 14:51:50,764 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 14:51:50,765 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 14:51:50,765 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 14:51:50,765 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 14:51:50,765 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 14:51:50,765 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 14:51:50,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 14:51:50,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 14:51:50,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 14:51:50,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 14:51:50,767 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 14:51:50,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-24 14:51:50,768 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 14:51:50,768 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 14:51:50,768 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 14:51:50,768 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 14:51:50,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 14:51:50,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 14:51:50,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 14:51:50,855 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 14:51:50,856 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 14:51:50,856 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label59_true-unreach-call_false-termination.c [2018-10-24 14:51:50,925 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cab6587c8/d731bdded6104432a5b7f434d3e2c46c/FLAGbbec3ac65 [2018-10-24 14:51:51,502 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 14:51:51,503 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label59_true-unreach-call_false-termination.c [2018-10-24 14:51:51,527 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cab6587c8/d731bdded6104432a5b7f434d3e2c46c/FLAGbbec3ac65 [2018-10-24 14:51:51,541 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/cab6587c8/d731bdded6104432a5b7f434d3e2c46c [2018-10-24 14:51:51,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 14:51:51,554 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 14:51:51,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 14:51:51,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 14:51:51,559 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 14:51:51,560 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:51:51" (1/1) ... [2018-10-24 14:51:51,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4aab1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:51, skipping insertion in model container [2018-10-24 14:51:51,563 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:51:51" (1/1) ... [2018-10-24 14:51:51,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 14:51:51,654 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 14:51:52,185 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:51:52,190 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 14:51:52,281 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 14:51:52,300 INFO L193 MainTranslator]: Completed translation [2018-10-24 14:51:52,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52 WrapperNode [2018-10-24 14:51:52,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 14:51:52,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 14:51:52,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 14:51:52,302 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 14:51:52,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:51:52" (1/1) ... [2018-10-24 14:51:52,339 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:51:52" (1/1) ... [2018-10-24 14:51:52,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 14:51:52,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 14:51:52,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 14:51:52,493 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 14:51:52,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (1/1) ... [2018-10-24 14:51:52,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (1/1) ... [2018-10-24 14:51:52,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (1/1) ... [2018-10-24 14:51:52,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (1/1) ... [2018-10-24 14:51:52,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (1/1) ... [2018-10-24 14:51:52,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (1/1) ... [2018-10-24 14:51:52,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (1/1) ... [2018-10-24 14:51:52,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 14:51:52,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 14:51:52,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 14:51:52,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 14:51:52,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (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:51:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-10-24 14:51:52,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 14:51:52,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 14:51:55,969 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 14:51:55,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:51:55 BoogieIcfgContainer [2018-10-24 14:51:55,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 14:51:55,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 14:51:55,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 14:51:55,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 14:51:55,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:51:51" (1/3) ... [2018-10-24 14:51:55,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c642213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:51:55, skipping insertion in model container [2018-10-24 14:51:55,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:51:52" (2/3) ... [2018-10-24 14:51:55,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c642213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:51:55, skipping insertion in model container [2018-10-24 14:51:55,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:51:55" (3/3) ... [2018-10-24 14:51:55,979 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label59_true-unreach-call_false-termination.c [2018-10-24 14:51:55,988 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 14:51:55,996 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 14:51:56,014 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 14:51:56,047 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-24 14:51:56,047 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 14:51:56,047 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 14:51:56,048 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 14:51:56,048 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 14:51:56,048 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 14:51:56,048 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 14:51:56,049 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 14:51:56,049 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 14:51:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2018-10-24 14:51:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-24 14:51:56,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:56,086 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] [2018-10-24 14:51:56,089 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:56,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1373899785, now seen corresponding path program 1 times [2018-10-24 14:51:56,098 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:56,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:56,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:56,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:56,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:56,665 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:51:56,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:56,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:56,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:51:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:51:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:56,698 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 4 states. [2018-10-24 14:51:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:51:59,044 INFO L93 Difference]: Finished difference Result 666 states and 1182 transitions. [2018-10-24 14:51:59,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:51:59,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-24 14:51:59,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:51:59,069 INFO L225 Difference]: With dead ends: 666 [2018-10-24 14:51:59,069 INFO L226 Difference]: Without dead ends: 460 [2018-10-24 14:51:59,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:51:59,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-24 14:51:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2018-10-24 14:51:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-24 14:51:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 736 transitions. [2018-10-24 14:51:59,151 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 736 transitions. Word has length 90 [2018-10-24 14:51:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:51:59,152 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 736 transitions. [2018-10-24 14:51:59,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:51:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 736 transitions. [2018-10-24 14:51:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-24 14:51:59,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:51:59,157 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] [2018-10-24 14:51:59,158 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:51:59,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:51:59,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1336174219, now seen corresponding path program 1 times [2018-10-24 14:51:59,159 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:51:59,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:51:59,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:59,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:51:59,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:51:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:51:59,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:51:59,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:51:59,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:51:59,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:51:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:51:59,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:51:59,393 INFO L87 Difference]: Start difference. First operand 460 states and 736 transitions. Second operand 3 states. [2018-10-24 14:52:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:00,456 INFO L93 Difference]: Finished difference Result 1314 states and 2143 transitions. [2018-10-24 14:52:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:52:00,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-10-24 14:52:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:00,464 INFO L225 Difference]: With dead ends: 1314 [2018-10-24 14:52:00,464 INFO L226 Difference]: Without dead ends: 856 [2018-10-24 14:52:00,468 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:52:00,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-24 14:52:00,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2018-10-24 14:52:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-10-24 14:52:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1264 transitions. [2018-10-24 14:52:00,514 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1264 transitions. Word has length 98 [2018-10-24 14:52:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:00,515 INFO L481 AbstractCegarLoop]: Abstraction has 856 states and 1264 transitions. [2018-10-24 14:52:00,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:52:00,516 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1264 transitions. [2018-10-24 14:52:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-24 14:52:00,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:00,520 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:52:00,520 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:00,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:00,521 INFO L82 PathProgramCache]: Analyzing trace with hash -995428052, now seen corresponding path program 1 times [2018-10-24 14:52:00,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:00,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:00,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:00,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:00,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 14:52:00,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:00,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:52:00,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:52:00,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:52:00,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:00,721 INFO L87 Difference]: Start difference. First operand 856 states and 1264 transitions. Second operand 4 states. [2018-10-24 14:52:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:03,584 INFO L93 Difference]: Finished difference Result 2502 states and 3727 transitions. [2018-10-24 14:52:03,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:52:03,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-10-24 14:52:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:03,597 INFO L225 Difference]: With dead ends: 2502 [2018-10-24 14:52:03,597 INFO L226 Difference]: Without dead ends: 1512 [2018-10-24 14:52:03,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2018-10-24 14:52:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2018-10-24 14:52:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-10-24 14:52:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 2035 transitions. [2018-10-24 14:52:03,639 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 2035 transitions. Word has length 105 [2018-10-24 14:52:03,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:03,639 INFO L481 AbstractCegarLoop]: Abstraction has 1512 states and 2035 transitions. [2018-10-24 14:52:03,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:52:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 2035 transitions. [2018-10-24 14:52:03,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-24 14:52:03,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:03,644 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 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:52:03,644 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:03,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1187843249, now seen corresponding path program 1 times [2018-10-24 14:52:03,645 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:03,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:03,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:03,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 14:52:03,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:03,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-24 14:52:03,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-24 14:52:03,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-24 14:52:03,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-24 14:52:03,832 INFO L87 Difference]: Start difference. First operand 1512 states and 2035 transitions. Second operand 3 states. [2018-10-24 14:52:04,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:04,776 INFO L93 Difference]: Finished difference Result 4474 states and 6044 transitions. [2018-10-24 14:52:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:52:04,776 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-24 14:52:04,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:04,787 INFO L225 Difference]: With dead ends: 4474 [2018-10-24 14:52:04,787 INFO L226 Difference]: Without dead ends: 2288 [2018-10-24 14:52:04,791 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:52:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-10-24 14:52:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2288. [2018-10-24 14:52:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2288 states. [2018-10-24 14:52:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2288 states to 2288 states and 2753 transitions. [2018-10-24 14:52:04,840 INFO L78 Accepts]: Start accepts. Automaton has 2288 states and 2753 transitions. Word has length 107 [2018-10-24 14:52:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:04,840 INFO L481 AbstractCegarLoop]: Abstraction has 2288 states and 2753 transitions. [2018-10-24 14:52:04,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-24 14:52:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2288 states and 2753 transitions. [2018-10-24 14:52:04,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-24 14:52:04,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:04,844 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:04,844 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:04,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1030733115, now seen corresponding path program 1 times [2018-10-24 14:52:04,845 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:04,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:04,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:04,984 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 14:52:04,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:04,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:52:04,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:52:04,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:52:04,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:04,986 INFO L87 Difference]: Start difference. First operand 2288 states and 2753 transitions. Second operand 4 states. [2018-10-24 14:52:05,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:05,854 INFO L93 Difference]: Finished difference Result 4713 states and 5654 transitions. [2018-10-24 14:52:05,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 14:52:05,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-10-24 14:52:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:05,866 INFO L225 Difference]: With dead ends: 4713 [2018-10-24 14:52:05,866 INFO L226 Difference]: Without dead ends: 2427 [2018-10-24 14:52:05,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 14:52:05,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2427 states. [2018-10-24 14:52:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2427 to 2420. [2018-10-24 14:52:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2018-10-24 14:52:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2888 transitions. [2018-10-24 14:52:05,917 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2888 transitions. Word has length 115 [2018-10-24 14:52:05,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:05,917 INFO L481 AbstractCegarLoop]: Abstraction has 2420 states and 2888 transitions. [2018-10-24 14:52:05,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:52:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2888 transitions. [2018-10-24 14:52:05,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-24 14:52:05,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:05,922 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-10-24 14:52:05,922 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:05,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:05,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1029366675, now seen corresponding path program 1 times [2018-10-24 14:52:05,923 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:05,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:05,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:05,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:05,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:06,154 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-24 14:52:06,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:06,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:52:06,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:52:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:52:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:06,156 INFO L87 Difference]: Start difference. First operand 2420 states and 2888 transitions. Second operand 4 states. [2018-10-24 14:52:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:07,415 INFO L93 Difference]: Finished difference Result 4970 states and 5957 transitions. [2018-10-24 14:52:07,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:52:07,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-10-24 14:52:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:07,428 INFO L225 Difference]: With dead ends: 4970 [2018-10-24 14:52:07,428 INFO L226 Difference]: Without dead ends: 2684 [2018-10-24 14:52:07,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2018-10-24 14:52:07,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2684. [2018-10-24 14:52:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2684 states. [2018-10-24 14:52:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2684 states to 2684 states and 3172 transitions. [2018-10-24 14:52:07,472 INFO L78 Accepts]: Start accepts. Automaton has 2684 states and 3172 transitions. Word has length 120 [2018-10-24 14:52:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:07,472 INFO L481 AbstractCegarLoop]: Abstraction has 2684 states and 3172 transitions. [2018-10-24 14:52:07,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:52:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 2684 states and 3172 transitions. [2018-10-24 14:52:07,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-24 14:52:07,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:07,477 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:07,477 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:07,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:07,477 INFO L82 PathProgramCache]: Analyzing trace with hash -15265412, now seen corresponding path program 1 times [2018-10-24 14:52:07,477 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:07,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:07,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:07,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:07,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:52:07,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:07,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-24 14:52:07,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:52:07,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:52:07,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:07,640 INFO L87 Difference]: Start difference. First operand 2684 states and 3172 transitions. Second operand 4 states. [2018-10-24 14:52:08,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:08,427 INFO L93 Difference]: Finished difference Result 7214 states and 8636 transitions. [2018-10-24 14:52:08,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:52:08,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-10-24 14:52:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:08,442 INFO L225 Difference]: With dead ends: 7214 [2018-10-24 14:52:08,443 INFO L226 Difference]: Without dead ends: 4664 [2018-10-24 14:52:08,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:08,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4664 states. [2018-10-24 14:52:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4664 to 4400. [2018-10-24 14:52:08,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4400 states. [2018-10-24 14:52:08,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4400 states to 4400 states and 5068 transitions. [2018-10-24 14:52:08,511 INFO L78 Accepts]: Start accepts. Automaton has 4400 states and 5068 transitions. Word has length 137 [2018-10-24 14:52:08,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:08,511 INFO L481 AbstractCegarLoop]: Abstraction has 4400 states and 5068 transitions. [2018-10-24 14:52:08,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:52:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4400 states and 5068 transitions. [2018-10-24 14:52:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-24 14:52:08,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:08,516 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-24 14:52:08,516 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:08,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:08,516 INFO L82 PathProgramCache]: Analyzing trace with hash 744617161, now seen corresponding path program 1 times [2018-10-24 14:52:08,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:08,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:08,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:08,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:08,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:52:08,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:08,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:52:08,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:52:08,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:52:08,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:08,738 INFO L87 Difference]: Start difference. First operand 4400 states and 5068 transitions. Second operand 4 states. [2018-10-24 14:52:09,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:09,405 INFO L93 Difference]: Finished difference Result 8264 states and 9541 transitions. [2018-10-24 14:52:09,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:52:09,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-10-24 14:52:09,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:09,418 INFO L225 Difference]: With dead ends: 8264 [2018-10-24 14:52:09,418 INFO L226 Difference]: Without dead ends: 3998 [2018-10-24 14:52:09,423 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:52:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2018-10-24 14:52:09,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3998. [2018-10-24 14:52:09,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3998 states. [2018-10-24 14:52:09,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 4464 transitions. [2018-10-24 14:52:09,528 INFO L78 Accepts]: Start accepts. Automaton has 3998 states and 4464 transitions. Word has length 150 [2018-10-24 14:52:09,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:09,528 INFO L481 AbstractCegarLoop]: Abstraction has 3998 states and 4464 transitions. [2018-10-24 14:52:09,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:52:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 3998 states and 4464 transitions. [2018-10-24 14:52:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-24 14:52:09,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:09,533 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-24 14:52:09,534 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:09,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:09,534 INFO L82 PathProgramCache]: Analyzing trace with hash -529483922, now seen corresponding path program 1 times [2018-10-24 14:52:09,534 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:09,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:09,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:09,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-24 14:52:09,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:09,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:52:09,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:52:09,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:52:09,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:09,761 INFO L87 Difference]: Start difference. First operand 3998 states and 4464 transitions. Second operand 4 states. [2018-10-24 14:52:12,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:12,558 INFO L93 Difference]: Finished difference Result 7994 states and 8946 transitions. [2018-10-24 14:52:12,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-24 14:52:12,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2018-10-24 14:52:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:12,579 INFO L225 Difference]: With dead ends: 7994 [2018-10-24 14:52:12,579 INFO L226 Difference]: Without dead ends: 3996 [2018-10-24 14:52:12,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:52:12,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2018-10-24 14:52:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 3864. [2018-10-24 14:52:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2018-10-24 14:52:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 4211 transitions. [2018-10-24 14:52:12,644 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 4211 transitions. Word has length 164 [2018-10-24 14:52:12,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:12,644 INFO L481 AbstractCegarLoop]: Abstraction has 3864 states and 4211 transitions. [2018-10-24 14:52:12,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:52:12,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 4211 transitions. [2018-10-24 14:52:12,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-24 14:52:12,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:12,650 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52:12,650 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:12,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1076562399, now seen corresponding path program 1 times [2018-10-24 14:52:12,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:12,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:12,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:13,068 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-24 14:52:13,348 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-10-24 14:52:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 14:52:13,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:13,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-24 14:52:13,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-24 14:52:13,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-24 14:52:13,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:52:13,612 INFO L87 Difference]: Start difference. First operand 3864 states and 4211 transitions. Second operand 7 states. [2018-10-24 14:52:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:15,492 INFO L93 Difference]: Finished difference Result 7480 states and 8143 transitions. [2018-10-24 14:52:15,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 14:52:15,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 167 [2018-10-24 14:52:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:15,500 INFO L225 Difference]: With dead ends: 7480 [2018-10-24 14:52:15,501 INFO L226 Difference]: Without dead ends: 2690 [2018-10-24 14:52:15,504 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-10-24 14:52:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2018-10-24 14:52:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2666. [2018-10-24 14:52:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2666 states. [2018-10-24 14:52:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 2833 transitions. [2018-10-24 14:52:15,538 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 2833 transitions. Word has length 167 [2018-10-24 14:52:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:15,539 INFO L481 AbstractCegarLoop]: Abstraction has 2666 states and 2833 transitions. [2018-10-24 14:52:15,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-24 14:52:15,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 2833 transitions. [2018-10-24 14:52:15,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-24 14:52:15,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 14:52:15,543 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 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] [2018-10-24 14:52:15,544 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 14:52:15,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 14:52:15,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1807079308, now seen corresponding path program 1 times [2018-10-24 14:52:15,545 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-24 14:52:15,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-24 14:52:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:15,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 14:52:15,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 14:52:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 14:52:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-24 14:52:16,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 14:52:16,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 14:52:16,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 14:52:16,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 14:52:16,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:16,060 INFO L87 Difference]: Start difference. First operand 2666 states and 2833 transitions. Second operand 4 states. [2018-10-24 14:52:17,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 14:52:17,553 INFO L93 Difference]: Finished difference Result 5586 states and 5952 transitions. [2018-10-24 14:52:17,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-24 14:52:17,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2018-10-24 14:52:17,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 14:52:17,554 INFO L225 Difference]: With dead ends: 5586 [2018-10-24 14:52:17,554 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 14:52:17,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-24 14:52:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 14:52:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 14:52:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 14:52:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 14:52:17,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 217 [2018-10-24 14:52:17,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 14:52:17,560 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 14:52:17,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 14:52:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 14:52:17,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 14:52:17,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 14:52:18,990 WARN L179 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-10-24 14:52:19,314 WARN L179 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L565(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L532(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L499(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L466(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L433(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L400(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,319 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-10-24 14:52:19,320 INFO L425 ceAbstractionStarter]: For program point L568(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L535(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L502(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L469(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L436(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L403(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-10-24 14:52:19,321 INFO L425 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-10-24 14:52:19,322 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L571(lines 571 573) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L538(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L505(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L472(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L439(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L406(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,323 INFO L425 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-10-24 14:52:19,324 INFO L425 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-10-24 14:52:19,325 INFO L421 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1))) (let ((.cse5 (= ~a16~0 5)) (.cse6 (= ~a8~0 13)) (.cse8 (= ~a16~0 4)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse9 (<= ~a20~0 0)) (.cse10 (not .cse0)) (.cse3 (= ~a8~0 15)) (.cse7 (<= ~a17~0 0)) (.cse4 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and (not (= 1 ULTIMATE.start_calculate_output_~input)) .cse3 .cse1 (= ~a12~0 8) .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4) (and .cse8 .cse7 .cse9) (and .cse0 .cse7 .cse4 .cse5) (and .cse10 .cse8 .cse7 .cse4) (and .cse0 .cse3 .cse5) (and .cse3 .cse1 .cse2 .cse9) (and .cse7 .cse9 .cse5) (and .cse3 .cse7 .cse9) (and .cse6 .cse1 .cse2 .cse4) (and .cse0 .cse6 .cse1) (and .cse8 .cse1 (not .cse3) .cse2 .cse4) (and .cse0 .cse7 .cse9) (and .cse10 .cse3 .cse7 .cse4)))) [2018-10-24 14:52:19,325 INFO L425 ceAbstractionStarter]: For program point L541(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,325 INFO L425 ceAbstractionStarter]: For program point L508(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,325 INFO L425 ceAbstractionStarter]: For program point L475(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 443) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L409(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-10-24 14:52:19,326 INFO L425 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L428 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L544(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L511(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L478(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L445(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L412(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,327 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L547(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L514(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L481(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L448(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,328 INFO L425 ceAbstractionStarter]: For program point L415(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-10-24 14:52:19,329 INFO L425 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L583-1(lines 583 593) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L550(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,330 INFO L425 ceAbstractionStarter]: For program point L517(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,331 INFO L425 ceAbstractionStarter]: For program point L484(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,331 INFO L421 ceAbstractionStarter]: At program point L583-3(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a7~0 1))) (let ((.cse8 (= ~a16~0 5)) (.cse3 (= ~a8~0 13)) (.cse6 (= ~a16~0 4)) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a21~0 1)) (.cse7 (<= ~a20~0 0)) (.cse10 (not .cse0)) (.cse9 (= ~a8~0 15)) (.cse4 (<= ~a17~0 0)) (.cse5 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 .cse5) (and .cse6 .cse4 .cse7) (and .cse0 .cse4 .cse5 .cse8) (and .cse9 (= ~a12~0 8) .cse1 .cse2 .cse5 .cse8) (and .cse10 .cse6 .cse4 .cse5) (and .cse0 .cse9 .cse8) (and .cse9 .cse1 .cse2 .cse7) (and .cse4 .cse7 .cse8) (and .cse9 .cse4 .cse7) (and .cse3 .cse1 .cse2 .cse5) (and .cse0 .cse3 .cse1) (and .cse6 .cse1 (not .cse9) .cse2 .cse5) (and .cse0 .cse4 .cse7) (and .cse10 .cse9 .cse4 .cse5)))) [2018-10-24 14:52:19,331 INFO L425 ceAbstractionStarter]: For program point L451(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,331 INFO L425 ceAbstractionStarter]: For program point L418(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,331 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-10-24 14:52:19,331 INFO L425 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L553(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,332 INFO L425 ceAbstractionStarter]: For program point L520(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L487(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L454(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L421(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-10-24 14:52:19,333 INFO L425 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L556(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L523(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,334 INFO L425 ceAbstractionStarter]: For program point L490(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L457(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L424(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L391-1(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-10-24 14:52:19,335 INFO L425 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L559(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L526(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,336 INFO L425 ceAbstractionStarter]: For program point L493(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L460(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L427(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L394(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-10-24 14:52:19,337 INFO L425 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L562(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L529(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L496(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,338 INFO L425 ceAbstractionStarter]: For program point L463(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L430(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L397(lines 30 575) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-10-24 14:52:19,339 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-10-24 14:52:19,340 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-10-24 14:52:19,340 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-10-24 14:52:19,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:52:19 BoogieIcfgContainer [2018-10-24 14:52:19,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 14:52:19,366 INFO L168 Benchmark]: Toolchain (without parser) took 27813.58 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.8 GB in the end (delta: -363.7 MB). Peak memory consumption was 733.6 MB. Max. memory is 7.1 GB. [2018-10-24 14:52:19,368 INFO L168 Benchmark]: CDTParser took 0.23 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:52:19,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.58 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:52:19,369 INFO L168 Benchmark]: Boogie Procedure Inliner took 191.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2018-10-24 14:52:19,370 INFO L168 Benchmark]: Boogie Preprocessor took 60.64 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-24 14:52:19,370 INFO L168 Benchmark]: RCFGBuilder took 3416.59 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.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. [2018-10-24 14:52:19,371 INFO L168 Benchmark]: TraceAbstraction took 23393.91 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 366.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 289.5 MB). Peak memory consumption was 655.5 MB. Max. memory is 7.1 GB. [2018-10-24 14:52:19,377 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.58 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 191.03 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -804.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.64 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 3416.59 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.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23393.91 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 366.0 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 289.5 MB). Peak memory consumption was 655.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 443]: 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) || (((a7 == 1 && a8 == 13) && a17 <= 0) && a20 == 1)) || ((a16 == 4 && a17 <= 0) && a20 <= 0)) || (((a7 == 1 && a17 <= 0) && a20 == 1) && a16 == 5)) || (((((a8 == 15 && a12 == 8) && a17 == 1) && a21 == 1) && a20 == 1) && a16 == 5)) || (((!(a7 == 1) && a16 == 4) && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a8 == 15 && a17 == 1) && a21 == 1) && a20 <= 0)) || ((a17 <= 0 && a20 <= 0) && a16 == 5)) || ((a8 == 15 && a17 <= 0) && a20 <= 0)) || (((a8 == 13 && a17 == 1) && a21 == 1) && a20 == 1)) || ((a7 == 1 && a8 == 13) && a17 == 1)) || ((((a16 == 4 && a17 == 1) && !(a8 == 15)) && a21 == 1) && a20 == 1)) || ((a7 == 1 && a17 <= 0) && a20 <= 0)) || (((!(a7 == 1) && a8 == 15) && a17 <= 0) && a20 == 1) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((a7 == 1 && a17 == 1) && a21 == 1) || ((((((!(1 == input) && a8 == 15) && a17 == 1) && a12 == 8) && a21 == 1) && a20 == 1) && a16 == 5)) || (((a7 == 1 && a8 == 13) && a17 <= 0) && a20 == 1)) || ((a16 == 4 && a17 <= 0) && a20 <= 0)) || (((a7 == 1 && a17 <= 0) && a20 == 1) && a16 == 5)) || (((!(a7 == 1) && a16 == 4) && a17 <= 0) && a20 == 1)) || ((a7 == 1 && a8 == 15) && a16 == 5)) || (((a8 == 15 && a17 == 1) && a21 == 1) && a20 <= 0)) || ((a17 <= 0 && a20 <= 0) && a16 == 5)) || ((a8 == 15 && a17 <= 0) && a20 <= 0)) || (((a8 == 13 && a17 == 1) && a21 == 1) && a20 == 1)) || ((a7 == 1 && a8 == 13) && a17 == 1)) || ((((a16 == 4 && a17 == 1) && !(a8 == 15)) && a21 == 1) && a20 == 1)) || ((a7 == 1 && a17 <= 0) && a20 <= 0)) || (((!(a7 == 1) && a8 == 15) && a17 <= 0) && a20 == 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, 23.3s OverallTime, 11 OverallIterations, 5 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 1706 SDtfs, 3353 SDslu, 589 SDs, 0 SdLazy, 6115 SolverSat, 1107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4400occurred in iteration=7, 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: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 427 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 82 NumberOfFragments, 379 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1513 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 62 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1470 NumberOfCodeBlocks, 1470 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1459 ConstructedInterpolants, 0 QuantifiedInterpolants, 504984 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 688/688 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...