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/20181010-MemSafetyPathprograms/merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:56:59,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:56:59,831 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:56:59,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:56:59,844 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:56:59,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:56:59,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:56:59,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:56:59,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:56:59,851 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:56:59,852 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:56:59,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:56:59,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:56:59,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:56:59,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:56:59,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:56:59,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:56:59,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:56:59,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:56:59,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:56:59,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:56:59,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:56:59,864 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:56:59,865 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:56:59,867 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:56:59,867 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:56:59,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:56:59,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:56:59,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:56:59,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:56:59,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:56:59,871 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:56:59,872 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:56:59,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:56:59,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:56:59,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:56:59,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:56:59,877 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:56:59,877 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:56:59,878 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:56:59,880 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:56:59,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:56:59,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:56:59,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:56:59,944 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:56:59,945 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:56:59,946 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl [2019-08-05 10:56:59,946 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl' [2019-08-05 10:57:00,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:57:00,022 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:57:00,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:00,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:57:00,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:57:00,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,082 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:57:00,083 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:57:00,083 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:57:00,084 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:57:00,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,130 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/1) ... [2019-08-05 10:57:00,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:57:00,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:57:00,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:57:00,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:57:00,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (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:57:00,216 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:57:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:57:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:57:00,856 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:57:00,856 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:57:00,857 INFO L202 PluginConnector]: Adding new model merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:00 BoogieIcfgContainer [2019-08-05 10:57:00,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:57:00,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:57:00,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:57:00,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:57:00,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:57:00" (1/2) ... [2019-08-05 10:57:00,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be5e66c and model type merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:57:00, skipping insertion in model container [2019-08-05 10:57:00,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:57:00" (2/2) ... [2019-08-05 10:57:00,869 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort_true-unreach-call_true-valid-memsafety.i_19.bpl [2019-08-05 10:57:00,879 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:57:00,887 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:57:00,903 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:57:00,930 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:57:00,930 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:57:00,931 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:57:00,931 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:57:00,931 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:57:00,931 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:57:00,931 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:57:00,932 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:57:00,932 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:57:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2019-08-05 10:57:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:57:00,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:00,960 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:57:00,964 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:00,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:00,970 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2019-08-05 10:57:01,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:01,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:57:01,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:01,134 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:57:01,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:01,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:57:01,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:57:01,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:57:01,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:57:01,159 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-08-05 10:57:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:01,191 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-08-05 10:57:01,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:57:01,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-08-05 10:57:01,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:01,204 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:57:01,204 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:57:01,206 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 10:57:01,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:57:01,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:57:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:57:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-08-05 10:57:01,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-08-05 10:57:01,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:01,243 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-08-05 10:57:01,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:57:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-08-05 10:57:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:57:01,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:01,244 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:57:01,245 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:01,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:01,245 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2019-08-05 10:57:01,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:01,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:57:01,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:01,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:01,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:01,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:01,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:01,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 10:57:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:01,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:57:01,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-08-05 10:57:01,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:01,661 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-08-05 10:57:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:01,952 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-08-05 10:57:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:57:01,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:57:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:01,953 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:57:01,953 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:57:01,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:57:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:57:01,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:57:01,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:57:01,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-08-05 10:57:01,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-08-05 10:57:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:01,958 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-08-05 10:57:01,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:57:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-08-05 10:57:01,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:57:01,959 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:01,959 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-08-05 10:57:01,959 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:01,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2019-08-05 10:57:01,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:02,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:57:02,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:02,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:57:02,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:02,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:02,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:57:02,320 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:02,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:02,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:02,342 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2019-08-05 10:57:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:02,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:02,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:57:02,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:57:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:57:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:57:02,468 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 5 states. [2019-08-05 10:57:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:02,638 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:57:02,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:57:02,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-08-05 10:57:02,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:02,643 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:57:02,643 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:57:02,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:57:02,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:57:02,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:57:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:57:02,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-08-05 10:57:02,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-08-05 10:57:02,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:02,648 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-08-05 10:57:02,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:57:02,648 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-08-05 10:57:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:57:02,649 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:02,649 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2019-08-05 10:57:02,649 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:02,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2019-08-05 10:57:02,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:02,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:57:02,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:02,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:02,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:02,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:02,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:02,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-08-05 10:57:03,201 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:57:03,201 INFO L341 Elim1Store]: treesize reduction 27, result has 57.1 percent of original size [2019-08-05 10:57:03,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 20 treesize of output 47 [2019-08-05 10:57:03,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:03,375 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2019-08-05 10:57:03,376 INFO L567 ElimStorePlain]: treesize reduction 17, result has 69.6 percent of original size [2019-08-05 10:57:03,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:57:03,383 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:03,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:03,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:03,410 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:38 [2019-08-05 10:57:03,648 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-08-05 10:57:03,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:03,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:03,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:03,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2019-08-05 10:57:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:03,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:03,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:57:03,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:57:03,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:57:03,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:03,806 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-08-05 10:57:04,247 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-08-05 10:57:04,393 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-08-05 10:57:04,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:04,537 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-08-05 10:57:04,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:57:04,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-08-05 10:57:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:04,540 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:57:04,540 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:57:04,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:57:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:57:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:57:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:57:04,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-08-05 10:57:04,545 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-08-05 10:57:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:04,546 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-08-05 10:57:04,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:57:04,546 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-08-05 10:57:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:57:04,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:04,547 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2019-08-05 10:57:04,547 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:04,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:04,547 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2019-08-05 10:57:04,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:04,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:57:04,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:04,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:04,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:04,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:04,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:57:04,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:04,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:04,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:57:04,946 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:04,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:04,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:04,959 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:39, output treesize:30 [2019-08-05 10:57:05,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:05,103 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2019-08-05 10:57:05,105 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:05,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,195 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2019-08-05 10:57:05,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:05,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:05,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2019-08-05 10:57:05,341 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:05,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,418 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:113, output treesize:129 [2019-08-05 10:57:05,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:05,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:05,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:57:05,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:57:05,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:57:05,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:05,668 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 7 states. [2019-08-05 10:57:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:42,207 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-08-05 10:57:42,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:57:42,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-05 10:57:42,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:42,210 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:57:42,210 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:57:42,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:57:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:57:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:57:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-08-05 10:57:42,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-08-05 10:57:42,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:42,215 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-08-05 10:57:42,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:57:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-08-05 10:57:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:57:42,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:42,216 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2019-08-05 10:57:42,216 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2019-08-05 10:57:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:42,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:57:42,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:42,554 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:42,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2019-08-05 10:57:42,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:42,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:42,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 10:57:42,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2019-08-05 10:57:42,893 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-08-05 10:57:42,893 INFO L341 Elim1Store]: treesize reduction 27, result has 65.8 percent of original size [2019-08-05 10:57:42,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 70 [2019-08-05 10:57:42,896 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:43,006 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-08-05 10:57:43,006 INFO L567 ElimStorePlain]: treesize reduction 17, result has 81.3 percent of original size [2019-08-05 10:57:43,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:43,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-08-05 10:57:43,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:43,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:43,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-08-05 10:57:43,120 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:43,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:43,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:43,184 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:74, output treesize:71 [2019-08-05 10:57:43,373 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-08-05 10:57:43,484 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-08-05 10:57:43,955 WARN L188 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-08-05 10:57:43,955 INFO L341 Elim1Store]: treesize reduction 114, result has 64.6 percent of original size [2019-08-05 10:57:43,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 50 treesize of output 235 [2019-08-05 10:57:43,958 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:43,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:57:43,959 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:43,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:44,415 WARN L188 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-08-05 10:57:44,416 INFO L567 ElimStorePlain]: treesize reduction 100, result has 67.6 percent of original size [2019-08-05 10:57:44,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:44,431 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:44,431 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:44,433 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-08-05 10:57:44,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:44,539 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-08-05 10:57:44,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:44,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:44,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 54 [2019-08-05 10:57:44,556 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:44,815 WARN L188 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-08-05 10:57:44,816 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.9 percent of original size [2019-08-05 10:57:44,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:44,820 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:172, output treesize:310 [2019-08-05 10:57:45,042 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-05 10:57:45,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:45,174 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:45,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:45,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:45,183 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:45,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:45,185 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:45,215 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:45,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 242 treesize of output 179 [2019-08-05 10:57:45,217 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,220 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,221 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,222 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:45,620 WARN L188 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-08-05 10:57:45,621 INFO L567 ElimStorePlain]: treesize reduction 52, result has 80.7 percent of original size [2019-08-05 10:57:45,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:45,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:359, output treesize:212 [2019-08-05 10:57:45,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:45,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:45,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:45,765 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:45,771 INFO L172 IndexEqualityManager]: detected equality via solver [2019-08-05 10:57:45,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:45,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 156 treesize of output 95 [2019-08-05 10:57:45,790 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,791 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,793 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,794 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:57:45,795 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:45,957 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-08-05 10:57:45,958 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.5 percent of original size [2019-08-05 10:57:45,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:45,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:206, output treesize:79 [2019-08-05 10:57:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:46,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:46,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:57:46,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:57:46,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:57:46,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:46,065 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-08-05 10:58:10,731 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 136 [2019-08-05 10:58:13,843 WARN L188 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 183 DAG size of output: 139 [2019-08-05 10:58:24,582 WARN L188 SmtUtils]: Spent 2.83 s on a formula simplification. DAG size of input: 172 DAG size of output: 132 [2019-08-05 10:58:24,770 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 132 [2019-08-05 10:58:30,675 WARN L193 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-08-05 10:58:30,677 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:712) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:625) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:467) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:119) ... 28 more [2019-08-05 10:58:30,682 INFO L168 Benchmark]: Toolchain (without parser) took 90659.35 ms. Allocated memory was 133.2 MB in the beginning and 293.6 MB in the end (delta: 160.4 MB). Free memory was 108.7 MB in the beginning and 237.7 MB in the end (delta: -129.0 MB). Peak memory consumption was 31.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:30,682 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:58:30,683 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.08 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:30,684 INFO L168 Benchmark]: Boogie Preprocessor took 60.39 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 104.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:30,685 INFO L168 Benchmark]: RCFGBuilder took 713.70 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 86.3 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:30,686 INFO L168 Benchmark]: TraceAbstraction took 89820.32 ms. Allocated memory was 133.2 MB in the beginning and 293.6 MB in the end (delta: 160.4 MB). Free memory was 86.3 MB in the beginning and 237.7 MB in the end (delta: -151.4 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:58:30,689 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.25 ms. Allocated memory is still 133.2 MB. Free memory is still 110.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.08 ms. Allocated memory is still 133.2 MB. Free memory was 108.3 MB in the beginning and 106.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.39 ms. Allocated memory is still 133.2 MB. Free memory was 106.6 MB in the beginning and 104.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 713.70 ms. Allocated memory is still 133.2 MB. Free memory was 104.9 MB in the beginning and 86.3 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89820.32 ms. Allocated memory was 133.2 MB in the beginning and 293.6 MB in the end (delta: 160.4 MB). Free memory was 86.3 MB in the beginning and 237.7 MB in the end (delta: -151.4 MB). Peak memory consumption was 9.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:122) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...