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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_false-unreach-call2_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:45:54,370 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:45:54,373 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:45:54,390 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:45:54,391 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:45:54,393 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:45:54,395 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:45:54,397 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:45:54,400 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:45:54,400 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:45:54,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:45:54,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:45:54,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:45:54,411 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:45:54,415 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:45:54,416 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:45:54,416 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:45:54,419 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:45:54,426 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:45:54,427 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:45:54,428 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:45:54,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:45:54,431 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:45:54,432 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:45:54,432 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:45:54,433 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:45:54,433 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:45:54,434 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:45:54,435 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:45:54,436 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:45:54,436 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:45:54,437 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:45:54,437 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:45:54,437 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:45:54,438 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:45:54,439 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:45:54,439 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 12:45:54,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:45:54,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:45:54,452 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:45:54,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:45:54,453 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:45:54,453 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:45:54,453 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:45:54,454 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:45:54,454 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:45:54,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:45:54,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:45:54,454 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:45:54,455 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:45:54,455 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:45:54,456 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:45:54,497 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:45:54,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:45:54,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:45:54,521 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:45:54,522 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:45:54,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_false-unreach-call2_true-termination.i_3.bpl [2018-10-15 12:45:54,523 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/underapprox_false-unreach-call2_true-termination.i_3.bpl' [2018-10-15 12:45:54,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:45:54,574 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:45:54,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:45:54,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:45:54,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:45:54,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/1) ... [2018-10-15 12:45:54,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/1) ... [2018-10-15 12:45:54,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/1) ... [2018-10-15 12:45:54,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/1) ... [2018-10-15 12:45:54,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/1) ... [2018-10-15 12:45:54,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/1) ... [2018-10-15 12:45:54,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/1) ... [2018-10-15 12:45:54,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:45:54,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:45:54,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:45:54,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:45:54,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 12:45:54,679 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:45:54,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:45:54,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:45:54,840 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:45:54,841 INFO L202 PluginConnector]: Adding new model underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:45:54 BoogieIcfgContainer [2018-10-15 12:45:54,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:45:54,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:45:54,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:45:54,846 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:45:54,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:45:54" (1/2) ... [2018-10-15 12:45:54,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5803aafb and model type underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:45:54, skipping insertion in model container [2018-10-15 12:45:54,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:45:54" (2/2) ... [2018-10-15 12:45:54,850 INFO L112 eAbstractionObserver]: Analyzing ICFG underapprox_false-unreach-call2_true-termination.i_3.bpl [2018-10-15 12:45:54,860 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:45:54,868 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:45:54,886 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:45:54,918 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:45:54,919 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:45:54,920 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:45:54,920 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:45:54,920 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:45:54,920 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:45:54,920 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:45:54,921 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:45:54,921 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:45:54,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 12:45:54,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:45:54,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:54,957 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:54,958 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:54,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:54,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1513587635, now seen corresponding path program 1 times [2018-10-15 12:45:55,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:55,310 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-15 12:45:55,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:45:55,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:45:55,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:45:55,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:45:55,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:45:55,340 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 12:45:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:55,438 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 12:45:55,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:45:55,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:45:55,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:55,452 INFO L225 Difference]: With dead ends: 18 [2018-10-15 12:45:55,453 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 12:45:55,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:45:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 12:45:55,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-10-15 12:45:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 12:45:55,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 12:45:55,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-15 12:45:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:55,493 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 12:45:55,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:45:55,493 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 12:45:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 12:45:55,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:55,494 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:55,495 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:55,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash 485453943, now seen corresponding path program 1 times [2018-10-15 12:45:55,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:55,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:55,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:45:55,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:45:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:45:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:45:55,644 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-15 12:45:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:55,805 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-15 12:45:55,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:45:55,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-15 12:45:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:55,806 INFO L225 Difference]: With dead ends: 23 [2018-10-15 12:45:55,807 INFO L226 Difference]: Without dead ends: 23 [2018-10-15 12:45:55,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:45:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-15 12:45:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-10-15 12:45:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 12:45:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 12:45:55,812 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-15 12:45:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:55,812 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 12:45:55,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:45:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 12:45:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 12:45:55,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:55,814 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:55,814 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:55,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash -743668083, now seen corresponding path program 2 times [2018-10-15 12:45:55,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:56,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:56,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:45:56,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:45:56,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:45:56,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:45:56,253 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-10-15 12:45:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:56,549 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 12:45:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:45:56,549 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-15 12:45:56,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:56,550 INFO L225 Difference]: With dead ends: 28 [2018-10-15 12:45:56,551 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 12:45:56,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:45:56,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 12:45:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-10-15 12:45:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 12:45:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 12:45:56,557 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-15 12:45:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:56,557 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 12:45:56,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:45:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 12:45:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 12:45:56,558 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:56,559 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:56,559 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:56,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash 2067254839, now seen corresponding path program 3 times [2018-10-15 12:45:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:56,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:45:56,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:45:56,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:45:56,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:45:56,816 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-15 12:45:57,193 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 12:45:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:57,487 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 12:45:57,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:45:57,489 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-15 12:45:57,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:57,490 INFO L225 Difference]: With dead ends: 33 [2018-10-15 12:45:57,491 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 12:45:57,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:45:57,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 12:45:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-15 12:45:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:45:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:45:57,502 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-15 12:45:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:57,502 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:45:57,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:45:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:45:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:45:57,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:57,505 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:57,505 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:57,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 481870029, now seen corresponding path program 4 times [2018-10-15 12:45:57,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:57,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:57,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:45:57,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:45:57,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:45:57,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:45:57,803 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 11 states. [2018-10-15 12:45:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:58,204 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 12:45:58,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:45:58,205 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-15 12:45:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:58,206 INFO L225 Difference]: With dead ends: 38 [2018-10-15 12:45:58,206 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 12:45:58,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:45:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 12:45:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-10-15 12:45:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 12:45:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 12:45:58,213 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-15 12:45:58,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:58,214 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 12:45:58,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:45:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 12:45:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 12:45:58,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:58,216 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:58,216 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:58,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:58,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1609956343, now seen corresponding path program 5 times [2018-10-15 12:45:58,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:58,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:58,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:45:58,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:45:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:45:58,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:45:58,588 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-10-15 12:45:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:59,067 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-15 12:45:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:45:59,068 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-15 12:45:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:59,069 INFO L225 Difference]: With dead ends: 43 [2018-10-15 12:45:59,069 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 12:45:59,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:45:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 12:45:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-10-15 12:45:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:45:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 12:45:59,075 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-15 12:45:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:59,076 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 12:45:59,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:45:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 12:45:59,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:45:59,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:59,077 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:59,078 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:59,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:59,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1871631603, now seen corresponding path program 6 times [2018-10-15 12:45:59,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 12:45:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-15 12:45:59,165 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 12:45:59,200 INFO L202 PluginConnector]: Adding new model underapprox_false-unreach-call2_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:45:59 BoogieIcfgContainer [2018-10-15 12:45:59,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 12:45:59,201 INFO L168 Benchmark]: Toolchain (without parser) took 4627.36 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 232.6 MB). Peak memory consumption was 232.6 MB. Max. memory is 7.1 GB. [2018-10-15 12:45:59,203 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 12:45:59,204 INFO L168 Benchmark]: Boogie Preprocessor took 42.50 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 12:45:59,204 INFO L168 Benchmark]: RCFGBuilder took 223.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 12:45:59,205 INFO L168 Benchmark]: TraceAbstraction took 4357.66 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 7.1 GB. [2018-10-15 12:45:59,213 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.50 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 223.54 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4357.66 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.2 GB in the end (delta: 211.5 MB). Peak memory consumption was 211.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 36]: assertion can be violated assertion can be violated We found a FailurePath: [L12] havoc main_#res; [L13] havoc main_~y~0, main_#t~post0, main_~x~0; [L14] main_~x~0 := 0; VAL [main_~x~0=0] [L15] main_~y~0 := 1; VAL [main_~x~0=0, main_~y~0=1] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=0, main_~y~0=1] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=0, main_~x~0=0, main_~y~0=1] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=0, main_~x~0=1, main_~y~0=1] [L32] havoc main_#t~post0; VAL [main_~x~0=1, main_~y~0=1] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=1, main_~y~0=2] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=1, main_~y~0=2] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=1, main_~x~0=1, main_~y~0=2] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=1, main_~x~0=2, main_~y~0=2] [L32] havoc main_#t~post0; VAL [main_~x~0=2, main_~y~0=2] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=2, main_~y~0=4] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=2, main_~y~0=4] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=2, main_~x~0=2, main_~y~0=4] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=2, main_~x~0=3, main_~y~0=4] [L32] havoc main_#t~post0; VAL [main_~x~0=3, main_~y~0=4] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=3, main_~y~0=8] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=3, main_~y~0=8] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=3, main_~x~0=3, main_~y~0=8] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=3, main_~x~0=4, main_~y~0=8] [L32] havoc main_#t~post0; VAL [main_~x~0=4, main_~y~0=8] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=4, main_~y~0=16] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=4, main_~y~0=16] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=4, main_~x~0=4, main_~y~0=16] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=4, main_~x~0=5, main_~y~0=16] [L32] havoc main_#t~post0; VAL [main_~x~0=5, main_~y~0=16] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=5, main_~y~0=32] [L29] assume main_~x~0 % 4294967296 < 6; VAL [main_~x~0=5, main_~y~0=32] [L30] main_#t~post0 := main_~x~0; VAL [main_#t~post0=5, main_~x~0=5, main_~y~0=32] [L31] main_~x~0 := main_#t~post0 + 1; VAL [main_#t~post0=5, main_~x~0=6, main_~y~0=32] [L32] havoc main_#t~post0; VAL [main_~x~0=6, main_~y~0=32] [L33] main_~y~0 := 2 * main_~y~0; VAL [main_~x~0=6, main_~y~0=64] [L22] assume !(main_~x~0 % 4294967296 < 6); VAL [main_~x~0=6, main_~y~0=64] [L23] __VERIFIER_assert_#in~cond := (if !(6 == main_~x~0 % 4294967296) then 1 else 0); VAL [__VERIFIER_assert_#in~cond=0, main_~x~0=6, main_~y~0=64] [L24] havoc __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, main_~x~0=6, main_~y~0=64] [L25] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L26] assume 0 == __VERIFIER_assert_~cond; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] [L36] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~0=6, main_~y~0=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. UNSAFE Result, 4.2s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 98 SDtfs, 27 SDslu, 424 SDs, 0 SdLazy, 603 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 12 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 17059 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 0/115 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox_false-unreach-call2_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_12-45-59-228.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/underapprox_false-unreach-call2_true-termination.i_3.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_12-45-59-228.csv Received shutdown request...