java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 10:36:50,561 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 10:36:50,563 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 10:36:50,579 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 10:36:50,580 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 10:36:50,581 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 10:36:50,582 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 10:36:50,584 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 10:36:50,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 10:36:50,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 10:36:50,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 10:36:50,588 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 10:36:50,589 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 10:36:50,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 10:36:50,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 10:36:50,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 10:36:50,592 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 10:36:50,594 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 10:36:50,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 10:36:50,598 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 10:36:50,599 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 10:36:50,600 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 10:36:50,603 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 10:36:50,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 10:36:50,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 10:36:50,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 10:36:50,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 10:36:50,606 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 10:36:50,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 10:36:50,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 10:36:50,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 10:36:50,609 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 10:36:50,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 10:36:50,610 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 10:36:50,611 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 10:36:50,611 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 10:36:50,612 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-11-07 10:36:50,627 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 10:36:50,627 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 10:36:50,628 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 10:36:50,628 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 10:36:50,628 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 10:36:50,629 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 10:36:50,629 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-07 10:36:50,629 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 10:36:50,629 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-07 10:36:50,630 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 10:36:50,630 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 10:36:50,630 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 10:36:50,630 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 10:36:50,630 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 10:36:50,631 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 10:36:50,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 10:36:50,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 10:36:50,632 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 10:36:50,632 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 10:36:50,632 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 10:36:50,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 10:36:50,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 10:36:50,633 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 10:36:50,633 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 10:36:50,633 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 10:36:50,633 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 10:36:50,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:36:50,634 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 10:36:50,634 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 10:36:50,634 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 10:36:50,634 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 10:36:50,634 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 10:36:50,635 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 10:36:50,635 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 10:36:50,635 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 10:36:50,635 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 10:36:50,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 10:36:50,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 10:36:50,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 10:36:50,697 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 10:36:50,698 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 10:36:50,698 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-07 10:36:50,762 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe4621e6/2841161c4c424666aae7335f39add82d/FLAG7b66b80b3 [2018-11-07 10:36:51,267 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 10:36:51,268 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-07 10:36:51,275 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe4621e6/2841161c4c424666aae7335f39add82d/FLAG7b66b80b3 [2018-11-07 10:36:51,290 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fe4621e6/2841161c4c424666aae7335f39add82d [2018-11-07 10:36:51,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 10:36:51,303 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 10:36:51,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:51,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 10:36:51,308 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 10:36:51,309 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b0fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51, skipping insertion in model container [2018-11-07 10:36:51,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 10:36:51,349 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 10:36:51,562 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:51,567 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 10:36:51,587 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 10:36:51,603 INFO L193 MainTranslator]: Completed translation [2018-11-07 10:36:51,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51 WrapperNode [2018-11-07 10:36:51,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 10:36:51,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:51,605 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 10:36:51,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 10:36:51,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,622 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,628 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 10:36:51,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 10:36:51,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 10:36:51,629 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 10:36:51,638 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... [2018-11-07 10:36:51,653 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 10:36:51,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 10:36:51,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 10:36:51,655 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 10:36:51,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 10:36:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 10:36:51,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 10:36:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 10:36:51,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 10:36:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 10:36:51,788 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 10:36:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 10:36:51,788 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 10:36:52,219 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 10:36:52,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:52 BoogieIcfgContainer [2018-11-07 10:36:52,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 10:36:52,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 10:36:52,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 10:36:52,227 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 10:36:52,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:36:51" (1/3) ... [2018-11-07 10:36:52,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576ec207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:52, skipping insertion in model container [2018-11-07 10:36:52,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:36:51" (2/3) ... [2018-11-07 10:36:52,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576ec207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:36:52, skipping insertion in model container [2018-11-07 10:36:52,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:36:52" (3/3) ... [2018-11-07 10:36:52,231 INFO L112 eAbstractionObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-07 10:36:52,242 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 10:36:52,253 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 10:36:52,271 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 10:36:52,308 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 10:36:52,309 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 10:36:52,309 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 10:36:52,309 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 10:36:52,309 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 10:36:52,309 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 10:36:52,310 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 10:36:52,310 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 10:36:52,330 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-07 10:36:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-07 10:36:52,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:52,338 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:52,340 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:52,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash 416534784, now seen corresponding path program 1 times [2018-11-07 10:36:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:52,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:52,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:52,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:52,398 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:52,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:52,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 10:36:52,558 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:52,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:52,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-07 10:36:52,577 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-11-07 10:36:52,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:52,765 INFO L93 Difference]: Finished difference Result 63 states and 86 transitions. [2018-11-07 10:36:52,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:52,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-07 10:36:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:52,777 INFO L225 Difference]: With dead ends: 63 [2018-11-07 10:36:52,778 INFO L226 Difference]: Without dead ends: 31 [2018-11-07 10:36:52,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:36:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-07 10:36:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-07 10:36:52,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-07 10:36:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-07 10:36:52,826 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2018-11-07 10:36:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:52,827 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-07 10:36:52,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-07 10:36:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 10:36:52,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:52,829 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:52,830 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:52,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1670630326, now seen corresponding path program 1 times [2018-11-07 10:36:52,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:52,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:52,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:52,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:53,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 10:36:53,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-07 10:36:53,022 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:53,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 10:36:53,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 10:36:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-07 10:36:53,025 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2018-11-07 10:36:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:53,420 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2018-11-07 10:36:53,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 10:36:53,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-07 10:36:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:53,422 INFO L225 Difference]: With dead ends: 44 [2018-11-07 10:36:53,422 INFO L226 Difference]: Without dead ends: 42 [2018-11-07 10:36:53,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-07 10:36:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-07 10:36:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2018-11-07 10:36:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-07 10:36:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-07 10:36:53,433 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 19 [2018-11-07 10:36:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:53,433 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-07 10:36:53,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 10:36:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-07 10:36:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-07 10:36:53,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:53,435 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 10:36:53,435 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:53,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash 767827044, now seen corresponding path program 1 times [2018-11-07 10:36:53,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:53,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:53,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:53,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:53,656 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:53,657 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-07 10:36:53,659 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [53], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86] [2018-11-07 10:36:53,694 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:53,694 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:53,870 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:53,872 INFO L272 AbstractInterpreter]: Visited 21 different actions 26 times. Never merged. Never widened. Never found a fixpoint. Largest state had 7 variables. [2018-11-07 10:36:53,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:53,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:53,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:53,921 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:53,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:53,942 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:53,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:54,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:54,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:54,194 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:54,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [7] total 9 [2018-11-07 10:36:54,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:54,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:54,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:54,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-07 10:36:54,196 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 5 states. [2018-11-07 10:36:54,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:54,319 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-07 10:36:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:54,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-07 10:36:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:54,322 INFO L225 Difference]: With dead ends: 50 [2018-11-07 10:36:54,322 INFO L226 Difference]: Without dead ends: 48 [2018-11-07 10:36:54,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:36:54,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-07 10:36:54,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-07 10:36:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-07 10:36:54,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2018-11-07 10:36:54,334 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 22 [2018-11-07 10:36:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:54,335 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2018-11-07 10:36:54,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:54,335 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2018-11-07 10:36:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-07 10:36:54,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:54,337 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-07 10:36:54,337 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:54,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash -676333797, now seen corresponding path program 1 times [2018-11-07 10:36:54,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:54,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:54,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:54,339 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:54,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:54,824 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:54,824 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-07 10:36:54,824 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [36], [40], [43], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86] [2018-11-07 10:36:54,827 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:54,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:54,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:54,929 INFO L272 AbstractInterpreter]: Visited 25 different actions 70 times. Merged at 8 different actions 16 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 8 variables. [2018-11-07 10:36:54,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:54,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:54,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:54,936 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:54,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:54,945 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:54,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:36:55,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:55,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 10:36:55,202 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:55,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [8] total 10 [2018-11-07 10:36:55,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:55,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 10:36:55,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 10:36:55,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-07 10:36:55,204 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand 5 states. [2018-11-07 10:36:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:55,430 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2018-11-07 10:36:55,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 10:36:55,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-07 10:36:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:55,434 INFO L225 Difference]: With dead ends: 123 [2018-11-07 10:36:55,434 INFO L226 Difference]: Without dead ends: 83 [2018-11-07 10:36:55,435 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 10:36:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-07 10:36:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 55. [2018-11-07 10:36:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-07 10:36:55,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2018-11-07 10:36:55,452 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 28 [2018-11-07 10:36:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:55,453 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2018-11-07 10:36:55,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 10:36:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-07 10:36:55,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-07 10:36:55,454 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:55,454 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-07 10:36:55,455 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:55,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:55,455 INFO L82 PathProgramCache]: Analyzing trace with hash 542199398, now seen corresponding path program 1 times [2018-11-07 10:36:55,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:55,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:55,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:55,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:55,457 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:55,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-07 10:36:55,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:55,568 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:55,568 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 37 with the following transitions: [2018-11-07 10:36:55,569 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [33], [36], [40], [43], [45], [48], [53], [57], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83], [84], [85], [86] [2018-11-07 10:36:55,572 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:55,572 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:55,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:55,663 INFO L272 AbstractInterpreter]: Visited 29 different actions 97 times. Merged at 11 different actions 20 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-07 10:36:55,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:55,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:55,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:55,673 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:55,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:55,683 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:55,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:55,827 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-07 10:36:55,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:55,985 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 10:36:56,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 10:36:56,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2018-11-07 10:36:56,005 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 10:36:56,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 10:36:56,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 10:36:56,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-11-07 10:36:56,006 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand 11 states. [2018-11-07 10:36:56,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:56,612 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2018-11-07 10:36:56,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-07 10:36:56,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-11-07 10:36:56,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:56,617 INFO L225 Difference]: With dead ends: 109 [2018-11-07 10:36:56,617 INFO L226 Difference]: Without dead ends: 82 [2018-11-07 10:36:56,618 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2018-11-07 10:36:56,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-07 10:36:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-11-07 10:36:56,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-07 10:36:56,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 91 transitions. [2018-11-07 10:36:56,634 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 91 transitions. Word has length 36 [2018-11-07 10:36:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:56,635 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 91 transitions. [2018-11-07 10:36:56,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 10:36:56,635 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 91 transitions. [2018-11-07 10:36:56,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-07 10:36:56,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 10:36:56,637 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 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] [2018-11-07 10:36:56,638 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 10:36:56,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:56,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1487760091, now seen corresponding path program 1 times [2018-11-07 10:36:56,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 10:36:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:56,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:56,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 10:36:56,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 10:36:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 10:36:56,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:56,848 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 10:36:56,848 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 48 with the following transitions: [2018-11-07 10:36:56,849 INFO L202 CegarAbsIntRunner]: [0], [4], [8], [11], [15], [19], [24], [28], [31], [33], [36], [40], [43], [53], [57], [61], [67], [70], [72], [75], [77], [78], [79], [80], [84], [85], [86], [87] [2018-11-07 10:36:56,851 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-07 10:36:56,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 10:36:56,961 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 10:36:56,961 INFO L272 AbstractInterpreter]: Visited 28 different actions 130 times. Merged at 13 different actions 41 times. Never widened. Found 11 fixpoints after 3 different actions. Largest state had 9 variables. [2018-11-07 10:36:56,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 10:36:56,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 10:36:56,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 10:36:56,988 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 10:36:56,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 10:36:56,997 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 10:36:57,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 10:36:57,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 10:36:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-07 10:36:57,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 10:36:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-07 10:36:57,213 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-07 10:36:57,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [13] total 14 [2018-11-07 10:36:57,213 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 10:36:57,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-07 10:36:57,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-07 10:36:57,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-07 10:36:57,214 INFO L87 Difference]: Start difference. First operand 77 states and 91 transitions. Second operand 4 states. [2018-11-07 10:36:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 10:36:57,276 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2018-11-07 10:36:57,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-07 10:36:57,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-11-07 10:36:57,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 10:36:57,277 INFO L225 Difference]: With dead ends: 111 [2018-11-07 10:36:57,277 INFO L226 Difference]: Without dead ends: 0 [2018-11-07 10:36:57,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-07 10:36:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-07 10:36:57,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-07 10:36:57,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-07 10:36:57,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-07 10:36:57,279 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-11-07 10:36:57,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 10:36:57,279 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-07 10:36:57,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-07 10:36:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-07 10:36:57,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-07 10:36:57,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-07 10:36:57,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:36:57,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:36:57,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-07 10:36:57,617 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-07 10:36:57,617 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:36:57,617 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-07 10:36:57,617 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-07 10:36:57,617 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-07 10:36:57,617 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-07 10:36:57,618 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2018-11-07 10:36:57,618 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (and (< main_~j~0 main_~n~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2018-11-07 10:36:57,618 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 34) no Hoare annotation was computed. [2018-11-07 10:36:57,618 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= (+ main_~k~0 1) main_~n~0))) [2018-11-07 10:36:57,618 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 24) no Hoare annotation was computed. [2018-11-07 10:36:57,618 INFO L425 ceAbstractionStarter]: For program point L19-1(lines 19 31) no Hoare annotation was computed. [2018-11-07 10:36:57,618 INFO L425 ceAbstractionStarter]: For program point L19-3(lines 19 31) no Hoare annotation was computed. [2018-11-07 10:36:57,618 INFO L425 ceAbstractionStarter]: For program point L15(lines 15 18) no Hoare annotation was computed. [2018-11-07 10:36:57,619 INFO L421 ceAbstractionStarter]: At program point L19-4(lines 19 31) the Hoare annotation is: (let ((.cse0 (<= main_~k~0 main_~n~0)) (.cse1 (<= main_~n~0 main_~k~0))) (or (and .cse0 (<= main_~i~0 0) .cse1) (and .cse0 .cse1 (<= main_~n~0 main_~j~0)))) [2018-11-07 10:36:57,619 INFO L425 ceAbstractionStarter]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2018-11-07 10:36:57,619 INFO L428 ceAbstractionStarter]: At program point L32(lines 10 34) the Hoare annotation is: true [2018-11-07 10:36:57,619 INFO L425 ceAbstractionStarter]: For program point L28(lines 20 30) no Hoare annotation was computed. [2018-11-07 10:36:57,619 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 30) no Hoare annotation was computed. [2018-11-07 10:36:57,619 INFO L421 ceAbstractionStarter]: At program point L20-3(lines 20 30) the Hoare annotation is: (and (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0)) [2018-11-07 10:36:57,619 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 29) no Hoare annotation was computed. [2018-11-07 10:36:57,620 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 34) no Hoare annotation was computed. [2018-11-07 10:36:57,620 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 34) the Hoare annotation is: true [2018-11-07 10:36:57,620 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 24) no Hoare annotation was computed. [2018-11-07 10:36:57,620 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 24) the Hoare annotation is: (let ((.cse0 (* 2 main_~i~0))) (and (< main_~j~0 main_~n~0) (<= .cse0 main_~j~0) (<= .cse0 main_~k~0) (<= main_~k~0 main_~n~0))) [2018-11-07 10:36:57,620 INFO L425 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-11-07 10:36:57,620 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-07 10:36:57,621 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-07 10:36:57,621 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:36:57,621 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-07 10:36:57,621 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-07 10:36:57,621 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-07 10:36:57,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 10:36:57 BoogieIcfgContainer [2018-11-07 10:36:57,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 10:36:57,635 INFO L168 Benchmark]: Toolchain (without parser) took 6333.28 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -459.4 MB). Peak memory consumption was 286.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:57,637 INFO L168 Benchmark]: CDTParser took 0.20 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-11-07 10:36:57,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.84 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:57,638 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:36:57,639 INFO L168 Benchmark]: Boogie Preprocessor took 26.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 10:36:57,639 INFO L168 Benchmark]: RCFGBuilder took 564.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:57,641 INFO L168 Benchmark]: TraceAbstraction took 5411.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 325.9 MB). Peak memory consumption was 325.9 MB. Max. memory is 7.1 GB. [2018-11-07 10:36:57,645 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.20 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 300.84 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 22.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.35 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 564.76 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5411.24 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 325.9 MB). Peak memory consumption was 325.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: 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: 20]: Loop Invariant Derived loop invariant: (2 * i <= j && k <= n) && n <= k - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((j < n && 2 * i <= j) && 2 * i <= k) && k <= n - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((k <= n && i <= 0) && n <= k) || ((k <= n && n <= k) && n <= j) - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 5.3s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 175 SDtfs, 125 SDslu, 463 SDs, 0 SdLazy, 350 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 266 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 34 PreInvPairs, 52 NumberOfFragments, 108 HoareAnnotationTreeSize, 34 FomulaSimplifications, 908 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 164 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 421 ConstructedInterpolants, 5 QuantifiedInterpolants, 29781 SizeOfPredicates, 14 NumberOfNonLiveVariables, 284 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 137/174 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...