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/reals/hamed08.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:30:26,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:30:26,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:30:26,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:30:26,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:30:26,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:30:26,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:30:26,257 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:30:26,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:30:26,259 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:30:26,260 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:30:26,261 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:30:26,261 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:30:26,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:30:26,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:30:26,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:30:26,265 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:30:26,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:30:26,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:30:26,270 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:30:26,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:30:26,273 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:30:26,274 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:30:26,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:30:26,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:30:26,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:30:26,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:30:26,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:30:26,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:30:26,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:30:26,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:30:26,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:30:26,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:30:26,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:30:26,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:30:26,289 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:30:26,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:30:26,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:30:26,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:30:26,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:30:26,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:30:26,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:30:26,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:30:26,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:30:26,349 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:30:26,350 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:30:26,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/reals/hamed08.bpl [2019-08-05 10:30:26,351 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/reals/hamed08.bpl' [2019-08-05 10:30:26,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:30:26,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:30:26,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:26,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:30:26,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:30:26,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,457 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:30:26,457 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:30:26,457 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:30:26,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:30:26,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:30:26,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:30:26,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:30:26,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,483 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/1) ... [2019-08-05 10:30:26,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:30:26,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:30:26,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:30:26,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:30:26,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (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:30:26,577 INFO L124 BoogieDeclarations]: Specification and implementation of procedure myProcedure given in one single declaration [2019-08-05 10:30:26,578 INFO L130 BoogieDeclarations]: Found specification of procedure myProcedure [2019-08-05 10:30:26,578 INFO L138 BoogieDeclarations]: Found implementation of procedure myProcedure [2019-08-05 10:30:29,931 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:30:29,932 INFO L283 CfgBuilder]: Removed 50 assume(true) statements. [2019-08-05 10:30:29,934 INFO L202 PluginConnector]: Adding new model hamed08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:29 BoogieIcfgContainer [2019-08-05 10:30:29,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:30:29,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:30:29,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:30:29,940 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:30:29,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hamed08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:30:26" (1/2) ... [2019-08-05 10:30:29,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a542552 and model type hamed08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:30:29, skipping insertion in model container [2019-08-05 10:30:29,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "hamed08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:30:29" (2/2) ... [2019-08-05 10:30:29,946 INFO L109 eAbstractionObserver]: Analyzing ICFG hamed08.bpl [2019-08-05 10:30:29,959 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:30:29,971 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-08-05 10:30:29,994 INFO L252 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-08-05 10:30:30,038 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:30:30,040 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:30:30,041 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:30:30,041 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:30:30,041 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:30:30,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:30:30,042 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:30:30,043 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:30:30,043 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:30:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-08-05 10:30:30,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:30:30,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:30,085 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:30:30,088 INFO L418 AbstractCegarLoop]: === Iteration 1 === [myProcedureErr0ASSERT_VIOLATIONASSERT, myProcedureErr1ASSERT_VIOLATIONASSERT, myProcedureErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash 51066, now seen corresponding path program 1 times [2019-08-05 10:30:30,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:30,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:30:30,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:30,515 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:30:30,521 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:30:30,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:30,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:30:30,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:30:30,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:30:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:30:30,550 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-08-05 10:30:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:30,680 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:30:30,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:30:30,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:30:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:30,699 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:30:30,700 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:30:30,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:30:30,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:30:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-08-05 10:30:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:30:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:30:30,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 3 [2019-08-05 10:30:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:30,744 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:30:30,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:30:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:30:30,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:30:30,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:30,745 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:30:30,746 INFO L418 AbstractCegarLoop]: === Iteration 2 === [myProcedureErr0ASSERT_VIOLATIONASSERT, myProcedureErr1ASSERT_VIOLATIONASSERT, myProcedureErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:30,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1583212, now seen corresponding path program 1 times [2019-08-05 10:30:30,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:30:30,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:30:30,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:30:30,963 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:30:30,980 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:30,981 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:30,983 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:30,984 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:30:31,289 WARN L188 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 9 [2019-08-05 10:30:31,291 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:30:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:30:31,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:30:31,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:30:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:30:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:30:31,294 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 4 states. [2019-08-05 10:30:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:30:31,383 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:30:31,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:30:31,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:30:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:30:31,385 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:30:31,385 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:30:31,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:30:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:30:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:30:31,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:30:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:30:31,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 4 [2019-08-05 10:30:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:30:31,389 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:30:31,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:30:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:30:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:30:31,390 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:30:31,390 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:30:31,390 INFO L418 AbstractCegarLoop]: === Iteration 3 === [myProcedureErr0ASSERT_VIOLATIONASSERT, myProcedureErr1ASSERT_VIOLATIONASSERT, myProcedureErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:30:31,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:30:31,391 INFO L82 PathProgramCache]: Analyzing trace with hash -78471823, now seen corresponding path program 1 times [2019-08-05 10:30:31,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:30:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:30:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:30:31,569 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:30:31,617 INFO L202 PluginConnector]: Adding new model hamed08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:30:31 BoogieIcfgContainer [2019-08-05 10:30:31,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:30:31,620 INFO L168 Benchmark]: Toolchain (without parser) took 5209.74 ms. Allocated memory was 141.0 MB in the beginning and 203.9 MB in the end (delta: 62.9 MB). Free memory was 110.0 MB in the beginning and 134.2 MB in the end (delta: -24.2 MB). Peak memory consumption was 38.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:31,621 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.0 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 10:30:31,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.74 ms. Allocated memory is still 141.0 MB. Free memory was 109.8 MB in the beginning and 108.0 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:30:31,623 INFO L168 Benchmark]: Boogie Preprocessor took 50.44 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:31,625 INFO L168 Benchmark]: RCFGBuilder took 3423.02 ms. Allocated memory was 141.0 MB in the beginning and 175.6 MB in the end (delta: 34.6 MB). Free memory was 106.0 MB in the beginning and 60.6 MB in the end (delta: 45.4 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:30:31,626 INFO L168 Benchmark]: TraceAbstraction took 1681.27 ms. Allocated memory was 175.6 MB in the beginning and 203.9 MB in the end (delta: 28.3 MB). Free memory was 60.6 MB in the beginning and 134.2 MB in the end (delta: -73.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:30:31,630 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 111.9 MB in the beginning and 111.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 49.74 ms. Allocated memory is still 141.0 MB. Free memory was 109.8 MB in the beginning and 108.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 50.44 ms. Allocated memory is still 141.0 MB. Free memory was 108.0 MB in the beginning and 106.0 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3423.02 ms. Allocated memory was 141.0 MB in the beginning and 175.6 MB in the end (delta: 34.6 MB). Free memory was 106.0 MB in the beginning and 60.6 MB in the end (delta: 45.4 MB). Peak memory consumption was 80.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1681.27 ms. Allocated memory was 175.6 MB in the beginning and 203.9 MB in the end (delta: 28.3 MB). Free memory was 60.6 MB in the beginning and 134.2 MB in the end (delta: -73.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 98]: assertion can be violated assertion can be violated We found a FailurePath: [L6] havoc pc0, pc1, pc2, pc3, pc4, pc5, pc6, pc7; [L7] assume ((((((pc0 == 0 && (pc1 == 0 || pc1 == 2)) && (pc2 == 0 || pc2 == 2)) && (pc3 == 0 || pc3 == 1)) && ((pc4 == 0 || pc4 == 2) || pc4 == 6)) && (pc5 == 0 || pc5 == 2)) && pc6 == 0) && (pc7 == 0 || pc7 == 1); [L8] havoc bndResG0_X2, bndResG1_X2, minDurG2_X2, minDurG3_X2; [L9] assume ((bndResG0_X2 == 0.0 && bndResG1_X2 == 0.0) && minDurG2_X2 == 0.0) && minDurG3_X2 == 0.0; VAL [bndResG0_X2=0.0, bndResG1_X2=0.0, minDurG2_X2=0.0, minDurG3_X2=0.0, pc0=0, pc1=0, pc2=0, pc3=1, pc4=2, pc5=0, pc6=0, pc7=0] [L12] havoc V0', V1', V2', V3', V4', V5', V6', delta; [L13] assume delta > 0.0; [L14] bndResG0_X2 := bndResG0_X2 + delta; [L15] bndResG1_X2 := bndResG1_X2 + delta; [L16] minDurG2_X2 := minDurG2_X2 + delta; [L17] minDurG3_X2 := minDurG3_X2 + delta; [L18] COND TRUE pc0 == 0 [L20] assume !V0; [L22] COND FALSE !(pc1 == 2) [L25] COND FALSE !(pc1 == 1) [L28] COND TRUE pc1 == 0 [L30] assume !V0 || V1; [L32] COND FALSE !(pc2 == 2) [L35] COND FALSE !(pc2 == 1) [L38] COND TRUE pc2 == 0 [L40] assume !V2 || !V3; [L42] COND FALSE !(pc3 == 2) [L45] COND TRUE pc3 == 1 [L47] assume !V3; [L52] COND FALSE !(pc4 == 6) [L55] COND FALSE !(pc4 == 5) [L58] COND FALSE !(pc4 == 4) [L61] COND FALSE !(pc4 == 3) [L64] COND TRUE pc4 == 2 [L66] assume !V4 && !V5; [L74] COND FALSE !(pc5 == 2) [L77] COND FALSE !(pc5 == 1) [L80] COND TRUE pc5 == 0 [L82] assume V6; [L84] COND TRUE pc6 == 0 [L86] assume V6; [L88] COND FALSE !(pc7 == 2) [L91] COND FALSE !(pc7 == 1) [L94] COND TRUE pc7 == 0 [L96] assume V6; VAL [bndResG0_X2=9.0, bndResG1_X2=9.0, delta=9.0, minDurG2_X2=9.0, minDurG3_X2=9.0, pc0=0, pc1=0, pc2=0, pc3=1, pc4=2, pc5=0, pc6=0, pc7=0, V0=false, V1=false, V2=false, V3=false, V4=false, V5=false, V6=true] [L98] assert (pc2 == 2 && pc3 == 2 ==> minDurG2_X2 >= 15.0 || bndResG1_X2 < 10.0) && (pc2 == 1 && pc3 == 2 ==> minDurG2_X2 >= 15.0 || bndResG1_X2 < 10.0); VAL [bndResG0_X2=9.0, bndResG1_X2=9.0, delta=9.0, minDurG2_X2=9.0, minDurG3_X2=9.0, pc0=0, pc1=0, pc2=0, pc3=1, pc4=2, pc5=0, pc6=0, pc7=0, V0=false, V1=false, V2=false, V3=false, V4=false, V5=false, V6=true] [L99] assert (pc4 == 6 && pc6 == 0 ==> false) && (pc4 == 5 && pc6 == 0 ==> false) && (pc4 == 4 && pc6 == 0 ==> false) && (pc4 == 3 && pc6 == 0 ==> false); VAL [bndResG0_X2=9.0, bndResG1_X2=9.0, delta=9.0, minDurG2_X2=9.0, minDurG3_X2=9.0, pc0=0, pc1=0, pc2=0, pc3=1, pc4=2, pc5=0, pc6=0, pc7=0, V0=false, V1=false, V2=false, V3=false, V4=false, V5=false, V6=true] [L100] assert (pc4 == 6 && pc7 == 2 ==> minDurG3_X2 >= 10.0) && (pc4 == 5 && pc7 == 2 ==> minDurG3_X2 >= 10.0) && (pc4 == 4 && pc7 == 2 ==> minDurG3_X2 >= 10.0) && (pc4 == 3 && pc7 == 2 ==> minDurG3_X2 >= 10.0); [L101] COND TRUE pc0 == 0 [L104] pc0 := 0; [L109] COND FALSE !(pc1 == 2) [L122] COND FALSE !(pc1 == 1) [L135] COND TRUE pc1 == 0 [L142] pc1 := 0; [L147] COND FALSE !(pc2 == 2) [L160] COND FALSE !(pc2 == 1) [L173] COND TRUE pc2 == 0 [L176] bndResG1_X2 := 0.0; [L177] pc2 := 2; [L185] COND FALSE !(pc3 == 2) [L198] COND TRUE pc3 == 1 [L204] minDurG2_X2 := 0.0; [L205] pc3 := 2; [L220] COND FALSE !(pc4 == 6) [L236] COND FALSE !(pc4 == 5) [L246] COND FALSE !(pc4 == 4) [L262] COND FALSE !(pc4 == 3) [L269] COND TRUE pc4 == 2 [L280] assume V4' && !V5'; [L281] pc4 := 1; [L303] COND FALSE !(pc5 == 2) [L313] COND FALSE !(pc5 == 1) [L320] COND TRUE pc5 == 0 [L326] pc5 := 1; [L331] COND TRUE pc6 == 0 [L334] pc6 := 0; [L339] COND FALSE !(pc7 == 2) [L352] COND FALSE !(pc7 == 1) [L363] COND TRUE pc7 == 0 [L369] pc7 := 0; [L374] V0 := V0'; [L375] V1 := V1'; [L376] V2 := V2'; [L377] V3 := V3'; [L378] V4 := V4'; [L379] V5 := V5'; [L380] V6 := V6'; VAL [bndResG0_X2=9.0, bndResG1_X2=0.0, delta=9.0, minDurG2_X2=0.0, minDurG3_X2=9.0, pc0=0, pc1=0, pc2=2, pc3=2, pc4=1, pc5=1, pc6=0, pc7=0, V0=false, V0'=false, V1=true, V1'=true, V2=true, V2'=true, V3=true, V3'=true, V4=true, V4'=true, V5=false, V5'=false, V6=true, V6'=true] [L12] havoc V0', V1', V2', V3', V4', V5', V6', delta; [L13] assume delta > 0.0; [L14] bndResG0_X2 := bndResG0_X2 + delta; [L15] bndResG1_X2 := bndResG1_X2 + delta; [L16] minDurG2_X2 := minDurG2_X2 + delta; [L17] minDurG3_X2 := minDurG3_X2 + delta; [L18] COND TRUE pc0 == 0 [L20] assume !V0; [L22] COND FALSE !(pc1 == 2) [L25] COND FALSE !(pc1 == 1) [L28] COND TRUE pc1 == 0 [L30] assume !V0 || V1; [L32] COND TRUE pc2 == 2 [L33] assume bndResG1_X2 <= 10.0; [L34] assume V2 && V3; [L42] COND TRUE pc3 == 2 [L43] assume minDurG2_X2 <= 15.0; [L44] assume V3; [L52] COND FALSE !(pc4 == 6) [L55] COND FALSE !(pc4 == 5) [L58] COND FALSE !(pc4 == 4) [L61] COND FALSE !(pc4 == 3) [L64] COND FALSE !(pc4 == 2) [L67] COND TRUE pc4 == 1 [L74] COND FALSE !(pc5 == 2) [L77] COND TRUE pc5 == 1 [L84] COND TRUE pc6 == 0 [L86] assume V6; [L88] COND FALSE !(pc7 == 2) [L91] COND FALSE !(pc7 == 1) [L94] COND TRUE pc7 == 0 [L96] assume V6; VAL [bndResG0_X2=19.0, bndResG1_X2=10.0, delta=10.0, minDurG2_X2=10.0, minDurG3_X2=19.0, pc0=0, pc1=0, pc2=2, pc3=2, pc4=1, pc5=1, pc6=0, pc7=0, V0=false, V1=true, V2=true, V3=true, V4=true, V5=false, V6=true] [L98] assert (pc2 == 2 && pc3 == 2 ==> minDurG2_X2 >= 15.0 || bndResG1_X2 < 10.0) && (pc2 == 1 && pc3 == 2 ==> minDurG2_X2 >= 15.0 || bndResG1_X2 < 10.0); VAL [bndResG0_X2=19.0, bndResG1_X2=10.0, delta=10.0, minDurG2_X2=10.0, minDurG3_X2=19.0, pc0=0, pc1=0, pc2=2, pc3=2, pc4=1, pc5=1, pc6=0, pc7=0, V0=false, V1=true, V2=true, V3=true, V4=true, V5=false, V6=true] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. UNSAFE Result, 1.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11 SDtfs, 9 SDslu, 6 SDs, 0 SdLazy, 16 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 3 NumberOfNonLiveVariables, 78 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...