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/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d380424 [2018-10-24 12:34:29,639 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-24 12:34:29,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-24 12:34:29,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-24 12:34:29,656 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-24 12:34:29,657 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-24 12:34:29,658 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-24 12:34:29,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-24 12:34:29,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-24 12:34:29,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-24 12:34:29,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-24 12:34:29,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-24 12:34:29,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-24 12:34:29,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-24 12:34:29,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-24 12:34:29,668 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-24 12:34:29,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-24 12:34:29,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-24 12:34:29,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-24 12:34:29,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-24 12:34:29,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-24 12:34:29,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-24 12:34:29,679 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-24 12:34:29,679 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-24 12:34:29,679 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-24 12:34:29,680 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-24 12:34:29,681 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-24 12:34:29,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-24 12:34:29,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-24 12:34:29,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-24 12:34:29,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-24 12:34:29,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-24 12:34:29,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-24 12:34:29,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-24 12:34:29,687 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-24 12:34:29,691 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-24 12:34:29,691 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-24 12:34:29,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-24 12:34:29,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-24 12:34:29,707 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-24 12:34:29,707 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-24 12:34:29,708 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-24 12:34:29,708 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-24 12:34:29,708 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-24 12:34:29,708 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-24 12:34:29,708 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-24 12:34:29,708 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-24 12:34:29,709 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-24 12:34:29,709 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-24 12:34:29,709 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-24 12:34:29,709 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-24 12:34:29,710 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-24 12:34:29,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-24 12:34:29,710 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-24 12:34:29,710 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-24 12:34:29,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-24 12:34:29,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-24 12:34:29,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-24 12:34:29,711 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-24 12:34:29,711 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-24 12:34:29,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-24 12:34:29,712 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-24 12:34:29,712 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-24 12:34:29,712 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-24 12:34:29,712 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-24 12:34:29,713 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-24 12:34:29,713 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-24 12:34:29,713 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-24 12:34:29,713 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-24 12:34:29,713 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-24 12:34:29,714 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-24 12:34:29,714 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-24 12:34:29,714 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-24 12:34:29,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-24 12:34:29,772 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-24 12:34:29,776 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-24 12:34:29,778 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-24 12:34:29,778 INFO L276 PluginConnector]: CDTParser initialized [2018-10-24 12:34:29,779 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-10-24 12:34:29,848 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d8c026e5b/3e973598454e4eecae160752bcb7a269/FLAGc94185cb4 [2018-10-24 12:34:30,242 INFO L298 CDTParser]: Found 1 translation units. [2018-10-24 12:34:30,243 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-10-24 12:34:30,249 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d8c026e5b/3e973598454e4eecae160752bcb7a269/FLAGc94185cb4 [2018-10-24 12:34:30,263 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/d8c026e5b/3e973598454e4eecae160752bcb7a269 [2018-10-24 12:34:30,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-24 12:34:30,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-24 12:34:30,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-24 12:34:30,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-24 12:34:30,282 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-24 12:34:30,283 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@553b5fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30, skipping insertion in model container [2018-10-24 12:34:30,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-24 12:34:30,319 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-24 12:34:30,485 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:34:30,490 INFO L189 MainTranslator]: Completed pre-run [2018-10-24 12:34:30,511 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-24 12:34:30,526 INFO L193 MainTranslator]: Completed translation [2018-10-24 12:34:30,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30 WrapperNode [2018-10-24 12:34:30,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-24 12:34:30,528 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-24 12:34:30,528 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-24 12:34:30,528 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-24 12:34:30,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,543 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-24 12:34:30,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-24 12:34:30,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-24 12:34:30,549 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-24 12:34:30,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,558 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (1/1) ... [2018-10-24 12:34:30,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-24 12:34:30,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-24 12:34:30,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-24 12:34:30,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-24 12:34:30,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (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 12:34:30,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-24 12:34:30,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-24 12:34:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-24 12:34:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-24 12:34:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-24 12:34:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-24 12:34:30,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-24 12:34:30,627 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-24 12:34:31,143 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-24 12:34:31,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:34:31 BoogieIcfgContainer [2018-10-24 12:34:31,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-24 12:34:31,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-24 12:34:31,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-24 12:34:31,148 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-24 12:34:31,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:34:30" (1/3) ... [2018-10-24 12:34:31,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59831fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:34:31, skipping insertion in model container [2018-10-24 12:34:31,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:34:30" (2/3) ... [2018-10-24 12:34:31,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59831fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:34:31, skipping insertion in model container [2018-10-24 12:34:31,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:34:31" (3/3) ... [2018-10-24 12:34:31,151 INFO L112 eAbstractionObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-10-24 12:34:31,160 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-24 12:34:31,168 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-24 12:34:31,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-24 12:34:31,216 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-24 12:34:31,217 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-24 12:34:31,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-24 12:34:31,217 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-24 12:34:31,217 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-24 12:34:31,217 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-24 12:34:31,218 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-24 12:34:31,218 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-24 12:34:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-10-24 12:34:31,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-24 12:34:31,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:31,251 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] [2018-10-24 12:34:31,253 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:31,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:31,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1899131806, now seen corresponding path program 1 times [2018-10-24 12:34:31,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:31,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:31,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:31,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:31,312 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:31,457 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 12:34:31,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-24 12:34:31,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-24 12:34:31,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:34:31,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-24 12:34:31,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-24 12:34:31,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-24 12:34:31,479 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2018-10-24 12:34:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:31,606 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2018-10-24 12:34:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-24 12:34:31,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-10-24 12:34:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:31,623 INFO L225 Difference]: With dead ends: 61 [2018-10-24 12:34:31,623 INFO L226 Difference]: Without dead ends: 32 [2018-10-24 12:34:31,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-24 12:34:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-24 12:34:31,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-10-24 12:34:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-24 12:34:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-10-24 12:34:31,681 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 21 [2018-10-24 12:34:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:31,682 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-10-24 12:34:31,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-24 12:34:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-10-24 12:34:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-24 12:34:31,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:31,685 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] [2018-10-24 12:34:31,685 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:31,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:31,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1651874812, now seen corresponding path program 1 times [2018-10-24 12:34:31,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:31,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:31,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:31,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:31,689 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:32,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:32,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:32,077 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:32,078 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-10-24 12:34:32,080 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [20], [24], [28], [33], [37], [40], [42], [46], [51], [62], [68], [71], [73], [79], [80], [81], [83] [2018-10-24 12:34:32,118 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:34:32,118 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:34:32,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:34:32,292 INFO L272 AbstractInterpreter]: Visited 23 different actions 28 times. Merged at 4 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-10-24 12:34:32,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:32,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:34:32,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:32,303 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:34:32,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:32,322 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:34:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:32,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:32,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:32,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:34:33,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:33,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:34:33,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 16 [2018-10-24 12:34:33,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:34:33,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-24 12:34:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-24 12:34:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-10-24 12:34:33,185 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-10-24 12:34:33,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:33,433 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-10-24 12:34:33,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-24 12:34:33,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-10-24 12:34:33,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:33,436 INFO L225 Difference]: With dead ends: 46 [2018-10-24 12:34:33,436 INFO L226 Difference]: Without dead ends: 44 [2018-10-24 12:34:33,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-10-24 12:34:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-24 12:34:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-10-24 12:34:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-24 12:34:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-10-24 12:34:33,447 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 26 [2018-10-24 12:34:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:33,448 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-24 12:34:33,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-24 12:34:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-10-24 12:34:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-24 12:34:33,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:33,450 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:34:33,450 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:33,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1162553418, now seen corresponding path program 1 times [2018-10-24 12:34:33,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:33,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:33,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:33,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:33,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:33,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:33,675 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:33,676 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-10-24 12:34:33,676 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [20], [24], [28], [33], [37], [40], [42], [46], [51], [54], [62], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84] [2018-10-24 12:34:33,680 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:34:33,680 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:34:33,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:34:33,799 INFO L272 AbstractInterpreter]: Visited 27 different actions 34 times. Merged at 6 different actions 6 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 13 variables. [2018-10-24 12:34:33,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:33,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:34:33,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:33,838 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:34:33,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:33,853 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:34:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:33,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:34,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:34:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-24 12:34:34,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:34:34,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-10-24 12:34:34,197 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:34:34,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-24 12:34:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-24 12:34:34,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-24 12:34:34,199 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 10 states. [2018-10-24 12:34:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:34,620 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-10-24 12:34:34,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-24 12:34:34,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-10-24 12:34:34,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:34,626 INFO L225 Difference]: With dead ends: 82 [2018-10-24 12:34:34,626 INFO L226 Difference]: Without dead ends: 59 [2018-10-24 12:34:34,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-10-24 12:34:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-24 12:34:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2018-10-24 12:34:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-24 12:34:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-10-24 12:34:34,642 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2018-10-24 12:34:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:34,642 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-10-24 12:34:34,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-24 12:34:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-10-24 12:34:34,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-24 12:34:34,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:34,645 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2018-10-24 12:34:34,645 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:34,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1325122332, now seen corresponding path program 1 times [2018-10-24 12:34:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:34,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:34,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-24 12:34:34,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:34,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:34,755 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-10-24 12:34:34,756 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [13], [17], [20], [24], [28], [33], [37], [40], [42], [46], [49], [51], [54], [58], [62], [68], [71], [73], [76], [78], [79], [80], [81], [83], [84] [2018-10-24 12:34:34,758 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-24 12:34:34,759 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-24 12:34:34,897 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-24 12:34:34,898 INFO L272 AbstractInterpreter]: Visited 29 different actions 87 times. Merged at 12 different actions 32 times. Never widened. Found 9 fixpoints after 5 different actions. Largest state had 14 variables. [2018-10-24 12:34:34,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:34,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-24 12:34:34,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:34,924 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-24 12:34:34,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:34,934 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-24 12:34:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:34,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-24 12:34:35,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:34:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 12:34:35,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-24 12:34:35,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 11 [2018-10-24 12:34:35,141 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-24 12:34:35,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-24 12:34:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-24 12:34:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-10-24 12:34:35,142 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 6 states. [2018-10-24 12:34:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:35,272 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2018-10-24 12:34:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-24 12:34:35,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-10-24 12:34:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:35,275 INFO L225 Difference]: With dead ends: 86 [2018-10-24 12:34:35,275 INFO L226 Difference]: Without dead ends: 54 [2018-10-24 12:34:35,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-10-24 12:34:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-24 12:34:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-10-24 12:34:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-24 12:34:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-10-24 12:34:35,292 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 44 [2018-10-24 12:34:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:35,292 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-10-24 12:34:35,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-24 12:34:35,293 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-10-24 12:34:35,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-24 12:34:35,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-24 12:34:35,294 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-24 12:34:35,295 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-24 12:34:35,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-24 12:34:35,295 INFO L82 PathProgramCache]: Analyzing trace with hash -908739042, now seen corresponding path program 2 times [2018-10-24 12:34:35,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-24 12:34:35,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:35,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-24 12:34:35,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-24 12:34:35,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-24 12:34:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-24 12:34:35,507 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-24 12:34:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:35,507 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-24 12:34:35,508 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-24 12:34:35,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-24 12:34:35,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-24 12:34:35,508 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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-10-24 12:34:35,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-24 12:34:35,519 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-24 12:34:35,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-10-24 12:34:35,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-24 12:34:35,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-24 12:34:35,825 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-24 12:34:35,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-24 12:34:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-24 12:34:35,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-24 12:34:35,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2018-10-24 12:34:35,961 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-24 12:34:35,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-24 12:34:35,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-24 12:34:35,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-24 12:34:35,963 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 16 states. [2018-10-24 12:34:36,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-24 12:34:36,881 INFO L93 Difference]: Finished difference Result 105 states and 121 transitions. [2018-10-24 12:34:36,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-24 12:34:36,883 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 52 [2018-10-24 12:34:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-24 12:34:36,884 INFO L225 Difference]: With dead ends: 105 [2018-10-24 12:34:36,884 INFO L226 Difference]: Without dead ends: 0 [2018-10-24 12:34:36,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2018-10-24 12:34:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-24 12:34:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-24 12:34:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-24 12:34:36,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-24 12:34:36,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-10-24 12:34:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-24 12:34:36,888 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-24 12:34:36,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-24 12:34:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-24 12:34:36,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-24 12:34:36,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-24 12:34:37,077 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-10-24 12:34:37,235 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-10-24 12:34:37,495 WARN L179 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 32 [2018-10-24 12:34:37,527 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:34:37,528 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:34:37,528 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:34:37,528 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-24 12:34:37,528 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-24 12:34:37,528 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-24 12:34:37,528 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-24 12:34:37,529 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-10-24 12:34:37,529 INFO L421 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse2 (* 3 main_~i~0))) (let ((.cse0 (< main_~i~0 main_~n~0)) (.cse1 (<= (+ main_~k~0 2) .cse2))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) .cse1) (and (<= 2 main_~i~0) (< main_~j~0 .cse2) .cse0 (<= (* 2 main_~i~0) main_~j~0) .cse1)))) [2018-10-24 12:34:37,529 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 23) no Hoare annotation was computed. [2018-10-24 12:34:37,529 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-10-24 12:34:37,529 INFO L425 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2018-10-24 12:34:37,529 INFO L428 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2018-10-24 12:34:37,530 INFO L425 ceAbstractionStarter]: For program point L20-1(lines 20 23) no Hoare annotation was computed. [2018-10-24 12:34:37,530 INFO L425 ceAbstractionStarter]: For program point L20-3(lines 20 23) no Hoare annotation was computed. [2018-10-24 12:34:37,530 INFO L425 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2018-10-24 12:34:37,530 INFO L421 ceAbstractionStarter]: At program point L20-4(lines 20 23) the Hoare annotation is: (or (and (<= 1 main_~i~0) (<= main_~j~0 (* 2 main_~i~0))) (<= 2 main_~i~0) (and (<= 0 main_~i~0) (<= main_~i~0 0))) [2018-10-24 12:34:37,530 INFO L425 ceAbstractionStarter]: For program point L21-1(lines 21 23) no Hoare annotation was computed. [2018-10-24 12:34:37,530 INFO L425 ceAbstractionStarter]: For program point L21-3(lines 21 23) no Hoare annotation was computed. [2018-10-24 12:34:37,530 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-10-24 12:34:37,531 INFO L421 ceAbstractionStarter]: At program point L21-4(lines 21 23) the Hoare annotation is: (let ((.cse4 (* 2 main_~i~0))) (let ((.cse0 (<= 1 main_~i~0)) (.cse3 (<= main_~j~0 .cse4)) (.cse1 (< main_~i~0 main_~n~0)) (.cse2 (<= .cse4 main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= main_~j~0 (+ main_~k~0 1)) .cse2) (and (<= (* 3 main_~i~0) main_~j~0) (<= 0 main_~i~0) .cse1 .cse3) (and (<= 2 main_~i~0) .cse1 .cse2)))) [2018-10-24 12:34:37,531 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-10-24 12:34:37,531 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2018-10-24 12:34:37,531 INFO L425 ceAbstractionStarter]: For program point L22-1(lines 22 23) no Hoare annotation was computed. [2018-10-24 12:34:37,531 INFO L421 ceAbstractionStarter]: At program point L22-3(lines 22 23) the Hoare annotation is: (let ((.cse1 (* 3 main_~i~0)) (.cse0 (< main_~i~0 main_~n~0)) (.cse2 (<= (* 2 main_~i~0) main_~j~0))) (or (and (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= main_~i~0 main_~k~0))) .cse0 (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (<= (* 2 main_~i~0) main_~j~0) (<= main_~k~0 main_~i~0))) (<= main_~i~0 1) (<= (+ main_~k~0 2) .cse1)) (and (<= 2 main_~i~0) (< main_~j~0 .cse1) .cse0 .cse2) (and (<= 1 main_~i~0) (exists ((main_~i~0 Int)) (and (<= main_~j~0 (* 2 main_~i~0)) (<= main_~i~0 1) (<= (+ main_~i~0 1) main_~k~0))) .cse0 .cse2))) [2018-10-24 12:34:37,531 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-10-24 12:34:37,532 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-10-24 12:34:37,532 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-10-24 12:34:37,532 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:34:37,532 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-10-24 12:34:37,532 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-10-24 12:34:37,532 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-10-24 12:34:37,548 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,550 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,550 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,550 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,550 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,551 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,552 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,553 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,553 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,553 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,554 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,555 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:34:37 BoogieIcfgContainer [2018-10-24 12:34:37,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-24 12:34:37,559 INFO L168 Benchmark]: Toolchain (without parser) took 7283.58 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -376.1 MB). Peak memory consumption was 352.2 MB. Max. memory is 7.1 GB. [2018-10-24 12:34:37,560 INFO L168 Benchmark]: CDTParser took 0.20 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-10-24 12:34:37,561 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.95 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-10-24 12:34:37,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.68 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-10-24 12:34:37,562 INFO L168 Benchmark]: Boogie Preprocessor took 22.74 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-10-24 12:34:37,563 INFO L168 Benchmark]: RCFGBuilder took 571.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-10-24 12:34:37,564 INFO L168 Benchmark]: TraceAbstraction took 6413.40 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 389.8 MB). Peak memory consumption was 389.8 MB. Max. memory is 7.1 GB. [2018-10-24 12:34:37,569 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.95 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 20.68 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 22.74 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 571.85 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 728.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -776.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6413.40 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 389.8 MB). Peak memory consumption was 389.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] * 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: 21]: Loop Invariant Derived loop invariant: (((((1 <= i && i < n) && 2 * i <= j) && j <= 2 * i) || (((1 <= i && i < n) && j <= k + 1) && 2 * i <= j)) || (((3 * i <= j && 0 <= i) && i < n) && j <= 2 * i)) || ((2 <= i && i < n) && 2 * i <= j) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant [2018-10-24 12:34:37,584 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,592 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,592 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,592 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,593 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,594 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,594 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,594 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,598 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,599 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,599 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,599 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] [2018-10-24 12:34:37,599 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~0,QUANTIFIED] Derived loop invariant: ((((((\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 <= k) && i < n) && (\exists main_~i~0 : int :: (1 <= main_~i~0 && 2 * main_~i~0 <= j) && k <= main_~i~0)) && i <= 1) && k + 2 <= 3 * i) || (((2 <= i && j < 3 * i) && i < n) && 2 * i <= j)) || (((1 <= i && (\exists main_~i~0 : int :: (j <= 2 * main_~i~0 && main_~i~0 <= 1) && main_~i~0 + 1 <= k)) && i < n) && 2 * i <= j) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((1 <= i && j <= 2 * i) || 2 <= i) || (0 <= i && i <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 32 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 136 SDtfs, 131 SDslu, 548 SDs, 0 SdLazy, 499 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 289 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.5s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 22 PreInvPairs, 45 NumberOfFragments, 240 HoareAnnotationTreeSize, 22 FomulaSimplifications, 503 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 85 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 333 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 476 ConstructedInterpolants, 15 QuantifiedInterpolants, 49236 SizeOfPredicates, 16 NumberOfNonLiveVariables, 282 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 204/252 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...