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/abstractInterpretation/regression/eq/39_framing_condition_summary_minimal.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:12:14,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:12:14,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:12:14,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:12:14,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:12:14,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:12:14,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:12:14,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:12:14,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:12:14,839 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:12:14,841 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:12:14,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:12:14,843 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:12:14,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:12:14,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:12:14,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:12:14,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:12:14,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:12:14,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:12:14,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:12:14,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:12:14,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:12:14,871 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:12:14,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:12:14,876 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:12:14,876 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:12:14,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:12:14,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:12:14,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:12:14,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:12:14,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:12:14,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:12:14,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:12:14,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:12:14,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:12:14,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:12:14,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:12:14,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:12:14,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:12:14,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:12:14,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:12:14,916 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:12:14,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:12:14,933 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:12:14,935 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:12:14,935 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:12:14,936 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/eq/39_framing_condition_summary_minimal.bpl [2019-08-05 11:12:14,936 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/abstractInterpretation/regression/eq/39_framing_condition_summary_minimal.bpl' [2019-08-05 11:12:14,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:12:14,972 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:12:14,973 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:14,973 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:12:14,973 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:12:14,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:14,999 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,005 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:12:15,005 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:12:15,006 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:12:15,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:12:15,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:12:15,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:12:15,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:12:15,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,023 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,027 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,033 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... [2019-08-05 11:12:15,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:12:15,035 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:12:15,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:12:15,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:12:15,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:12:15,106 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 11:12:15,106 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:12:15,106 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:12:15,342 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:12:15,342 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 11:12:15,344 INFO L202 PluginConnector]: Adding new model 39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:15 BoogieIcfgContainer [2019-08-05 11:12:15,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:12:15,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:12:15,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:12:15,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:12:15,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:12:14" (1/2) ... [2019-08-05 11:12:15,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377552ea and model type 39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:12:15, skipping insertion in model container [2019-08-05 11:12:15,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "39_framing_condition_summary_minimal.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:12:15" (2/2) ... [2019-08-05 11:12:15,352 INFO L109 eAbstractionObserver]: Analyzing ICFG 39_framing_condition_summary_minimal.bpl [2019-08-05 11:12:15,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:12:15,369 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:12:15,383 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:12:15,408 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:12:15,408 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:12:15,409 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:12:15,409 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:12:15,409 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:12:15,409 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:12:15,409 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:12:15,410 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:12:15,410 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:12:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:12:15,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:12:15,431 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,432 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:12:15,435 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,441 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 11:12:15,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:15,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:12:15,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:12:15,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:12:15,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:12:15,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:15,584 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:12:15,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:15,659 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:12:15,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:12:15,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:12:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:15,674 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:12:15,674 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:12:15,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:12:15,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:12:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:12:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:12:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:12:15,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:12:15,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:15,720 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:12:15,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:12:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:12:15,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:12:15,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:15,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:12:15,722 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:15,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 11:12:15,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:15,746 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:12:15,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:16,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:16,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2019-08-05 11:12:16,022 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:16,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:16,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:16,051 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:12:16,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:11 [2019-08-05 11:12:28,142 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_i_3 Int)) (and (not (= v_main_i_3 c_main_j)) (= (store c_main_a_old v_main_i_3 42) c_main_a))) is different from true [2019-08-05 11:12:28,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:28,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:28,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:12:28,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:12:28,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:12:28,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2019-08-05 11:12:28,147 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2019-08-05 11:12:29,368 WARN L188 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:12:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:29,836 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:12:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:12:29,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 11:12:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:29,838 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:12:29,838 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:12:29,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2019-08-05 11:12:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:12:29,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:12:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:12:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:12:29,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:12:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:29,842 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:12:29,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:12:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:12:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:12:29,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:29,843 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:12:29,843 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:29,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 11:12:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:29,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:12:29,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:30,465 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:30,466 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 17 treesize of output 35 [2019-08-05 11:12:30,468 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:30,469 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:30,471 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:30,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:30,528 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-08-05 11:12:30,528 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:18 [2019-08-05 11:12:42,571 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_i_4 Int) (v_main_i_5 Int)) (and (not (= v_main_i_5 c_main_j)) (not (= v_main_i_4 c_main_j)) (= (store (store c_main_a_old v_main_i_4 42) v_main_i_5 42) c_main_a))) is different from true [2019-08-05 11:12:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:12:42,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:12:42,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:12:42,573 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:12:42,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:12:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=12, Unknown=2, NotChecked=6, Total=30 [2019-08-05 11:12:42,574 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2019-08-05 11:12:47,350 WARN L188 SmtUtils]: Spent 642.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 11:12:48,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:12:48,305 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:12:48,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:12:48,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-08-05 11:12:48,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:12:48,306 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:12:48,306 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:12:48,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=13, Invalid=16, Unknown=5, NotChecked=8, Total=42 [2019-08-05 11:12:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:12:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:12:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:12:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:12:48,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:12:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:12:48,309 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:12:48,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:12:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:12:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:12:48,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:12:48,310 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:12:48,310 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:12:48,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:12:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 11:12:48,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:12:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:12:48,325 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:12:48,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:12:50,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:50,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 22 treesize of output 62 [2019-08-05 11:12:50,058 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:50,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:50,060 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:12:50,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:12:50,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:12:50,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-08-05 11:12:50,079 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:34, output treesize:25 [2019-08-05 11:13:02,116 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_i_8 Int) (v_main_i_7 Int) (v_main_i_6 Int)) (and (not (= v_main_i_8 c_main_j)) (= (store (store (store c_main_a_old v_main_i_6 42) v_main_i_7 42) v_main_i_8 42) c_main_a) (not (= v_main_i_7 c_main_j)) (not (= v_main_i_6 c_main_j)))) is different from true [2019-08-05 11:13:02,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:13:02,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:13:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:13:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=4, NotChecked=8, Total=42 [2019-08-05 11:13:02,118 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 11:13:23,509 WARN L188 SmtUtils]: Spent 584.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-08-05 11:13:23,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:23,525 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:13:23,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:13:23,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 11:13:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:23,528 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:13:23,529 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:13:23,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=17, Invalid=20, Unknown=9, NotChecked=10, Total=56 [2019-08-05 11:13:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:13:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:13:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:13:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:13:23,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:13:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:23,532 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:13:23,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:13:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:13:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:13:23,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:23,533 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:13:23,533 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 11:13:23,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:23,554 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:13:23,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:13:28,627 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:28,628 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 27 treesize of output 97 [2019-08-05 11:13:28,631 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:13:28,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:13:28,632 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:13:28,633 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:13:28,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:13:28,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:13:28,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-05 11:13:28,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:42, output treesize:32 [2019-08-05 11:13:40,689 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_i_11 Int) (v_main_i_10 Int) (v_main_i_12 Int) (v_main_i_9 Int)) (and (not (= c_main_j v_main_i_10)) (= (store (store (store (store c_main_a_old v_main_i_9 42) v_main_i_10 42) v_main_i_11 42) v_main_i_12 42) c_main_a) (not (= c_main_j v_main_i_12)) (not (= v_main_i_9 c_main_j)) (not (= c_main_j v_main_i_11)))) is different from true [2019-08-05 11:13:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:13:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:13:40,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:13:40,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:13:40,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:13:40,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=20, Unknown=7, NotChecked=10, Total=56 [2019-08-05 11:13:40,691 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 11:13:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:13:57,056 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:13:57,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:13:57,056 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 11:13:57,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:13:57,057 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:13:57,057 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:13:57,057 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=19, Invalid=20, Unknown=7, NotChecked=10, Total=56 [2019-08-05 11:13:57,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:13:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:13:57,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:13:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:13:57,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:13:57,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:13:57,060 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:13:57,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:13:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:13:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:13:57,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:13:57,061 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:13:57,061 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:13:57,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:13:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 11:13:57,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:13:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:13:57,085 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:13:57,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:14:08,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:08,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 32 treesize of output 140 [2019-08-05 11:14:08,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,096 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,097 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:14:08,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:14:08,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:14:08,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-05 11:14:08,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:50, output treesize:39 [2019-08-05 11:14:20,155 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_i_13 Int) (v_main_i_15 Int) (v_main_i_14 Int) (v_main_i_17 Int) (v_main_i_16 Int)) (and (= (store (store (store (store (store c_main_a_old v_main_i_13 42) v_main_i_14 42) v_main_i_15 42) v_main_i_16 42) v_main_i_17 42) c_main_a) (not (= c_main_j v_main_i_16)) (not (= c_main_j v_main_i_14)) (not (= c_main_j v_main_i_15)) (not (= c_main_j v_main_i_17)) (not (= c_main_j v_main_i_13)))) is different from true [2019-08-05 11:14:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 5 refuted. 10 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:14:20,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:14:20,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:14:20,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:14:20,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:14:20,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=24, Unknown=12, NotChecked=12, Total=72 [2019-08-05 11:14:20,158 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 11:14:35,403 WARN L188 SmtUtils]: Spent 3.71 s on a formula simplification that was a NOOP. DAG size: 32 [2019-08-05 11:14:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:14:43,613 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:14:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:14:43,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 11:14:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:14:43,614 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:14:43,615 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:14:43,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.1s TimeCoverageRelationStatistics Valid=31, Invalid=28, Unknown=17, NotChecked=14, Total=90 [2019-08-05 11:14:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:14:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:14:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:14:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:14:43,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:14:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:14:43,619 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:14:43,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:14:43,620 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:14:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:14:43,620 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:14:43,620 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:14:43,621 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:14:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:14:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 11:14:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:14:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:14:43,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:14:43,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:15:05,714 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-08-05 11:15:05,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:05,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 37 treesize of output 191 [2019-08-05 11:15:05,717 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:15:05,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:15:05,718 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:15:05,719 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:15:05,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:15:05,720 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:15:05,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:15:05,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:15:05,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-08-05 11:15:05,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:58, output treesize:46 [2019-08-05 11:15:17,878 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_i_20 Int) (v_main_i_22 Int) (v_main_i_21 Int) (v_main_i_23 Int) (v_main_i_19 Int) (v_main_i_18 Int)) (and (= c_main_a (store (store (store (store (store (store c_main_a_old v_main_i_18 42) v_main_i_19 42) v_main_i_20 42) v_main_i_21 42) v_main_i_22 42) v_main_i_23 42)) (not (= c_main_j v_main_i_21)) (not (= c_main_j v_main_i_22)) (not (= c_main_j v_main_i_20)) (not (= c_main_j v_main_i_23)) (not (= c_main_j v_main_i_19)) (not (= c_main_j v_main_i_18)))) is different from true [2019-08-05 11:15:17,879 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 15 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:15:17,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:15:17,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:15:17,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:15:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:15:17,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=28, Unknown=18, NotChecked=14, Total=90 [2019-08-05 11:15:17,881 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 11:15:39,543 WARN L188 SmtUtils]: Spent 2.94 s on a formula simplification that was a NOOP. DAG size: 32 [2019-08-05 11:16:20,862 WARN L188 SmtUtils]: Spent 5.34 s on a formula simplification that was a NOOP. DAG size: 36 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown