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/regression/bpl/EuclideanIntegerDivision.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:08:19,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:08:19,746 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:08:19,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:08:19,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:08:19,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:08:19,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:08:19,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:08:19,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:08:19,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:08:19,765 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:08:19,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:08:19,766 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:08:19,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:08:19,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:08:19,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:08:19,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:08:19,771 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:08:19,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:08:19,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:08:19,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:08:19,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:08:19,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:08:19,780 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:08:19,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:08:19,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:08:19,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:08:19,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:08:19,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:08:19,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:08:19,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:08:19,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:08:19,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:08:19,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:08:19,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:08:19,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:08:19,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:08:19,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:08:19,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:08:19,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:08:19,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:08:19,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:08:19,832 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:08:19,836 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:08:19,838 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:08:19,838 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:08:19,839 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/EuclideanIntegerDivision.bpl [2019-08-05 11:08:19,839 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/regression/bpl/EuclideanIntegerDivision.bpl' [2019-08-05 11:08:19,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:08:19,880 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:08:19,881 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:19,881 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:08:19,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:08:19,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,916 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:08:19,917 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:08:19,917 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:08:19,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:08:19,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:08:19,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:08:19,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:08:19,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,934 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,934 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,939 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/1) ... [2019-08-05 11:08:19,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:08:19,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:08:19,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:08:19,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:08:19,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (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 11:08:20,017 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:08:20,018 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:08:20,018 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:08:20,485 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:08:20,485 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:08:20,486 INFO L202 PluginConnector]: Adding new model EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:20 BoogieIcfgContainer [2019-08-05 11:08:20,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:08:20,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:08:20,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:08:20,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:08:20,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:08:19" (1/2) ... [2019-08-05 11:08:20,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a76e19 and model type EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:08:20, skipping insertion in model container [2019-08-05 11:08:20,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:08:20" (2/2) ... [2019-08-05 11:08:20,499 INFO L109 eAbstractionObserver]: Analyzing ICFG EuclideanIntegerDivision.bpl [2019-08-05 11:08:20,508 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:08:20,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-08-05 11:08:20,533 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-08-05 11:08:20,562 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:08:20,563 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:08:20,564 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:08:20,564 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:08:20,564 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:08:20,564 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:08:20,565 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:08:20,565 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:08:20,565 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:08:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-08-05 11:08:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 11:08:20,595 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:20,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 11:08:20,599 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:20,607 INFO L82 PathProgramCache]: Analyzing trace with hash 962, now seen corresponding path program 1 times [2019-08-05 11:08:20,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:20,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:20,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:20,742 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 11:08:20,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:20,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:20,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:20,766 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2019-08-05 11:08:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:20,919 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-08-05 11:08:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:20,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 11:08:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:20,931 INFO L225 Difference]: With dead ends: 31 [2019-08-05 11:08:20,931 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:08:20,934 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 11:08:20,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:08:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 11:08:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:08:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 29 transitions. [2019-08-05 11:08:20,972 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 29 transitions. Word has length 2 [2019-08-05 11:08:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:20,973 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 29 transitions. [2019-08-05 11:08:20,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 29 transitions. [2019-08-05 11:08:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:08:20,973 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:20,973 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:08:20,974 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:20,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:20,975 INFO L82 PathProgramCache]: Analyzing trace with hash 29856, now seen corresponding path program 1 times [2019-08-05 11:08:20,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:20,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:20,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:20,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,008 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 11:08:21,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:21,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:08:21,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:21,011 INFO L87 Difference]: Start difference. First operand 30 states and 29 transitions. Second operand 3 states. [2019-08-05 11:08:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,068 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2019-08-05 11:08:21,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:21,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:08:21,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,070 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:08:21,070 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:08:21,071 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-05 11:08:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:08:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 11:08:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:08:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2019-08-05 11:08:21,076 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 3 [2019-08-05 11:08:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,076 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2019-08-05 11:08:21,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:21,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2019-08-05 11:08:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:08:21,077 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,077 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:08:21,078 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,079 INFO L82 PathProgramCache]: Analyzing trace with hash 925572, now seen corresponding path program 1 times [2019-08-05 11:08:21,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,129 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 11:08:21,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:21,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:21,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:21,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:21,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:21,131 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 3 states. [2019-08-05 11:08:21,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,228 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2019-08-05 11:08:21,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:21,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-08-05 11:08:21,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,231 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:08:21,231 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:08:21,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 11:08:21,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:08:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:08:21,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:08:21,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2019-08-05 11:08:21,236 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 4 [2019-08-05 11:08:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,236 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2019-08-05 11:08:21,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:21,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2019-08-05 11:08:21,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:08:21,237 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 11:08:21,238 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,238 INFO L82 PathProgramCache]: Analyzing trace with hash 889475910, now seen corresponding path program 1 times [2019-08-05 11:08:21,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,298 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 11:08:21,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:21,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:21,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:21,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:21,300 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand 3 states. [2019-08-05 11:08:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,477 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-08-05 11:08:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:21,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 11:08:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,480 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:08:21,481 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:08:21,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 11:08:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:08:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:08:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:08:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-08-05 11:08:21,485 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 6 [2019-08-05 11:08:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,486 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-08-05 11:08:21,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-08-05 11:08:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:08:21,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:21,487 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1803949476, now seen corresponding path program 1 times [2019-08-05 11:08:21,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,522 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 11:08:21,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:21,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:21,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:21,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:21,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:21,524 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 3 states. [2019-08-05 11:08:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,587 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2019-08-05 11:08:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:21,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-08-05 11:08:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,590 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:08:21,590 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:08:21,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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 11:08:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:08:21,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:08:21,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:08:21,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2019-08-05 11:08:21,595 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 7 [2019-08-05 11:08:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,595 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2019-08-05 11:08:21,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2019-08-05 11:08:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:08:21,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:21,597 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,597 INFO L82 PathProgramCache]: Analyzing trace with hash 87858952, now seen corresponding path program 1 times [2019-08-05 11:08:21,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,627 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 11:08:21,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:21,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:21,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:21,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:21,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:21,629 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand 3 states. [2019-08-05 11:08:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,727 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2019-08-05 11:08:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:21,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 11:08:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,728 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:08:21,729 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:08:21,729 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 11:08:21,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:08:21,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:08:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:08:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 20 transitions. [2019-08-05 11:08:21,733 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 20 transitions. Word has length 8 [2019-08-05 11:08:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,733 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 20 transitions. [2019-08-05 11:08:21,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 20 transitions. [2019-08-05 11:08:21,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:08:21,734 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:08:21,735 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr9ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1771001512, now seen corresponding path program 1 times [2019-08-05 11:08:21,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:21,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:08:21,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:21,779 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 11:08:21,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:08:21,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:08:21,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:08:21,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:08:21,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:08:21,781 INFO L87 Difference]: Start difference. First operand 21 states and 20 transitions. Second operand 3 states. [2019-08-05 11:08:21,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,821 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2019-08-05 11:08:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:08:21,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-08-05 11:08:21,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,823 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:08:21,824 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:08:21,824 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 11:08:21,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:08:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:08:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:08:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:08:21,825 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-08-05 11:08:21,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,825 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:08:21,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:08:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:08:21,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:08:21,831 INFO L202 PluginConnector]: Adding new model EuclideanIntegerDivision.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:08:21 BoogieIcfgContainer [2019-08-05 11:08:21,831 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:08:21,833 INFO L168 Benchmark]: Toolchain (without parser) took 1952.21 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 112.3 MB in the beginning and 124.3 MB in the end (delta: -12.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:21,834 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:08:21,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.00 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:21,836 INFO L168 Benchmark]: Boogie Preprocessor took 24.63 ms. Allocated memory is still 134.7 MB. Free memory was 110.4 MB in the beginning and 109.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:21,837 INFO L168 Benchmark]: RCFGBuilder took 541.96 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 97.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:21,838 INFO L168 Benchmark]: TraceAbstraction took 1340.04 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 97.3 MB in the beginning and 124.3 MB in the end (delta: -27.0 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:21,843 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.24 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 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 38.00 ms. Allocated memory is still 134.7 MB. Free memory was 112.3 MB in the beginning and 110.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.63 ms. Allocated memory is still 134.7 MB. Free memory was 110.4 MB in the beginning and 109.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 541.96 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 97.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1340.04 ms. Allocated memory was 134.7 MB in the beginning and 169.9 MB in the end (delta: 35.1 MB). Free memory was 97.3 MB in the beginning and 124.3 MB in the end (delta: -27.0 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 13]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 23]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 14]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 28]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 34]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 39]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 16 error locations. SAFE Result, 1.2s OverallTime, 7 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 146 SDtfs, 22 SDslu, 38 SDs, 0 SdLazy, 97 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 344 SizeOfPredicates, 0 NumberOfNonLiveVariables, 151 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...