java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/InfeasibleCoreExamples.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:42:18,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:42:18,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:42:18,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:42:18,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:42:18,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:42:18,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:42:18,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:42:18,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:42:18,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:42:18,486 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:42:18,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:42:18,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:42:18,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:42:18,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:42:18,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:42:18,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:42:18,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:42:18,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:42:18,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:42:18,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:42:18,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:42:18,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:42:18,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:42:18,503 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:42:18,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:42:18,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:42:18,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:42:18,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:42:18,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:42:18,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:42:18,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:42:18,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:42:18,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:42:18,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:42:18,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:42:18,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:42:18,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:42:18,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:42:18,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:42:18,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:42:18,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:42:18,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:42:18,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:42:18,593 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:42:18,593 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:42:18,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InfeasibleCoreExamples.bpl [2019-08-05 10:42:18,594 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InfeasibleCoreExamples.bpl' [2019-08-05 10:42:18,646 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:42:18,648 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:42:18,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:18,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:42:18,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:42:18,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,678 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,685 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:42:18,685 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:42:18,685 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:42:18,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:18,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:42:18,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:42:18,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:42:18,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,702 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,708 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,715 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/1) ... [2019-08-05 10:42:18,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:42:18,719 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:42:18,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:42:18,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:42:18,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (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 [2019-08-05 10:42:18,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure slicing given in one single declaration [2019-08-05 10:42:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure slicing [2019-08-05 10:42:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure slicing [2019-08-05 10:42:18,788 INFO L124 BoogieDeclarations]: Specification and implementation of procedure noMemleak given in one single declaration [2019-08-05 10:42:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure noMemleak [2019-08-05 10:42:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure noMemleak [2019-08-05 10:42:18,789 INFO L124 BoogieDeclarations]: Specification and implementation of procedure nonlinearInvariant given in one single declaration [2019-08-05 10:42:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure nonlinearInvariant [2019-08-05 10:42:18,789 INFO L138 BoogieDeclarations]: Found implementation of procedure nonlinearInvariant [2019-08-05 10:42:18,789 INFO L124 BoogieDeclarations]: Specification and implementation of procedure LandesVersicherungsAnstalt given in one single declaration [2019-08-05 10:42:18,789 INFO L130 BoogieDeclarations]: Found specification of procedure LandesVersicherungsAnstalt [2019-08-05 10:42:18,790 INFO L138 BoogieDeclarations]: Found implementation of procedure LandesVersicherungsAnstalt [2019-08-05 10:42:18,790 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sign given in one single declaration [2019-08-05 10:42:18,790 INFO L130 BoogieDeclarations]: Found specification of procedure sign [2019-08-05 10:42:18,790 INFO L138 BoogieDeclarations]: Found implementation of procedure sign [2019-08-05 10:42:18,791 INFO L124 BoogieDeclarations]: Specification and implementation of procedure replaceAssingmentByHavoc given in one single declaration [2019-08-05 10:42:18,791 INFO L130 BoogieDeclarations]: Found specification of procedure replaceAssingmentByHavoc [2019-08-05 10:42:18,791 INFO L138 BoogieDeclarations]: Found implementation of procedure replaceAssingmentByHavoc [2019-08-05 10:42:18,791 INFO L124 BoogieDeclarations]: Specification and implementation of procedure firstElementUntouched given in one single declaration [2019-08-05 10:42:18,792 INFO L130 BoogieDeclarations]: Found specification of procedure firstElementUntouched [2019-08-05 10:42:18,792 INFO L138 BoogieDeclarations]: Found implementation of procedure firstElementUntouched [2019-08-05 10:42:19,350 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:42:19,350 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-08-05 10:42:19,351 INFO L202 PluginConnector]: Adding new model InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:19 BoogieIcfgContainer [2019-08-05 10:42:19,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:42:19,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:42:19,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:42:19,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:42:19,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:18" (1/2) ... [2019-08-05 10:42:19,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cd342e and model type InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:42:19, skipping insertion in model container [2019-08-05 10:42:19,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:19" (2/2) ... [2019-08-05 10:42:19,360 INFO L109 eAbstractionObserver]: Analyzing ICFG InfeasibleCoreExamples.bpl [2019-08-05 10:42:19,369 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:42:19,377 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-08-05 10:42:19,394 INFO L252 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-08-05 10:42:19,420 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:42:19,421 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:42:19,421 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:42:19,421 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:42:19,421 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:42:19,421 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:42:19,422 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:42:19,422 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:42:19,422 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:42:19,437 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-08-05 10:42:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:19,445 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,446 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:19,449 INFO L418 AbstractCegarLoop]: === Iteration 1 === [slicingErr0ASSERT_VIOLATIONASSERT, noMemleakErr0ASSERT_VIOLATIONASSERT, nonlinearInvariantErr0ASSERT_VIOLATIONASSERT, LandesVersicherungsAnstaltErr0ASSERT_VIOLATIONASSERT, signErr0ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr1ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr0ASSERT_VIOLATIONASSERT, firstElementUntouchedErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2119, now seen corresponding path program 1 times [2019-08-05 10:42:19,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:19,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:19,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:19,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,606 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2019-08-05 10:42:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,665 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2019-08-05 10:42:19,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:19,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:19,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,678 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:42:19,678 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:42:19,680 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:42:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:42:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:42:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2019-08-05 10:42:19,715 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 2 [2019-08-05 10:42:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,715 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2019-08-05 10:42:19,715 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2019-08-05 10:42:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:19,716 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:19,717 INFO L418 AbstractCegarLoop]: === Iteration 2 === [slicingErr0ASSERT_VIOLATIONASSERT, noMemleakErr0ASSERT_VIOLATIONASSERT, nonlinearInvariantErr0ASSERT_VIOLATIONASSERT, LandesVersicherungsAnstaltErr0ASSERT_VIOLATIONASSERT, signErr0ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr1ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr0ASSERT_VIOLATIONASSERT, firstElementUntouchedErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1255, now seen corresponding path program 1 times [2019-08-05 10:42:19,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:19,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:19,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:19,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:19,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:19,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,744 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 3 states. [2019-08-05 10:42:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,759 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2019-08-05 10:42:19,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:19,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,761 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:42:19,761 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:42:19,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:42:19,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:42:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:42:19,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2019-08-05 10:42:19,765 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 2 [2019-08-05 10:42:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,766 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2019-08-05 10:42:19,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2019-08-05 10:42:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:19,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,767 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:19,767 INFO L418 AbstractCegarLoop]: === Iteration 3 === [slicingErr0ASSERT_VIOLATIONASSERT, noMemleakErr0ASSERT_VIOLATIONASSERT, nonlinearInvariantErr0ASSERT_VIOLATIONASSERT, LandesVersicherungsAnstaltErr0ASSERT_VIOLATIONASSERT, signErr0ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr1ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr0ASSERT_VIOLATIONASSERT, firstElementUntouchedErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,768 INFO L82 PathProgramCache]: Analyzing trace with hash 2404, now seen corresponding path program 1 times [2019-08-05 10:42:19,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:19,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:19,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:19,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,786 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 3 states. [2019-08-05 10:42:19,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,790 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2019-08-05 10:42:19,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:19,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:19,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,791 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:42:19,791 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:42:19,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:42:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:42:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:42:19,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2019-08-05 10:42:19,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 2 [2019-08-05 10:42:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,795 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2019-08-05 10:42:19,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:19,795 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2019-08-05 10:42:19,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:19,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,796 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:19,797 INFO L418 AbstractCegarLoop]: === Iteration 4 === [slicingErr0ASSERT_VIOLATIONASSERT, noMemleakErr0ASSERT_VIOLATIONASSERT, nonlinearInvariantErr0ASSERT_VIOLATIONASSERT, LandesVersicherungsAnstaltErr0ASSERT_VIOLATIONASSERT, signErr0ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr1ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr0ASSERT_VIOLATIONASSERT, firstElementUntouchedErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,797 INFO L82 PathProgramCache]: Analyzing trace with hash 2727, now seen corresponding path program 1 times [2019-08-05 10:42:19,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:42:19,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:42:19,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:42:19,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:42:19,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 10:42:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:19,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:19,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:19,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:19,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:19,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,929 INFO L87 Difference]: Start difference. First operand 15 states and 14 transitions. Second operand 3 states. [2019-08-05 10:42:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,951 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2019-08-05 10:42:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:19,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,952 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:42:19,952 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:42:19,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:42:19,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:42:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:42:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2019-08-05 10:42:19,955 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 2 [2019-08-05 10:42:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,956 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2019-08-05 10:42:19,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2019-08-05 10:42:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:19,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,957 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:19,957 INFO L418 AbstractCegarLoop]: === Iteration 5 === [slicingErr0ASSERT_VIOLATIONASSERT, noMemleakErr0ASSERT_VIOLATIONASSERT, nonlinearInvariantErr0ASSERT_VIOLATIONASSERT, LandesVersicherungsAnstaltErr0ASSERT_VIOLATIONASSERT, signErr0ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr1ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr0ASSERT_VIOLATIONASSERT, firstElementUntouchedErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,958 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2019-08-05 10:42:19,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:19,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:19,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:19,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:19,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:19,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,973 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 3 states. [2019-08-05 10:42:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,975 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2019-08-05 10:42:19,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:19,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,976 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:42:19,976 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:42:19,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:42:19,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:42:19,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:42:19,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 12 transitions. [2019-08-05 10:42:19,981 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 12 transitions. Word has length 2 [2019-08-05 10:42:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,981 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 12 transitions. [2019-08-05 10:42:19,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:19,982 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 12 transitions. [2019-08-05 10:42:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:19,982 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,982 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:19,983 INFO L418 AbstractCegarLoop]: === Iteration 6 === [slicingErr0ASSERT_VIOLATIONASSERT, noMemleakErr0ASSERT_VIOLATIONASSERT, nonlinearInvariantErr0ASSERT_VIOLATIONASSERT, LandesVersicherungsAnstaltErr0ASSERT_VIOLATIONASSERT, signErr0ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr1ASSERT_VIOLATIONASSERT, replaceAssingmentByHavocErr0ASSERT_VIOLATIONASSERT, firstElementUntouchedErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1543, now seen corresponding path program 1 times [2019-08-05 10:42:19,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,994 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-08-05 10:42:19,994 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2019-08-05 10:42:19,994 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:42:20,012 WARN L226 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-08-05 10:42:20,013 INFO L202 PluginConnector]: Adding new model InfeasibleCoreExamples.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:42:20 BoogieIcfgContainer [2019-08-05 10:42:20,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:42:20,016 INFO L168 Benchmark]: Toolchain (without parser) took 1366.74 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 109.5 MB in the beginning and 140.3 MB in the end (delta: -30.8 MB). Peak memory consumption was 4.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:20,017 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:42:20,019 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:20,020 INFO L168 Benchmark]: Boogie Preprocessor took 30.03 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:20,023 INFO L168 Benchmark]: RCFGBuilder took 633.06 ms. Allocated memory is still 141.0 MB. Free memory was 106.2 MB in the beginning and 90.3 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:20,024 INFO L168 Benchmark]: TraceAbstraction took 659.82 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 90.1 MB in the beginning and 140.3 MB in the end (delta: -50.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:42:20,035 INFO L335 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.23 ms. Allocated memory is still 141.0 MB. Free memory was 110.8 MB in the beginning and 110.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.33 ms. Allocated memory is still 141.0 MB. Free memory was 109.3 MB in the beginning and 107.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.03 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 106.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 633.06 ms. Allocated memory is still 141.0 MB. Free memory was 106.2 MB in the beginning and 90.3 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 659.82 ms. Allocated memory was 141.0 MB in the beginning and 176.7 MB in the end (delta: 35.7 MB). Free memory was 90.1 MB in the beginning and 140.3 MB in the end (delta: -50.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 70]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L64] assume x * y > 0; [L65] tmp := y; [L70] assert x >= 0 ==> tmp >= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 29 locations, 8 error locations. UNKNOWN Result, 0.6s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 3 SDslu, 73 SDs, 0 SdLazy, 6 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 32 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...