java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX --rcfgbuilder.size.of.a.code.block SingleStatement -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1c58c86 [2019-05-15 10:43:08,883 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-05-15 10:43:08,885 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-05-15 10:43:08,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-15 10:43:08,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-05-15 10:43:08,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-15 10:43:08,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-05-15 10:43:08,901 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-05-15 10:43:08,903 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-05-15 10:43:08,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-05-15 10:43:08,904 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-05-15 10:43:08,905 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-05-15 10:43:08,906 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-05-15 10:43:08,906 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-05-15 10:43:08,908 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-05-15 10:43:08,908 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-15 10:43:08,909 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-05-15 10:43:08,911 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-15 10:43:08,913 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-05-15 10:43:08,915 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-05-15 10:43:08,916 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-05-15 10:43:08,917 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-05-15 10:43:08,920 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-15 10:43:08,920 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-15 10:43:08,921 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-05-15 10:43:08,922 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-05-15 10:43:08,922 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-05-15 10:43:08,923 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-05-15 10:43:08,923 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-05-15 10:43:08,924 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-05-15 10:43:08,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-05-15 10:43:08,926 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-05-15 10:43:08,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-15 10:43:08,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-05-15 10:43:08,928 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-05-15 10:43:08,928 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-05-15 10:43:08,928 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-05-15 10:43:08,929 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-05-15 10:43:08,930 INFO L181 SettingsManager]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement [2019-05-15 10:43:08,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-05-15 10:43:08,971 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-15 10:43:08,974 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-05-15 10:43:08,976 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-05-15 10:43:08,977 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-05-15 10:43:08,977 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl [2019-05-15 10:43:08,978 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LargeConstant-ForwardSuccess.bpl' [2019-05-15 10:43:09,007 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-05-15 10:43:09,009 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-05-15 10:43:09,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:09,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-05-15 10:43:09,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-05-15 10:43:09,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,042 WARN L165 Inliner]: Program contained no entry procedure! [2019-05-15 10:43:09,042 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-05-15 10:43:09,042 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-05-15 10:43:09,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-15 10:43:09,045 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-05-15 10:43:09,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-05-15 10:43:09,046 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-05-15 10:43:09,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-15 10:43:09,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-05-15 10:43:09,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-05-15 10:43:09,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-05-15 10:43:09,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (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-05-15 10:43:09,134 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2019-05-15 10:43:09,134 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2019-05-15 10:43:09,534 INFO L275 CfgBuilder]: Using library mode [2019-05-15 10:43:09,535 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-05-15 10:43:09,536 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:09 BoogieIcfgContainer [2019-05-15 10:43:09,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-05-15 10:43:09,537 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2019-05-15 10:43:09,537 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2019-05-15 10:43:09,538 INFO L275 PluginConnector]: IcfgTransformer initialized [2019-05-15 10:43:09,542 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:09" (1/1) ... [2019-05-15 10:43:09,659 INFO L632 onniauxMapEliminator]: L19 [2019-05-15 10:43:09,660 INFO L633 onniauxMapEliminator]: In Formula: (< (+ v_proc_i_4 4) (select v_proc_a_1 v_proc_j_1)) InVars {proc_a=v_proc_a_1, proc_j=v_proc_j_1, proc_i=v_proc_i_4} OutVars{proc_a=v_proc_a_1, proc_j=v_proc_j_1, proc_i=v_proc_i_4} AuxVars[] AssignedVars[] [2019-05-15 10:43:09,661 INFO L634 onniauxMapEliminator]: Out Formula: (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not (= v_proc_a_idx_0_term_1 v_proc_j_1)) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) (= v_proc_a_idx_0_term_1 v_proc_j_1))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] [2019-05-15 10:43:09,661 INFO L635 onniauxMapEliminator]: L20 [2019-05-15 10:43:09,676 INFO L632 onniauxMapEliminator]: L20 [2019-05-15 10:43:09,676 INFO L633 onniauxMapEliminator]: In Formula: (= (select v_proc_a_2 5) 1000) InVars {proc_a=v_proc_a_2} OutVars{proc_a=v_proc_a_2} AuxVars[] AssignedVars[] [2019-05-15 10:43:09,676 INFO L634 onniauxMapEliminator]: Out Formula: (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not (= v_proc_a_idx_0_term_2 5))) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) (= v_proc_a_idx_0_term_2 5))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] [2019-05-15 10:43:09,677 INFO L635 onniauxMapEliminator]: L21 [2019-05-15 10:43:09,724 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:09 BasicIcfg [2019-05-15 10:43:09,724 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2019-05-15 10:43:09,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-05-15 10:43:09,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-05-15 10:43:09,729 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-05-15 10:43:09,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.05 10:43:09" (1/3) ... [2019-05-15 10:43:09,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bdd9b1 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.05 10:43:09, skipping insertion in model container [2019-05-15 10:43:09,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.05 10:43:09" (2/3) ... [2019-05-15 10:43:09,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bdd9b1 and model type LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:09, skipping insertion in model container [2019-05-15 10:43:09,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.05 10:43:09" (3/3) ... [2019-05-15 10:43:09,735 INFO L109 eAbstractionObserver]: Analyzing ICFG LargeConstant-ForwardSuccess.bplME [2019-05-15 10:43:09,744 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-15 10:43:09,751 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-05-15 10:43:09,767 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-05-15 10:43:09,793 INFO L127 ementStrategyFactory]: Using default assertion order modulation [2019-05-15 10:43:09,794 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-05-15 10:43:09,794 INFO L378 AbstractCegarLoop]: Hoare is false [2019-05-15 10:43:09,794 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-05-15 10:43:09,794 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-05-15 10:43:09,794 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-05-15 10:43:09,794 INFO L382 AbstractCegarLoop]: Difference is false [2019-05-15 10:43:09,794 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-05-15 10:43:09,795 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-15 10:43:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-05-15 10:43:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-05-15 10:43:09,817 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:09,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-05-15 10:43:09,820 INFO L418 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1378, now seen corresponding path program 1 times [2019-05-15 10:43:09,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:09,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-15 10:43:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:09,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:10,007 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} [13] procENTRY-->L17-1: Formula: (= v_proc_i_1 0) InVars {} OutVars{proc_i=v_proc_i_1} AuxVars[] AssignedVars[proc_i] {17#(<= proc_i 0)} is VALID [2019-05-15 10:43:10,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {17#(<= proc_i 0)} [14] L17-1-->procErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_proc_i_2 1000)) InVars {proc_i=v_proc_i_2} OutVars{proc_i=v_proc_i_2} AuxVars[] AssignedVars[] {13#false} is VALID [2019-05-15 10:43:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:43:10,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-15 10:43:10,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-05-15 10:43:10,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:43:10,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:10,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-05-15 10:43:10,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:10,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-05-15 10:43:10,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-15 10:43:10,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-15 10:43:10,046 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-05-15 10:43:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:10,173 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-05-15 10:43:10,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-15 10:43:10,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-05-15 10:43:10,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:10,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-05-15 10:43:10,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-05-15 10:43:10,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-05-15 10:43:10,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-05-15 10:43:10,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:10,281 INFO L225 Difference]: With dead ends: 16 [2019-05-15 10:43:10,282 INFO L226 Difference]: Without dead ends: 14 [2019-05-15 10:43:10,284 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-05-15 10:43:10,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-05-15 10:43:10,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 9. [2019-05-15 10:43:10,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:10,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 9 states. [2019-05-15 10:43:10,314 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 9 states. [2019-05-15 10:43:10,315 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 9 states. [2019-05-15 10:43:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:10,319 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:43:10,321 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:43:10,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:10,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:10,322 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 14 states. [2019-05-15 10:43:10,323 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 14 states. [2019-05-15 10:43:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:10,325 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-05-15 10:43:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-05-15 10:43:10,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:10,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:10,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:10,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:10,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-05-15 10:43:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-05-15 10:43:10,335 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 2 [2019-05-15 10:43:10,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:10,335 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-05-15 10:43:10,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-05-15 10:43:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-05-15 10:43:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-05-15 10:43:10,338 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:10,338 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-05-15 10:43:10,339 INFO L418 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 305801598, now seen corresponding path program 1 times [2019-05-15 10:43:10,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:10,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-15 10:43:10,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:10,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:10,659 INFO L273 TraceCheckUtils]: 0: Hoare triple {73#true} [13] procENTRY-->L17-1: Formula: (= v_proc_i_1 0) InVars {} OutVars{proc_i=v_proc_i_1} AuxVars[] AssignedVars[proc_i] {78#(<= proc_i 0)} is VALID [2019-05-15 10:43:10,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {78#(<= proc_i 0)} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {78#(<= proc_i 0)} is VALID [2019-05-15 10:43:10,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {78#(<= proc_i 0)} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {78#(<= proc_i 0)} is VALID [2019-05-15 10:43:10,694 INFO L273 TraceCheckUtils]: 3: Hoare triple {78#(<= proc_i 0)} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {78#(<= proc_i 0)} is VALID [2019-05-15 10:43:10,696 INFO L273 TraceCheckUtils]: 4: Hoare triple {78#(<= proc_i 0)} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {78#(<= proc_i 0)} is VALID [2019-05-15 10:43:10,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {78#(<= proc_i 0)} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {78#(<= proc_i 0)} is VALID [2019-05-15 10:43:10,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {78#(<= proc_i 0)} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {97#(<= proc_i 4)} is VALID [2019-05-15 10:43:10,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {97#(<= proc_i 4)} [14] L17-1-->procErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_proc_i_2 1000)) InVars {proc_i=v_proc_i_2} OutVars{proc_i=v_proc_i_2} AuxVars[] AssignedVars[] {74#false} is VALID [2019-05-15 10:43:10,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:43:10,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:43:10,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-05-15 10:43:10,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-05-15 10:43:10,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:10,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-05-15 10:43:10,771 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:10,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-05-15 10:43:10,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-15 10:43:10,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:10,772 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 4 states. [2019-05-15 10:43:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:10,986 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:43:10,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-15 10:43:10,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-05-15 10:43:10,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:10,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-05-15 10:43:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-05-15 10:43:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-05-15 10:43:10,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2019-05-15 10:43:11,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:11,044 INFO L225 Difference]: With dead ends: 20 [2019-05-15 10:43:11,045 INFO L226 Difference]: Without dead ends: 20 [2019-05-15 10:43:11,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-15 10:43:11,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-05-15 10:43:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-05-15 10:43:11,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:11,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 15 states. [2019-05-15 10:43:11,049 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 15 states. [2019-05-15 10:43:11,049 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 15 states. [2019-05-15 10:43:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:11,052 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:43:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:43:11,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:11,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:11,053 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 20 states. [2019-05-15 10:43:11,053 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 20 states. [2019-05-15 10:43:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:11,055 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-05-15 10:43:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-05-15 10:43:11,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:11,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:11,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:11,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-05-15 10:43:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-05-15 10:43:11,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2019-05-15 10:43:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:11,058 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-05-15 10:43:11,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-05-15 10:43:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-05-15 10:43:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-05-15 10:43:11,063 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:11,063 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1] [2019-05-15 10:43:11,064 INFO L418 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 980928666, now seen corresponding path program 2 times [2019-05-15 10:43:11,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:11,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-15 10:43:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:11,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:11,320 INFO L273 TraceCheckUtils]: 0: Hoare triple {175#true} [13] procENTRY-->L17-1: Formula: (= v_proc_i_1 0) InVars {} OutVars{proc_i=v_proc_i_1} AuxVars[] AssignedVars[proc_i] {180#(<= proc_i 0)} is VALID [2019-05-15 10:43:11,321 INFO L273 TraceCheckUtils]: 1: Hoare triple {180#(<= proc_i 0)} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {180#(<= proc_i 0)} is VALID [2019-05-15 10:43:11,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {180#(<= proc_i 0)} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {180#(<= proc_i 0)} is VALID [2019-05-15 10:43:11,322 INFO L273 TraceCheckUtils]: 3: Hoare triple {180#(<= proc_i 0)} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {180#(<= proc_i 0)} is VALID [2019-05-15 10:43:11,327 INFO L273 TraceCheckUtils]: 4: Hoare triple {180#(<= proc_i 0)} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {180#(<= proc_i 0)} is VALID [2019-05-15 10:43:11,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {180#(<= proc_i 0)} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {180#(<= proc_i 0)} is VALID [2019-05-15 10:43:11,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {180#(<= proc_i 0)} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {199#(<= proc_i 4)} is VALID [2019-05-15 10:43:11,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(<= proc_i 4)} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {199#(<= proc_i 4)} is VALID [2019-05-15 10:43:11,333 INFO L273 TraceCheckUtils]: 8: Hoare triple {199#(<= proc_i 4)} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {199#(<= proc_i 4)} is VALID [2019-05-15 10:43:11,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {199#(<= proc_i 4)} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {199#(<= proc_i 4)} is VALID [2019-05-15 10:43:11,335 INFO L273 TraceCheckUtils]: 10: Hoare triple {199#(<= proc_i 4)} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {199#(<= proc_i 4)} is VALID [2019-05-15 10:43:11,335 INFO L273 TraceCheckUtils]: 11: Hoare triple {199#(<= proc_i 4)} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {199#(<= proc_i 4)} is VALID [2019-05-15 10:43:11,337 INFO L273 TraceCheckUtils]: 12: Hoare triple {199#(<= proc_i 4)} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {218#(<= proc_i 8)} is VALID [2019-05-15 10:43:11,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {218#(<= proc_i 8)} [14] L17-1-->procErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_proc_i_2 1000)) InVars {proc_i=v_proc_i_2} OutVars{proc_i=v_proc_i_2} AuxVars[] AssignedVars[] {176#false} is VALID [2019-05-15 10:43:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:43:11,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:43:11,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-15 10:43:11,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-05-15 10:43:11,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:11,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2019-05-15 10:43:11,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:11,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-05-15 10:43:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-15 10:43:11,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:43:11,390 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2019-05-15 10:43:11,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:11,599 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:43:11,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-15 10:43:11,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-05-15 10:43:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:43:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-05-15 10:43:11,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-05-15 10:43:11,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2019-05-15 10:43:11,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2019-05-15 10:43:11,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:11,893 INFO L225 Difference]: With dead ends: 26 [2019-05-15 10:43:11,893 INFO L226 Difference]: Without dead ends: 26 [2019-05-15 10:43:11,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-15 10:43:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-05-15 10:43:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-05-15 10:43:11,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:11,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 21 states. [2019-05-15 10:43:11,897 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 21 states. [2019-05-15 10:43:11,897 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 21 states. [2019-05-15 10:43:11,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:11,899 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:43:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:43:11,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:11,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:11,900 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 26 states. [2019-05-15 10:43:11,901 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 26 states. [2019-05-15 10:43:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:11,903 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:43:11,903 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-05-15 10:43:11,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:11,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:11,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:11,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:11,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-05-15 10:43:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-05-15 10:43:11,905 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2019-05-15 10:43:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:11,906 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-05-15 10:43:11,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-05-15 10:43:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-05-15 10:43:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-05-15 10:43:11,907 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:11,907 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1] [2019-05-15 10:43:11,907 INFO L418 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:11,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1223729846, now seen corresponding path program 3 times [2019-05-15 10:43:11,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:11,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-15 10:43:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:11,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:12,086 INFO L273 TraceCheckUtils]: 0: Hoare triple {320#true} [13] procENTRY-->L17-1: Formula: (= v_proc_i_1 0) InVars {} OutVars{proc_i=v_proc_i_1} AuxVars[] AssignedVars[proc_i] {325#(<= proc_i 0)} is VALID [2019-05-15 10:43:12,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {325#(<= proc_i 0)} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {325#(<= proc_i 0)} is VALID [2019-05-15 10:43:12,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {325#(<= proc_i 0)} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {325#(<= proc_i 0)} is VALID [2019-05-15 10:43:12,089 INFO L273 TraceCheckUtils]: 3: Hoare triple {325#(<= proc_i 0)} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {325#(<= proc_i 0)} is VALID [2019-05-15 10:43:12,091 INFO L273 TraceCheckUtils]: 4: Hoare triple {325#(<= proc_i 0)} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {325#(<= proc_i 0)} is VALID [2019-05-15 10:43:12,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {325#(<= proc_i 0)} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {325#(<= proc_i 0)} is VALID [2019-05-15 10:43:12,092 INFO L273 TraceCheckUtils]: 6: Hoare triple {325#(<= proc_i 0)} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {344#(<= proc_i 4)} is VALID [2019-05-15 10:43:12,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#(<= proc_i 4)} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {344#(<= proc_i 4)} is VALID [2019-05-15 10:43:12,093 INFO L273 TraceCheckUtils]: 8: Hoare triple {344#(<= proc_i 4)} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {344#(<= proc_i 4)} is VALID [2019-05-15 10:43:12,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {344#(<= proc_i 4)} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {344#(<= proc_i 4)} is VALID [2019-05-15 10:43:12,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {344#(<= proc_i 4)} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {344#(<= proc_i 4)} is VALID [2019-05-15 10:43:12,098 INFO L273 TraceCheckUtils]: 11: Hoare triple {344#(<= proc_i 4)} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {344#(<= proc_i 4)} is VALID [2019-05-15 10:43:12,105 INFO L273 TraceCheckUtils]: 12: Hoare triple {344#(<= proc_i 4)} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {363#(<= proc_i 8)} is VALID [2019-05-15 10:43:12,107 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#(<= proc_i 8)} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {363#(<= proc_i 8)} is VALID [2019-05-15 10:43:12,108 INFO L273 TraceCheckUtils]: 14: Hoare triple {363#(<= proc_i 8)} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {363#(<= proc_i 8)} is VALID [2019-05-15 10:43:12,108 INFO L273 TraceCheckUtils]: 15: Hoare triple {363#(<= proc_i 8)} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {363#(<= proc_i 8)} is VALID [2019-05-15 10:43:12,109 INFO L273 TraceCheckUtils]: 16: Hoare triple {363#(<= proc_i 8)} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {363#(<= proc_i 8)} is VALID [2019-05-15 10:43:12,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {363#(<= proc_i 8)} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {363#(<= proc_i 8)} is VALID [2019-05-15 10:43:12,110 INFO L273 TraceCheckUtils]: 18: Hoare triple {363#(<= proc_i 8)} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {382#(<= proc_i 12)} is VALID [2019-05-15 10:43:12,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {382#(<= proc_i 12)} [14] L17-1-->procErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_proc_i_2 1000)) InVars {proc_i=v_proc_i_2} OutVars{proc_i=v_proc_i_2} AuxVars[] AssignedVars[] {321#false} is VALID [2019-05-15 10:43:12,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-15 10:43:12,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:43:12,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-15 10:43:12,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-05-15 10:43:12,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:12,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:43:12,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:12,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:43:12,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:43:12,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:43:12,147 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 6 states. [2019-05-15 10:43:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:12,362 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:43:12,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-15 10:43:12,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-05-15 10:43:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:43:12,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2019-05-15 10:43:12,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:43:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2019-05-15 10:43:12,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2019-05-15 10:43:12,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:12,443 INFO L225 Difference]: With dead ends: 32 [2019-05-15 10:43:12,444 INFO L226 Difference]: Without dead ends: 32 [2019-05-15 10:43:12,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:43:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-05-15 10:43:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-05-15 10:43:12,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:12,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 27 states. [2019-05-15 10:43:12,448 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 27 states. [2019-05-15 10:43:12,448 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 27 states. [2019-05-15 10:43:12,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:12,450 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:43:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:43:12,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:12,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:12,451 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 32 states. [2019-05-15 10:43:12,452 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 32 states. [2019-05-15 10:43:12,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:12,454 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-05-15 10:43:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-05-15 10:43:12,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:12,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:12,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:12,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-05-15 10:43:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-05-15 10:43:12,457 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-05-15 10:43:12,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:12,457 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-05-15 10:43:12,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:43:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-05-15 10:43:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-05-15 10:43:12,459 INFO L391 BasicCegarLoop]: Found error trace [2019-05-15 10:43:12,459 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1] [2019-05-15 10:43:12,459 INFO L418 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2019-05-15 10:43:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-05-15 10:43:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1963751378, now seen corresponding path program 4 times [2019-05-15 10:43:12,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-05-15 10:43:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:12,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-15 10:43:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-05-15 10:43:12,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-05-15 10:43:12,958 INFO L273 TraceCheckUtils]: 0: Hoare triple {508#true} [13] procENTRY-->L17-1: Formula: (= v_proc_i_1 0) InVars {} OutVars{proc_i=v_proc_i_1} AuxVars[] AssignedVars[proc_i] {508#true} is VALID [2019-05-15 10:43:12,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {508#true} is VALID [2019-05-15 10:43:12,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {508#true} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {519#(and proc_a_idx_0_bool (= proc_j proc_a_idx_0))} is VALID [2019-05-15 10:43:12,960 INFO L273 TraceCheckUtils]: 3: Hoare triple {519#(and proc_a_idx_0_bool (= proc_j proc_a_idx_0))} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,961 INFO L273 TraceCheckUtils]: 4: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,962 INFO L273 TraceCheckUtils]: 5: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,962 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,974 INFO L273 TraceCheckUtils]: 8: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,975 INFO L273 TraceCheckUtils]: 9: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,976 INFO L273 TraceCheckUtils]: 11: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,977 INFO L273 TraceCheckUtils]: 12: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,977 INFO L273 TraceCheckUtils]: 13: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,983 INFO L273 TraceCheckUtils]: 14: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,984 INFO L273 TraceCheckUtils]: 15: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,985 INFO L273 TraceCheckUtils]: 16: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,985 INFO L273 TraceCheckUtils]: 17: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,987 INFO L273 TraceCheckUtils]: 18: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,990 INFO L273 TraceCheckUtils]: 19: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [15] L17-1-->L19: Formula: (<= v_proc_i_3 1000) InVars {proc_i=v_proc_i_3} OutVars{proc_i=v_proc_i_3} AuxVars[] AssignedVars[] {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} is VALID [2019-05-15 10:43:12,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {523#(and (= proc_j proc_a_idx_0) (= 5 proc_a_idx_0) (<= proc_a_val_0 1000))} [17] L19-->L20: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_1 v_proc_j_1))) (and v_proc_a_idx_0_term_assigned_1 (< (+ v_proc_i_4 4) v_v_proc_a_1_aux_1) (or (not .cse0) (= v_v_proc_a_1_aux_1 v_proc_a_val_0_in_1)) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_1, proc_j=v_proc_j_1, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_1, proc_i=v_proc_i_4} AuxVars[v_v_proc_a_1_aux_1] AssignedVars[] {575#(<= proc_i 995)} is VALID [2019-05-15 10:43:12,996 INFO L273 TraceCheckUtils]: 21: Hoare triple {575#(<= proc_i 995)} [18] L20-->L21: Formula: (let ((.cse0 (= v_proc_a_idx_0_term_2 5))) (and v_proc_a_idx_0_term_assigned_1 (or (= v_proc_a_val_0_in_2 v_v_proc_a_2_aux_1) (not .cse0)) (= 1000 v_v_proc_a_2_aux_1) (or (not v_proc_a_idx_0_term_assigned_1) .cse0))) InVars {proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} OutVars{proc_a_idx_0=v_proc_a_idx_0_term_2, proc_a_idx_0_bool=v_proc_a_idx_0_term_assigned_1, proc_a_val_0=v_proc_a_val_0_in_2} AuxVars[v_v_proc_a_2_aux_1] AssignedVars[] {575#(<= proc_i 995)} is VALID [2019-05-15 10:43:12,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {575#(<= proc_i 995)} [19] L21-->L22: Formula: (< 4 v_proc_j_2) InVars {proc_j=v_proc_j_2} OutVars{proc_j=v_proc_j_2} AuxVars[] AssignedVars[] {575#(<= proc_i 995)} is VALID [2019-05-15 10:43:12,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {575#(<= proc_i 995)} [20] L22-->L23: Formula: (< v_proc_j_3 6) InVars {proc_j=v_proc_j_3} OutVars{proc_j=v_proc_j_3} AuxVars[] AssignedVars[] {575#(<= proc_i 995)} is VALID [2019-05-15 10:43:12,999 INFO L273 TraceCheckUtils]: 24: Hoare triple {575#(<= proc_i 995)} [21] L23-->L17-1: Formula: (= v_proc_i_5 (+ v_proc_i_6 4)) InVars {proc_i=v_proc_i_6} OutVars{proc_i=v_proc_i_5} AuxVars[] AssignedVars[proc_i] {588#(<= proc_i 999)} is VALID [2019-05-15 10:43:13,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {588#(<= proc_i 999)} [14] L17-1-->procErr0ASSERT_VIOLATIONASSERT: Formula: (not (<= v_proc_i_2 1000)) InVars {proc_i=v_proc_i_2} OutVars{proc_i=v_proc_i_2} AuxVars[] AssignedVars[] {509#false} is VALID [2019-05-15 10:43:13,003 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-05-15 10:43:13,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-15 10:43:13,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-15 10:43:13,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-05-15 10:43:13,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-05-15 10:43:13,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-05-15 10:43:13,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:13,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-05-15 10:43:13,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-15 10:43:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-05-15 10:43:13,048 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 6 states. [2019-05-15 10:43:13,254 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-05-15 10:43:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:13,277 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-05-15 10:43:13,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-15 10:43:13,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-05-15 10:43:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-05-15 10:43:13,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:43:13,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-05-15 10:43:13,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-05-15 10:43:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-05-15 10:43:13,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 11 transitions. [2019-05-15 10:43:13,309 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-05-15 10:43:13,309 INFO L225 Difference]: With dead ends: 26 [2019-05-15 10:43:13,309 INFO L226 Difference]: Without dead ends: 0 [2019-05-15 10:43:13,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-05-15 10:43:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-05-15 10:43:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-15 10:43:13,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-05-15 10:43:13,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,311 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,311 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:13,312 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:13,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:13,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:13,312 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,312 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-05-15 10:43:13,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-05-15 10:43:13,312 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-05-15 10:43:13,312 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:13,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:13,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-05-15 10:43:13,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-05-15 10:43:13,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-05-15 10:43:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-05-15 10:43:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-15 10:43:13,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-05-15 10:43:13,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-05-15 10:43:13,313 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-05-15 10:43:13,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-05-15 10:43:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-15 10:43:13,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-05-15 10:43:13,316 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-15 10:43:13,318 INFO L202 PluginConnector]: Adding new model LargeConstant-ForwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.05 10:43:13 BasicIcfg [2019-05-15 10:43:13,318 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-05-15 10:43:13,319 INFO L168 Benchmark]: Toolchain (without parser) took 4310.89 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 108.5 MB in the beginning and 127.3 MB in the end (delta: -18.8 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,320 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-15 10:43:13,321 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 140.0 MB. Free memory was 108.5 MB in the beginning and 106.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,323 INFO L168 Benchmark]: Boogie Preprocessor took 20.18 ms. Allocated memory is still 140.0 MB. Free memory was 106.5 MB in the beginning and 105.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,323 INFO L168 Benchmark]: RCFGBuilder took 471.00 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 95.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,324 INFO L168 Benchmark]: IcfgTransformer took 187.17 ms. Allocated memory is still 140.0 MB. Free memory was 95.3 MB in the beginning and 91.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,325 INFO L168 Benchmark]: TraceAbstraction took 3592.21 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 91.2 MB in the beginning and 127.3 MB in the end (delta: -36.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. [2019-05-15 10:43:13,330 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 140.0 MB. Free memory is still 109.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.48 ms. Allocated memory is still 140.0 MB. Free memory was 108.5 MB in the beginning and 106.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.18 ms. Allocated memory is still 140.0 MB. Free memory was 106.5 MB in the beginning and 105.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.00 ms. Allocated memory is still 140.0 MB. Free memory was 105.3 MB in the beginning and 95.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 187.17 ms. Allocated memory is still 140.0 MB. Free memory was 95.3 MB in the beginning and 91.5 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3592.21 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 91.2 MB in the beginning and 127.3 MB in the end (delta: -36.0 MB). Peak memory consumption was 26.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 5 OverallIterations, 4 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 18 SDtfs, 64 SDslu, 37 SDs, 0 SdLazy, 79 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 70 NumberOfCodeBlocks, 70 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 65 ConstructedInterpolants, 0 QuantifiedInterpolants, 6540 SizeOfPredicates, 4 NumberOfNonLiveVariables, 165 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 23/70 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...