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/20170304-DifficultPathPrograms/underapprox2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:38:45,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:38:45,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:38:45,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:38:45,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:38:45,954 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:38:45,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:38:45,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:38:45,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:38:45,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:38:45,960 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:38:45,961 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:38:45,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:38:45,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:38:45,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:38:45,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:38:45,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:38:45,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:38:45,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:38:45,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:38:45,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:38:45,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:38:45,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:38:45,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:38:45,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:38:45,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:38:45,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:38:45,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:38:45,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:38:45,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:38:45,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:38:45,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:38:45,983 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:38:45,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:38:45,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:38:45,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:38:45,988 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:38:45,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:38:45,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:38:45,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:38:45,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:38:46,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:38:46,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:38:46,042 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:38:46,044 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:38:46,044 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:38:46,045 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox2.i_3.bpl [2019-08-04 21:38:46,045 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/underapprox2.i_3.bpl' [2019-08-04 21:38:46,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:38:46,080 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:38:46,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:46,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:38:46,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:38:46,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,106 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:38:46,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:38:46,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:38:46,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:38:46,125 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,127 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/1) ... [2019-08-04 21:38:46,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:38:46,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:38:46,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:38:46,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:38:46,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (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-04 21:38:46,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:38:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:38:46,439 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:38:46,440 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-04 21:38:46,441 INFO L202 PluginConnector]: Adding new model underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:46 BoogieIcfgContainer [2019-08-04 21:38:46,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:38:46,443 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:38:46,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:38:46,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:38:46,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:38:46" (1/2) ... [2019-08-04 21:38:46,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61994473 and model type underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:38:46, skipping insertion in model container [2019-08-04 21:38:46,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:38:46" (2/2) ... [2019-08-04 21:38:46,450 INFO L109 eAbstractionObserver]: Analyzing ICFG underapprox2.i_3.bpl [2019-08-04 21:38:46,460 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:38:46,468 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-04 21:38:46,485 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-04 21:38:46,529 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:38:46,530 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:38:46,530 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:38:46,530 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:38:46,530 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:38:46,530 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:38:46,531 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:38:46,531 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:38:46,531 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:38:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-04 21:38:46,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-04 21:38:46,566 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:46,568 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-04 21:38:46,573 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:46,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:46,581 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-04 21:38:46,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:46,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-04 21:38:46,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:46,738 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-04 21:38:46,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:38:46,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-04 21:38:46,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-04 21:38:46,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-04 21:38:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:46,762 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-04 21:38:46,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:46,790 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-04 21:38:46,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-04 21:38:46,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-04 21:38:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:46,803 INFO L225 Difference]: With dead ends: 5 [2019-08-04 21:38:46,804 INFO L226 Difference]: Without dead ends: 5 [2019-08-04 21:38:46,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-04 21:38:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-04 21:38:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-04 21:38:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-04 21:38:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-04 21:38:46,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-04 21:38:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:46,838 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-04 21:38:46,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-04 21:38:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-04 21:38:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-04 21:38:46,839 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:46,839 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-04 21:38:46,840 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:46,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-04 21:38:46,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:46,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-04 21:38:46,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-04 21:38:47,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:38:47,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:38:47,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:47,042 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-04 21:38:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,153 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-04 21:38:47,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:38:47,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-04 21:38:47,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,155 INFO L225 Difference]: With dead ends: 6 [2019-08-04 21:38:47,155 INFO L226 Difference]: Without dead ends: 6 [2019-08-04 21:38:47,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:38:47,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-04 21:38:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-04 21:38:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-04 21:38:47,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-04 21:38:47,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-04 21:38:47,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,159 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-04 21:38:47,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:38:47,160 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-04 21:38:47,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-04 21:38:47,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,160 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-04 21:38:47,161 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,161 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-04 21:38:47,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-04 21:38:47,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:38:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:38:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:47,275 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-04 21:38:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,350 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-04 21:38:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-04 21:38:47,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-04 21:38:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,352 INFO L225 Difference]: With dead ends: 7 [2019-08-04 21:38:47,352 INFO L226 Difference]: Without dead ends: 7 [2019-08-04 21:38:47,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:38:47,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-04 21:38:47,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-04 21:38:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-04 21:38:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-04 21:38:47,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-04 21:38:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,357 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-04 21:38:47,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:38:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-04 21:38:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-04 21:38:47,358 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,359 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-04 21:38:47,359 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,360 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-04 21:38:47,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:38:47,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:38:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:38:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:47,509 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-04 21:38:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,590 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-04 21:38:47,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:38:47,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-04 21:38:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,602 INFO L225 Difference]: With dead ends: 8 [2019-08-04 21:38:47,603 INFO L226 Difference]: Without dead ends: 8 [2019-08-04 21:38:47,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:38:47,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-04 21:38:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-04 21:38:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-04 21:38:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-04 21:38:47,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-04 21:38:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,608 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-04 21:38:47,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:38:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-04 21:38:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:38:47,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,610 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-04 21:38:47,610 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-04 21:38:47,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:47,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-04 21:38:47,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:47,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:47,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:47,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:38:47,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:38:47,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:38:47,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:47,778 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-04 21:38:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:47,977 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-04 21:38:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-04 21:38:47,978 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-04 21:38:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:47,978 INFO L225 Difference]: With dead ends: 9 [2019-08-04 21:38:47,979 INFO L226 Difference]: Without dead ends: 9 [2019-08-04 21:38:47,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:38:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-04 21:38:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-04 21:38:47,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-04 21:38:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-04 21:38:47,982 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-04 21:38:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:47,982 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-04 21:38:47,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:38:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-04 21:38:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-04 21:38:47,983 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:47,983 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-04 21:38:47,983 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:47,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-04 21:38:47,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:38:48,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-04 21:38:48,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:38:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:38:48,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:38:48,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:38:48,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:38:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:38:48,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:48,169 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-04 21:38:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:38:48,335 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-04 21:38:48,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-04 21:38:48,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-04 21:38:48,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:38:48,336 INFO L225 Difference]: With dead ends: 10 [2019-08-04 21:38:48,337 INFO L226 Difference]: Without dead ends: 10 [2019-08-04 21:38:48,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:38:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-04 21:38:48,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-04 21:38:48,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-04 21:38:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-04 21:38:48,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-04 21:38:48,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:38:48,340 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-04 21:38:48,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:38:48,340 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-04 21:38:48,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-04 21:38:48,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:38:48,341 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-04 21:38:48,341 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:38:48,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:38:48,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-04 21:38:48,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:38:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-04 21:38:48,420 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-04 21:38:48,441 INFO L202 PluginConnector]: Adding new model underapprox2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:38:48 BoogieIcfgContainer [2019-08-04 21:38:48,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:38:48,444 INFO L168 Benchmark]: Toolchain (without parser) took 2363.06 ms. Allocated memory was 140.5 MB in the beginning and 177.2 MB in the end (delta: 36.7 MB). Free memory was 110.0 MB in the beginning and 120.0 MB in the end (delta: -10.0 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:48,445 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-04 21:38:48,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.01 ms. Allocated memory is still 140.5 MB. Free memory was 109.6 MB in the beginning and 108.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:48,447 INFO L168 Benchmark]: Boogie Preprocessor took 21.02 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:48,448 INFO L168 Benchmark]: RCFGBuilder took 305.33 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 97.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:48,450 INFO L168 Benchmark]: TraceAbstraction took 1998.86 ms. Allocated memory was 140.5 MB in the beginning and 177.2 MB in the end (delta: 36.7 MB). Free memory was 97.6 MB in the beginning and 120.0 MB in the end (delta: -22.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:38:48,458 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 140.5 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.01 ms. Allocated memory is still 140.5 MB. Free memory was 109.6 MB in the beginning and 108.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.02 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 107.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 305.33 ms. Allocated memory is still 140.5 MB. Free memory was 107.0 MB in the beginning and 97.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1998.86 ms. Allocated memory was 140.5 MB in the beginning and 177.2 MB in the end (delta: 36.7 MB). Free memory was 97.6 MB in the beginning and 120.0 MB in the end (delta: -22.4 MB). Peak memory consumption was 14.3 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: [L10] havoc main_#res; [L11] havoc main_#t~post0, main_~x~4, main_~y~4; [L12] main_~x~4 := 0; [L13] main_~y~4 := 1; VAL [main_~x~4=0, main_~y~4=1] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=1, main_~y~4=2] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=2, main_~y~4=4] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=3, main_~y~4=8] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=4, main_~y~4=16] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=5, main_~y~4=32] [L29] assume !!(main_~x~4 % 4294967296 < 6); [L30] main_#t~post0 := main_~x~4; [L31] main_~x~4 := main_#t~post0 + 1; [L32] havoc main_#t~post0; [L33] main_~y~4 := main_~y~4 * 2; VAL [main_~x~4=6, main_~y~4=64] [L21] assume !(main_~x~4 % 4294967296 < 6); [L22] __VERIFIER_assert_#in~cond := (if main_~x~4 % 4294967296 != 6 then 1 else 0); [L23] havoc __VERIFIER_assert_~cond; [L24] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L25] assume __VERIFIER_assert_~cond == 0; [L26] assume !false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] [L36] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~x~4=6, main_~y~4=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 1.9s OverallTime, 7 OverallIterations, 6 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 0 SDslu, 21 SDs, 0 SdLazy, 133 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 363 SizeOfPredicates, 6 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 0/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...