java -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf -i /storage/chc-comp/llreve-bench/unsolved/shiftByOne.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-55b8104 [2018-06-18 11:52:43,705 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-18 11:52:43,707 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-18 11:52:43,719 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-18 11:52:43,719 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-18 11:52:43,720 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-18 11:52:43,722 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-18 11:52:43,726 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-18 11:52:43,728 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-18 11:52:43,729 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-18 11:52:43,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-18 11:52:43,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-18 11:52:43,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-18 11:52:43,733 INFO L177 SettingsManager]: ChcToBoogie provides no preferences, ignoring... [2018-06-18 11:52:43,734 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-18 11:52:43,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-18 11:52:43,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-18 11:52:43,753 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-18 11:52:43,754 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-18 11:52:43,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-18 11:52:43,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-18 11:52:43,759 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-18 11:52:43,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-18 11:52:43,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-18 11:52:43,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-18 11:52:43,767 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-18 11:52:43,768 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-18 11:52:43,768 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-18 11:52:43,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-18 11:52:43,769 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-18 11:52:43,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-18 11:52:43,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-18 11:52:43,771 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-18 11:52:43,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-18 11:52:43,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-18 11:52:43,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chccomp2018/chcToBoogie_automizer.epf [2018-06-18 11:52:43,802 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-18 11:52:43,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-18 11:52:43,803 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-18 11:52:43,803 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-18 11:52:43,804 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-18 11:52:43,805 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-18 11:52:43,805 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-18 11:52:43,805 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-18 11:52:43,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 11:52:43,806 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-18 11:52:43,806 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-18 11:52:43,806 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-18 11:52:43,806 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-18 11:52:43,806 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-18 11:52:43,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-18 11:52:43,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-18 11:52:43,807 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-18 11:52:43,808 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-18 11:52:43,809 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-18 11:52:43,850 INFO ]: Repository-Root is: /tmp [2018-06-18 11:52:43,863 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-18 11:52:43,870 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-18 11:52:43,872 INFO ]: Initializing SmtParser... [2018-06-18 11:52:43,872 INFO ]: SmtParser initialized [2018-06-18 11:52:43,873 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/unsolved/shiftByOne.smt2 [2018-06-18 11:52:43,874 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/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 [2018-06-18 11:52:43,969 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/unsolved/shiftByOne.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@2009b4d0 [2018-06-18 11:52:44,174 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/unsolved/shiftByOne.smt2 [2018-06-18 11:52:44,181 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-18 11:52:44,188 INFO ]: Walking toolchain with 4 elements. [2018-06-18 11:52:44,188 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-18 11:52:44,188 INFO ]: Initializing ChcToBoogie... [2018-06-18 11:52:44,188 INFO ]: ChcToBoogie initialized [2018-06-18 11:52:44,196 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,241 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44 Unit [2018-06-18 11:52:44,241 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-18 11:52:44,241 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-18 11:52:44,241 INFO ]: Initializing Boogie Preprocessor... [2018-06-18 11:52:44,242 INFO ]: Boogie Preprocessor initialized [2018-06-18 11:52:44,263 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,264 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,275 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,275 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,279 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,280 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,281 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... [2018-06-18 11:52:44,290 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-18 11:52:44,291 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-18 11:52:44,291 INFO ]: Initializing RCFGBuilder... [2018-06-18 11:52:44,291 INFO ]: RCFGBuilder initialized [2018-06-18 11:52:44,292 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-18 11:52:44,317 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-18 11:52:44,317 INFO ]: Found specification of procedure False [2018-06-18 11:52:44,317 INFO ]: Found implementation of procedure False [2018-06-18 11:52:44,317 INFO ]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration [2018-06-18 11:52:44,317 INFO ]: Found specification of procedure INV_MAIN_1 [2018-06-18 11:52:44,317 INFO ]: Found implementation of procedure INV_MAIN_1 [2018-06-18 11:52:44,317 INFO ]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration [2018-06-18 11:52:44,317 INFO ]: Found specification of procedure INV_MAIN_2 [2018-06-18 11:52:44,317 INFO ]: Found implementation of procedure INV_MAIN_2 [2018-06-18 11:52:44,317 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-18 11:52:44,317 INFO ]: Found specification of procedure Ultimate.START [2018-06-18 11:52:44,317 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-18 11:52:44,595 INFO ]: Using library mode [2018-06-18 11:52:44,600 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:52:44 BoogieIcfgContainer [2018-06-18 11:52:44,600 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-18 11:52:44,602 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-18 11:52:44,602 INFO ]: Initializing TraceAbstraction... [2018-06-18 11:52:44,611 INFO ]: TraceAbstraction initialized [2018-06-18 11:52:44,612 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 18.06 11:52:44" (1/3) ... [2018-06-18 11:52:44,613 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a28800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 18.06 11:52:44, skipping insertion in model container [2018-06-18 11:52:44,613 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 18.06 11:52:44" (2/3) ... [2018-06-18 11:52:44,613 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a28800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.06 11:52:44, skipping insertion in model container [2018-06-18 11:52:44,613 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.06 11:52:44" (3/3) ... [2018-06-18 11:52:44,615 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-18 11:52:44,621 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-18 11:52:44,628 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-18 11:52:44,662 INFO ]: Using default assertion order modulation [2018-06-18 11:52:44,662 INFO ]: Interprodecural is true [2018-06-18 11:52:44,662 INFO ]: Hoare is false [2018-06-18 11:52:44,662 INFO ]: Compute interpolants for FPandBP [2018-06-18 11:52:44,662 INFO ]: Backedges is TWOTRACK [2018-06-18 11:52:44,662 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-18 11:52:44,662 INFO ]: Difference is false [2018-06-18 11:52:44,662 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-18 11:52:44,662 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-18 11:52:44,676 INFO ]: Start isEmpty. Operand 20 states. [2018-06-18 11:52:44,686 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-18 11:52:44,686 INFO ]: Found error trace [2018-06-18 11:52:44,686 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:44,687 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:44,690 INFO ]: Analyzing trace with hash 1966295479, now seen corresponding path program 1 times [2018-06-18 11:52:44,692 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:44,692 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:44,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:44,729 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:44,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:44,768 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:44,775 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:44,870 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:52:44,872 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:44,872 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:52:44,873 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:52:44,884 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:52:44,884 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:44,886 INFO ]: Start difference. First operand 20 states. Second operand 4 states. [2018-06-18 11:52:44,986 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:44,986 INFO ]: Finished difference Result 22 states and 30 transitions. [2018-06-18 11:52:44,987 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:52:44,988 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-18 11:52:44,988 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:44,998 INFO ]: With dead ends: 22 [2018-06-18 11:52:44,998 INFO ]: Without dead ends: 22 [2018-06-18 11:52:44,999 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:45,014 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-18 11:52:45,042 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-18 11:52:45,044 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-18 11:52:45,045 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-06-18 11:52:45,046 INFO ]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 9 [2018-06-18 11:52:45,046 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:45,046 INFO ]: Abstraction has 20 states and 28 transitions. [2018-06-18 11:52:45,046 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:52:45,046 INFO ]: Start isEmpty. Operand 20 states and 28 transitions. [2018-06-18 11:52:45,048 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:52:45,048 INFO ]: Found error trace [2018-06-18 11:52:45,048 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:45,048 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:45,048 INFO ]: Analyzing trace with hash 966690814, now seen corresponding path program 1 times [2018-06-18 11:52:45,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:45,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:45,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,049 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,058 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,059 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:45,113 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-18 11:52:45,113 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:45,113 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:52:45,115 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:52:45,115 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:52:45,115 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:45,115 INFO ]: Start difference. First operand 20 states and 28 transitions. Second operand 4 states. [2018-06-18 11:52:45,196 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:45,197 INFO ]: Finished difference Result 22 states and 31 transitions. [2018-06-18 11:52:45,197 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:52:45,197 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-18 11:52:45,197 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:45,198 INFO ]: With dead ends: 22 [2018-06-18 11:52:45,198 INFO ]: Without dead ends: 22 [2018-06-18 11:52:45,199 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:45,199 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-18 11:52:45,203 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-06-18 11:52:45,203 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-18 11:52:45,204 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-06-18 11:52:45,204 INFO ]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 13 [2018-06-18 11:52:45,204 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:45,204 INFO ]: Abstraction has 20 states and 27 transitions. [2018-06-18 11:52:45,204 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:52:45,204 INFO ]: Start isEmpty. Operand 20 states and 27 transitions. [2018-06-18 11:52:45,205 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-18 11:52:45,205 INFO ]: Found error trace [2018-06-18 11:52:45,205 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:45,205 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:45,206 INFO ]: Analyzing trace with hash 1878852379, now seen corresponding path program 1 times [2018-06-18 11:52:45,206 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:45,206 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:45,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,206 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,206 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,219 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,219 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:45,385 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:52:45,385 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:45,385 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-18 11:52:45,386 INFO ]: Interpolant automaton has 5 states [2018-06-18 11:52:45,386 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-18 11:52:45,386 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-18 11:52:45,386 INFO ]: Start difference. First operand 20 states and 27 transitions. Second operand 5 states. [2018-06-18 11:52:45,639 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:45,639 INFO ]: Finished difference Result 20 states and 26 transitions. [2018-06-18 11:52:45,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-18 11:52:45,640 INFO ]: Start accepts. Automaton has 5 states. Word has length 13 [2018-06-18 11:52:45,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:45,641 INFO ]: With dead ends: 20 [2018-06-18 11:52:45,641 INFO ]: Without dead ends: 19 [2018-06-18 11:52:45,641 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-18 11:52:45,642 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-18 11:52:45,645 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-18 11:52:45,645 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-18 11:52:45,646 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-06-18 11:52:45,646 INFO ]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 13 [2018-06-18 11:52:45,646 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:45,646 INFO ]: Abstraction has 19 states and 24 transitions. [2018-06-18 11:52:45,646 INFO ]: Interpolant automaton has 5 states. [2018-06-18 11:52:45,646 INFO ]: Start isEmpty. Operand 19 states and 24 transitions. [2018-06-18 11:52:45,648 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:52:45,648 INFO ]: Found error trace [2018-06-18 11:52:45,648 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:45,648 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:45,648 INFO ]: Analyzing trace with hash 1555410658, now seen corresponding path program 1 times [2018-06-18 11:52:45,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:45,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:45,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,649 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:45,667 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,668 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:45,912 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-18 11:52:45,912 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:45,912 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:45,934 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:45,961 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:45,969 INFO ]: Computing forward predicates... [2018-06-18 11:52:46,388 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:52:46,413 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-18 11:52:46,413 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-06-18 11:52:46,413 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:52:46,413 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:52:46,413 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:52:46,414 INFO ]: Start difference. First operand 19 states and 24 transitions. Second operand 10 states. [2018-06-18 11:52:46,771 WARN ]: Spent 206.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-06-18 11:52:47,261 WARN ]: Spent 255.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-06-18 11:52:47,503 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:47,503 INFO ]: Finished difference Result 27 states and 35 transitions. [2018-06-18 11:52:47,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:52:47,504 INFO ]: Start accepts. Automaton has 10 states. Word has length 17 [2018-06-18 11:52:47,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:47,505 INFO ]: With dead ends: 27 [2018-06-18 11:52:47,505 INFO ]: Without dead ends: 27 [2018-06-18 11:52:47,506 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:52:47,506 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 11:52:47,510 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 21. [2018-06-18 11:52:47,510 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 11:52:47,511 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2018-06-18 11:52:47,511 INFO ]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 17 [2018-06-18 11:52:47,511 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:47,511 INFO ]: Abstraction has 21 states and 27 transitions. [2018-06-18 11:52:47,511 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:52:47,511 INFO ]: Start isEmpty. Operand 21 states and 27 transitions. [2018-06-18 11:52:47,512 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-18 11:52:47,512 INFO ]: Found error trace [2018-06-18 11:52:47,512 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:47,513 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:47,513 INFO ]: Analyzing trace with hash -793503654, now seen corresponding path program 1 times [2018-06-18 11:52:47,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:47,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:47,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,514 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:47,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,524 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:47,525 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:47,633 INFO ]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-18 11:52:47,633 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-18 11:52:47,633 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-18 11:52:47,633 INFO ]: Interpolant automaton has 4 states [2018-06-18 11:52:47,633 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-18 11:52:47,633 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:47,634 INFO ]: Start difference. First operand 21 states and 27 transitions. Second operand 4 states. [2018-06-18 11:52:47,673 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:47,673 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-18 11:52:47,673 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-18 11:52:47,673 INFO ]: Start accepts. Automaton has 4 states. Word has length 17 [2018-06-18 11:52:47,673 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:47,674 INFO ]: With dead ends: 23 [2018-06-18 11:52:47,674 INFO ]: Without dead ends: 23 [2018-06-18 11:52:47,674 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-18 11:52:47,674 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 11:52:47,678 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-06-18 11:52:47,678 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-18 11:52:47,679 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-06-18 11:52:47,679 INFO ]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2018-06-18 11:52:47,679 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:47,679 INFO ]: Abstraction has 21 states and 26 transitions. [2018-06-18 11:52:47,679 INFO ]: Interpolant automaton has 4 states. [2018-06-18 11:52:47,679 INFO ]: Start isEmpty. Operand 21 states and 26 transitions. [2018-06-18 11:52:47,680 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-18 11:52:47,680 INFO ]: Found error trace [2018-06-18 11:52:47,680 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:47,680 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:47,680 INFO ]: Analyzing trace with hash 1609383847, now seen corresponding path program 1 times [2018-06-18 11:52:47,680 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:47,680 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:47,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,681 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:47,681 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:47,703 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:47,703 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:47,799 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-18 11:52:47,799 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:47,799 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:47,806 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:47,823 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:47,826 INFO ]: Computing forward predicates... [2018-06-18 11:52:47,897 INFO ]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-18 11:52:47,923 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:47,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-06-18 11:52:47,923 INFO ]: Interpolant automaton has 10 states [2018-06-18 11:52:47,923 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-18 11:52:47,923 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-18 11:52:47,924 INFO ]: Start difference. First operand 21 states and 26 transitions. Second operand 10 states. [2018-06-18 11:52:48,133 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:48,133 INFO ]: Finished difference Result 25 states and 30 transitions. [2018-06-18 11:52:48,134 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-18 11:52:48,134 INFO ]: Start accepts. Automaton has 10 states. Word has length 21 [2018-06-18 11:52:48,134 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:48,135 INFO ]: With dead ends: 25 [2018-06-18 11:52:48,135 INFO ]: Without dead ends: 23 [2018-06-18 11:52:48,135 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-06-18 11:52:48,135 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-18 11:52:48,139 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-18 11:52:48,139 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-18 11:52:48,140 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-06-18 11:52:48,140 INFO ]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 21 [2018-06-18 11:52:48,140 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:48,140 INFO ]: Abstraction has 23 states and 28 transitions. [2018-06-18 11:52:48,140 INFO ]: Interpolant automaton has 10 states. [2018-06-18 11:52:48,140 INFO ]: Start isEmpty. Operand 23 states and 28 transitions. [2018-06-18 11:52:48,141 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 11:52:48,141 INFO ]: Found error trace [2018-06-18 11:52:48,141 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:48,141 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:48,141 INFO ]: Analyzing trace with hash -262857205, now seen corresponding path program 2 times [2018-06-18 11:52:48,141 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:48,141 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:48,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:48,142 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:48,142 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:48,160 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:48,161 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:48,364 INFO ]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-18 11:52:48,364 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:48,364 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-18 11:52:48,379 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:48,430 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:52:48,430 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:48,433 INFO ]: Computing forward predicates... [2018-06-18 11:52:48,589 INFO ]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-18 11:52:48,610 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:48,611 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2018-06-18 11:52:48,611 INFO ]: Interpolant automaton has 15 states [2018-06-18 11:52:48,611 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-18 11:52:48,611 INFO ]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-06-18 11:52:48,611 INFO ]: Start difference. First operand 23 states and 28 transitions. Second operand 15 states. [2018-06-18 11:52:49,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:49,026 INFO ]: Finished difference Result 35 states and 44 transitions. [2018-06-18 11:52:49,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 11:52:49,028 INFO ]: Start accepts. Automaton has 15 states. Word has length 25 [2018-06-18 11:52:49,028 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:49,028 INFO ]: With dead ends: 35 [2018-06-18 11:52:49,028 INFO ]: Without dead ends: 35 [2018-06-18 11:52:49,029 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2018-06-18 11:52:49,029 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:52:49,039 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-06-18 11:52:49,039 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-18 11:52:49,040 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-06-18 11:52:49,040 INFO ]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 25 [2018-06-18 11:52:49,041 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:49,041 INFO ]: Abstraction has 31 states and 39 transitions. [2018-06-18 11:52:49,041 INFO ]: Interpolant automaton has 15 states. [2018-06-18 11:52:49,041 INFO ]: Start isEmpty. Operand 31 states and 39 transitions. [2018-06-18 11:52:49,042 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-18 11:52:49,042 INFO ]: Found error trace [2018-06-18 11:52:49,042 INFO ]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:49,042 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:49,042 INFO ]: Analyzing trace with hash -114701437, now seen corresponding path program 1 times [2018-06-18 11:52:49,042 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:49,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:49,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:49,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:52:49,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:49,080 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:49,081 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:49,651 INFO ]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-18 11:52:49,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:49,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:49,658 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:49,677 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:49,681 INFO ]: Computing forward predicates... [2018-06-18 11:52:49,847 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (and (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (store c_INV_MAIN_1_hbv_INV_MAIN_1_2_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select c_INV_MAIN_1_hbv_INV_MAIN_1_2_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) is different from true [2018-06-18 11:52:49,881 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (and (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int 0) (<= 0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) is different from true [2018-06-18 11:52:49,892 WARN ]: unable to prove that (exists ((v_prenex_3 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (and (<= 0 v_prenex_3) (= (let ((.cse0 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_prenex_3) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_prenex_3 1))))) (store .cse0 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse0 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (<= v_prenex_3 0))) is different from true [2018-06-18 11:52:50,035 INFO ]: detected equality via solver [2018-06-18 11:52:50,069 INFO ]: detected not equals via solver [2018-06-18 11:52:50,090 INFO ]: detected not equals via solver [2018-06-18 11:52:50,113 INFO ]: detected not equals via solver [2018-06-18 11:52:50,124 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2018-06-18 11:52:50,219 INFO ]: detected not equals via solver [2018-06-18 11:52:50,219 INFO ]: detected not equals via solver [2018-06-18 11:52:50,220 INFO ]: detected equality via solver [2018-06-18 11:52:50,221 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-06-18 11:52:50,221 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:50,229 INFO ]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:52:50,234 INFO ]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:52:50,234 INFO ]: Needed 3 recursive calls to eliminate 4 variables, input treesize:52, output treesize:3 [2018-06-18 11:52:50,275 INFO ]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 7 not checked. [2018-06-18 11:52:50,297 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:50,297 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-18 11:52:50,297 INFO ]: Interpolant automaton has 19 states [2018-06-18 11:52:50,297 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-18 11:52:50,297 INFO ]: CoverageRelationStatistics Valid=44, Invalid=204, Unknown=4, NotChecked=90, Total=342 [2018-06-18 11:52:50,298 INFO ]: Start difference. First operand 31 states and 39 transitions. Second operand 19 states. [2018-06-18 11:52:51,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:51,094 INFO ]: Finished difference Result 35 states and 43 transitions. [2018-06-18 11:52:51,095 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 11:52:51,096 INFO ]: Start accepts. Automaton has 19 states. Word has length 25 [2018-06-18 11:52:51,096 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:51,097 INFO ]: With dead ends: 35 [2018-06-18 11:52:51,097 INFO ]: Without dead ends: 35 [2018-06-18 11:52:51,098 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=86, Invalid=384, Unknown=4, NotChecked=126, Total=600 [2018-06-18 11:52:51,098 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:52:51,103 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-18 11:52:51,103 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-18 11:52:51,104 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-06-18 11:52:51,104 INFO ]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 25 [2018-06-18 11:52:51,105 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:51,105 INFO ]: Abstraction has 33 states and 41 transitions. [2018-06-18 11:52:51,105 INFO ]: Interpolant automaton has 19 states. [2018-06-18 11:52:51,105 INFO ]: Start isEmpty. Operand 33 states and 41 transitions. [2018-06-18 11:52:51,106 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 11:52:51,106 INFO ]: Found error trace [2018-06-18 11:52:51,106 INFO ]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:51,106 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:51,106 INFO ]: Analyzing trace with hash 707773671, now seen corresponding path program 2 times [2018-06-18 11:52:51,106 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:51,106 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:51,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:51,108 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:52:51,108 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:51,122 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:51,123 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:51,236 INFO ]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-18 11:52:51,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:51,236 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:51,245 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:52:51,290 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:52:51,290 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:51,293 INFO ]: Computing forward predicates... [2018-06-18 11:52:51,415 INFO ]: Checked inductivity of 24 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-18 11:52:51,449 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:51,449 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-18 11:52:51,449 INFO ]: Interpolant automaton has 15 states [2018-06-18 11:52:51,449 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-18 11:52:51,449 INFO ]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-06-18 11:52:51,450 INFO ]: Start difference. First operand 33 states and 41 transitions. Second operand 15 states. [2018-06-18 11:52:51,728 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:51,728 INFO ]: Finished difference Result 35 states and 42 transitions. [2018-06-18 11:52:51,729 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-18 11:52:51,729 INFO ]: Start accepts. Automaton has 15 states. Word has length 29 [2018-06-18 11:52:51,729 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:51,730 INFO ]: With dead ends: 35 [2018-06-18 11:52:51,730 INFO ]: Without dead ends: 35 [2018-06-18 11:52:51,731 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-06-18 11:52:51,731 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:52:51,736 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-06-18 11:52:51,736 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-18 11:52:51,737 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-06-18 11:52:51,737 INFO ]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 29 [2018-06-18 11:52:51,737 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:51,737 INFO ]: Abstraction has 33 states and 40 transitions. [2018-06-18 11:52:51,737 INFO ]: Interpolant automaton has 15 states. [2018-06-18 11:52:51,737 INFO ]: Start isEmpty. Operand 33 states and 40 transitions. [2018-06-18 11:52:51,738 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-18 11:52:51,738 INFO ]: Found error trace [2018-06-18 11:52:51,738 INFO ]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:51,738 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:51,738 INFO ]: Analyzing trace with hash 117106440, now seen corresponding path program 3 times [2018-06-18 11:52:51,738 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:51,738 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:51,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:51,739 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:52:51,739 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:51,760 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:51,761 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:51,886 INFO ]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-18 11:52:51,886 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:51,886 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:51,892 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 11:52:51,914 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-18 11:52:51,915 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:51,917 INFO ]: Computing forward predicates... [2018-06-18 11:52:52,015 INFO ]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-18 11:52:52,035 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:52,035 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-06-18 11:52:52,036 INFO ]: Interpolant automaton has 14 states [2018-06-18 11:52:52,036 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-18 11:52:52,036 INFO ]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-06-18 11:52:52,036 INFO ]: Start difference. First operand 33 states and 40 transitions. Second operand 14 states. [2018-06-18 11:52:52,419 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:52,419 INFO ]: Finished difference Result 31 states and 36 transitions. [2018-06-18 11:52:52,419 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-18 11:52:52,419 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-18 11:52:52,420 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:52,420 INFO ]: With dead ends: 31 [2018-06-18 11:52:52,420 INFO ]: Without dead ends: 27 [2018-06-18 11:52:52,421 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-06-18 11:52:52,421 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-18 11:52:52,425 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-18 11:52:52,425 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-18 11:52:52,426 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-06-18 11:52:52,426 INFO ]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 29 [2018-06-18 11:52:52,426 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:52,426 INFO ]: Abstraction has 27 states and 32 transitions. [2018-06-18 11:52:52,426 INFO ]: Interpolant automaton has 14 states. [2018-06-18 11:52:52,426 INFO ]: Start isEmpty. Operand 27 states and 32 transitions. [2018-06-18 11:52:52,427 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 11:52:52,427 INFO ]: Found error trace [2018-06-18 11:52:52,427 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:52,427 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:52,427 INFO ]: Analyzing trace with hash -2034201228, now seen corresponding path program 3 times [2018-06-18 11:52:52,427 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:52,427 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:52,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:52,428 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:52:52,428 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:52,445 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:52,446 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:52,944 INFO ]: Checked inductivity of 31 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-06-18 11:52:52,944 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:52,944 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:52,953 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 11:52:52,984 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-18 11:52:52,984 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:52,987 INFO ]: Computing forward predicates... [2018-06-18 11:52:53,085 INFO ]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-18 11:52:53,106 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:53,106 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7] total 18 [2018-06-18 11:52:53,106 INFO ]: Interpolant automaton has 18 states [2018-06-18 11:52:53,106 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-18 11:52:53,106 INFO ]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-06-18 11:52:53,106 INFO ]: Start difference. First operand 27 states and 32 transitions. Second operand 18 states. [2018-06-18 11:52:53,669 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:52:53,669 INFO ]: Finished difference Result 41 states and 50 transitions. [2018-06-18 11:52:53,669 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-18 11:52:53,669 INFO ]: Start accepts. Automaton has 18 states. Word has length 33 [2018-06-18 11:52:53,669 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:52:53,670 INFO ]: With dead ends: 41 [2018-06-18 11:52:53,670 INFO ]: Without dead ends: 41 [2018-06-18 11:52:53,670 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2018-06-18 11:52:53,670 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-18 11:52:53,676 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-06-18 11:52:53,676 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-18 11:52:53,677 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-06-18 11:52:53,677 INFO ]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 33 [2018-06-18 11:52:53,677 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:52:53,677 INFO ]: Abstraction has 37 states and 45 transitions. [2018-06-18 11:52:53,677 INFO ]: Interpolant automaton has 18 states. [2018-06-18 11:52:53,677 INFO ]: Start isEmpty. Operand 37 states and 45 transitions. [2018-06-18 11:52:53,678 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-18 11:52:53,678 INFO ]: Found error trace [2018-06-18 11:52:53,678 INFO ]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:52:53,678 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:52:53,679 INFO ]: Analyzing trace with hash 468156140, now seen corresponding path program 4 times [2018-06-18 11:52:53,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:52:53,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:52:53,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:53,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:52:53,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:52:53,709 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:53,709 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:52:54,592 WARN ]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-06-18 11:52:54,686 INFO ]: Checked inductivity of 31 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-18 11:52:54,686 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:52:54,686 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:52:54,692 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 11:52:54,714 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 11:52:54,714 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:52:54,718 INFO ]: Computing forward predicates... [2018-06-18 11:52:55,094 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))) (and (<= .cse0 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int))) (let ((.cse1 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse2)))) (store .cse1 .cse2 (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse0)))) is different from true [2018-06-18 11:52:55,112 WARN ]: unable to prove that (exists ((v_subst_1 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ v_subst_1 1))) (and (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (< INV_MAIN_1_hbv_INV_MAIN_1_1_Int c_INV_MAIN_1_hhv_INV_MAIN_1_1_Int) (= (let ((.cse1 (let ((.cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_1))) (let ((.cse2 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_1 (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse3)))) (store .cse2 .cse3 (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_1 1))))))) (store .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int)))) is different from true [2018-06-18 11:52:55,363 WARN ]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-18 11:52:55,624 INFO ]: detected not equals via solver [2018-06-18 11:52:55,625 INFO ]: detected not equals via solver [2018-06-18 11:52:55,626 INFO ]: detected not equals via solver [2018-06-18 11:52:55,628 INFO ]: detected not equals via solver [2018-06-18 11:52:55,630 INFO ]: detected not equals via solver [2018-06-18 11:52:55,657 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 166 [2018-06-18 11:52:55,786 WARN ]: Spent 124.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 84 [2018-06-18 11:52:55,789 INFO ]: detected not equals via solver [2018-06-18 11:52:55,790 INFO ]: detected not equals via solver [2018-06-18 11:52:55,791 INFO ]: detected not equals via solver [2018-06-18 11:52:55,791 INFO ]: detected not equals via solver [2018-06-18 11:52:55,793 INFO ]: detected not equals via solver [2018-06-18 11:52:55,795 INFO ]: detected not equals via solver [2018-06-18 11:52:55,797 INFO ]: detected not equals via solver [2018-06-18 11:52:55,798 INFO ]: detected not equals via solver [2018-06-18 11:52:55,798 INFO ]: detected not equals via solver [2018-06-18 11:52:55,799 INFO ]: detected not equals via solver [2018-06-18 11:52:55,857 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 87 treesize of output 213 [2018-06-18 11:52:56,429 WARN ]: Spent 550.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 139 [2018-06-18 11:52:56,435 INFO ]: detected not equals via solver [2018-06-18 11:52:56,436 INFO ]: detected not equals via solver [2018-06-18 11:52:56,437 INFO ]: detected not equals via solver [2018-06-18 11:52:56,437 INFO ]: detected not equals via solver [2018-06-18 11:52:56,438 INFO ]: detected not equals via solver [2018-06-18 11:52:56,439 INFO ]: detected not equals via solver [2018-06-18 11:52:56,439 INFO ]: detected not equals via solver [2018-06-18 11:52:56,440 INFO ]: detected not equals via solver [2018-06-18 11:52:56,441 INFO ]: detected not equals via solver [2018-06-18 11:52:56,441 INFO ]: detected not equals via solver [2018-06-18 11:52:56,443 INFO ]: detected not equals via solver [2018-06-18 11:52:56,443 INFO ]: detected not equals via solver [2018-06-18 11:52:56,510 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 168 [2018-06-18 11:52:56,517 INFO ]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-06-18 11:52:56,726 INFO ]: detected not equals via solver [2018-06-18 11:52:56,726 INFO ]: detected not equals via solver [2018-06-18 11:52:56,727 INFO ]: detected not equals via solver [2018-06-18 11:52:56,727 INFO ]: detected not equals via solver [2018-06-18 11:52:56,727 INFO ]: detected equality via solver [2018-06-18 11:52:56,728 INFO ]: detected not equals via solver [2018-06-18 11:52:56,728 INFO ]: detected not equals via solver [2018-06-18 11:52:56,729 INFO ]: detected equality via solver [2018-06-18 11:52:56,729 INFO ]: detected equality via solver [2018-06-18 11:52:56,736 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 85 [2018-06-18 11:52:56,737 INFO ]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:56,869 INFO ]: detected not equals via solver [2018-06-18 11:52:56,870 INFO ]: detected not equals via solver [2018-06-18 11:52:56,870 INFO ]: detected not equals via solver [2018-06-18 11:52:56,871 INFO ]: detected not equals via solver [2018-06-18 11:52:56,872 INFO ]: detected not equals via solver [2018-06-18 11:52:56,872 INFO ]: detected not equals via solver [2018-06-18 11:52:56,875 INFO ]: detected not equals via solver [2018-06-18 11:52:56,897 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 106 [2018-06-18 11:52:56,904 INFO ]: Start of recursive call 6: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-06-18 11:52:57,160 INFO ]: detected not equals via solver [2018-06-18 11:52:57,160 INFO ]: detected not equals via solver [2018-06-18 11:52:57,161 INFO ]: detected not equals via solver [2018-06-18 11:52:57,162 INFO ]: detected not equals via solver [2018-06-18 11:52:57,162 INFO ]: detected not equals via solver [2018-06-18 11:52:57,163 INFO ]: detected not equals via solver [2018-06-18 11:52:57,166 INFO ]: detected not equals via solver [2018-06-18 11:52:57,187 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 106 [2018-06-18 11:52:57,194 INFO ]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-06-18 11:52:57,364 INFO ]: detected not equals via solver [2018-06-18 11:52:57,365 INFO ]: detected not equals via solver [2018-06-18 11:52:57,365 INFO ]: detected not equals via solver [2018-06-18 11:52:57,366 INFO ]: detected not equals via solver [2018-06-18 11:52:57,367 INFO ]: detected not equals via solver [2018-06-18 11:52:57,368 INFO ]: detected not equals via solver [2018-06-18 11:52:57,370 INFO ]: detected not equals via solver [2018-06-18 11:52:57,372 INFO ]: detected not equals via solver [2018-06-18 11:52:57,373 INFO ]: detected not equals via solver [2018-06-18 11:52:57,423 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 148 [2018-06-18 11:52:57,469 INFO ]: Start of recursive call 8: 22 dim-0 vars, End of recursive call: 22 dim-0 vars, and 32 xjuncts. [2018-06-18 11:52:57,952 INFO ]: Start of recursive call 3: 8 dim-1 vars, End of recursive call: 17 dim-0 vars, and 19 xjuncts. [2018-06-18 11:52:57,961 WARN ]: Array PQE input equivalent to false [2018-06-18 11:52:57,961 INFO ]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:58,353 INFO ]: detected not equals via solver [2018-06-18 11:52:58,354 INFO ]: detected not equals via solver [2018-06-18 11:52:58,354 INFO ]: detected not equals via solver [2018-06-18 11:52:58,355 INFO ]: detected not equals via solver [2018-06-18 11:52:58,355 INFO ]: detected not equals via solver [2018-06-18 11:52:58,356 INFO ]: detected not equals via solver [2018-06-18 11:52:58,365 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 112 [2018-06-18 11:52:58,432 INFO ]: detected not equals via solver [2018-06-18 11:52:58,455 INFO ]: detected not equals via solver [2018-06-18 11:52:58,485 INFO ]: detected not equals via solver [2018-06-18 11:52:58,506 INFO ]: detected not equals via solver [2018-06-18 11:52:58,509 INFO ]: detected not equals via solver [2018-06-18 11:52:58,510 INFO ]: detected not equals via solver [2018-06-18 11:52:58,514 INFO ]: Index analysis took 120 ms [2018-06-18 11:52:58,515 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 54 [2018-06-18 11:52:58,515 INFO ]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-06-18 11:52:58,527 INFO ]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:52:58,569 INFO ]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-18 11:52:58,581 INFO ]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-18 11:52:58,582 INFO ]: Needed 11 recursive calls to eliminate 4 variables, input treesize:191, output treesize:25 [2018-06-18 11:52:58,810 INFO ]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 10 not checked. [2018-06-18 11:52:58,831 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:52:58,831 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2018-06-18 11:52:58,831 INFO ]: Interpolant automaton has 29 states [2018-06-18 11:52:58,832 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-18 11:52:58,832 INFO ]: CoverageRelationStatistics Valid=74, Invalid=633, Unknown=3, NotChecked=102, Total=812 [2018-06-18 11:52:58,832 INFO ]: Start difference. First operand 37 states and 45 transitions. Second operand 29 states. [2018-06-18 11:52:59,361 WARN ]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-06-18 11:52:59,762 WARN ]: Spent 173.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2018-06-18 11:53:00,092 WARN ]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2018-06-18 11:53:00,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:00,598 INFO ]: Finished difference Result 49 states and 58 transitions. [2018-06-18 11:53:00,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-18 11:53:00,599 INFO ]: Start accepts. Automaton has 29 states. Word has length 33 [2018-06-18 11:53:00,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:00,600 INFO ]: With dead ends: 49 [2018-06-18 11:53:00,600 INFO ]: Without dead ends: 49 [2018-06-18 11:53:00,600 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=186, Invalid=1297, Unknown=7, NotChecked=150, Total=1640 [2018-06-18 11:53:00,600 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-18 11:53:00,607 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-06-18 11:53:00,607 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-18 11:53:00,608 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2018-06-18 11:53:00,609 INFO ]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 33 [2018-06-18 11:53:00,609 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:00,609 INFO ]: Abstraction has 47 states and 56 transitions. [2018-06-18 11:53:00,609 INFO ]: Interpolant automaton has 29 states. [2018-06-18 11:53:00,609 INFO ]: Start isEmpty. Operand 47 states and 56 transitions. [2018-06-18 11:53:00,610 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-18 11:53:00,610 INFO ]: Found error trace [2018-06-18 11:53:00,610 INFO ]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:00,610 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:00,610 INFO ]: Analyzing trace with hash 1729655601, now seen corresponding path program 5 times [2018-06-18 11:53:00,611 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:00,611 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:00,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:00,611 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:53:00,611 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:00,633 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:00,634 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:00,927 INFO ]: Checked inductivity of 42 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-18 11:53:00,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:00,927 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-18 11:53:00,944 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:00,981 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-18 11:53:00,981 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:00,985 INFO ]: Computing forward predicates... [2018-06-18 11:53:01,263 INFO ]: Checked inductivity of 42 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-06-18 11:53:01,283 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:53:01,283 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-06-18 11:53:01,283 INFO ]: Interpolant automaton has 17 states [2018-06-18 11:53:01,283 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-18 11:53:01,284 INFO ]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-06-18 11:53:01,284 INFO ]: Start difference. First operand 47 states and 56 transitions. Second operand 17 states. [2018-06-18 11:53:01,453 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:01,453 INFO ]: Finished difference Result 45 states and 52 transitions. [2018-06-18 11:53:01,453 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-18 11:53:01,453 INFO ]: Start accepts. Automaton has 17 states. Word has length 37 [2018-06-18 11:53:01,453 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:01,454 INFO ]: With dead ends: 45 [2018-06-18 11:53:01,454 INFO ]: Without dead ends: 39 [2018-06-18 11:53:01,454 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2018-06-18 11:53:01,454 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-18 11:53:01,461 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-18 11:53:01,461 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-18 11:53:01,462 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-06-18 11:53:01,462 INFO ]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 37 [2018-06-18 11:53:01,462 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:01,462 INFO ]: Abstraction has 39 states and 46 transitions. [2018-06-18 11:53:01,462 INFO ]: Interpolant automaton has 17 states. [2018-06-18 11:53:01,462 INFO ]: Start isEmpty. Operand 39 states and 46 transitions. [2018-06-18 11:53:01,463 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 11:53:01,463 INFO ]: Found error trace [2018-06-18 11:53:01,463 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:01,463 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:01,464 INFO ]: Analyzing trace with hash -158511843, now seen corresponding path program 4 times [2018-06-18 11:53:01,464 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:01,464 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:01,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:01,464 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:53:01,464 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:01,478 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:01,479 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:01,769 INFO ]: Checked inductivity of 57 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-18 11:53:01,769 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:01,769 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:01,776 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 11:53:01,801 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 11:53:01,801 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:01,804 INFO ]: Computing forward predicates... [2018-06-18 11:53:02,157 INFO ]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-18 11:53:02,178 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:53:02,178 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 21 [2018-06-18 11:53:02,179 INFO ]: Interpolant automaton has 21 states [2018-06-18 11:53:02,179 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-18 11:53:02,179 INFO ]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-06-18 11:53:02,179 INFO ]: Start difference. First operand 39 states and 46 transitions. Second operand 21 states. [2018-06-18 11:53:02,984 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:02,985 INFO ]: Finished difference Result 47 states and 57 transitions. [2018-06-18 11:53:02,986 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-18 11:53:02,986 INFO ]: Start accepts. Automaton has 21 states. Word has length 41 [2018-06-18 11:53:02,986 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:02,987 INFO ]: With dead ends: 47 [2018-06-18 11:53:02,987 INFO ]: Without dead ends: 47 [2018-06-18 11:53:02,988 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2018-06-18 11:53:02,988 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-18 11:53:02,995 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-06-18 11:53:02,995 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-18 11:53:02,996 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-06-18 11:53:02,996 INFO ]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 41 [2018-06-18 11:53:03,005 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:03,005 INFO ]: Abstraction has 43 states and 52 transitions. [2018-06-18 11:53:03,005 INFO ]: Interpolant automaton has 21 states. [2018-06-18 11:53:03,005 INFO ]: Start isEmpty. Operand 43 states and 52 transitions. [2018-06-18 11:53:03,006 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 11:53:03,006 INFO ]: Found error trace [2018-06-18 11:53:03,006 INFO ]: trace histogram [6, 5, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:03,006 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:03,006 INFO ]: Analyzing trace with hash -2136991308, now seen corresponding path program 6 times [2018-06-18 11:53:03,006 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:03,006 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:03,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:03,007 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:53:03,007 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:03,043 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:03,050 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:03,846 INFO ]: Checked inductivity of 65 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-06-18 11:53:03,846 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:03,846 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:03,852 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-18 11:53:03,886 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-18 11:53:03,886 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:03,889 INFO ]: Computing forward predicates... [2018-06-18 11:53:04,119 INFO ]: Checked inductivity of 65 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-06-18 11:53:04,141 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:53:04,141 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 20 [2018-06-18 11:53:04,141 INFO ]: Interpolant automaton has 20 states [2018-06-18 11:53:04,142 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 11:53:04,142 INFO ]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-06-18 11:53:04,142 INFO ]: Start difference. First operand 43 states and 52 transitions. Second operand 20 states. [2018-06-18 11:53:04,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:04,605 INFO ]: Finished difference Result 45 states and 53 transitions. [2018-06-18 11:53:04,605 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-18 11:53:04,605 INFO ]: Start accepts. Automaton has 20 states. Word has length 41 [2018-06-18 11:53:04,606 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:04,606 INFO ]: With dead ends: 45 [2018-06-18 11:53:04,606 INFO ]: Without dead ends: 45 [2018-06-18 11:53:04,607 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2018-06-18 11:53:04,607 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-18 11:53:04,617 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-06-18 11:53:04,617 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-18 11:53:04,618 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-06-18 11:53:04,618 INFO ]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 41 [2018-06-18 11:53:04,618 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:04,618 INFO ]: Abstraction has 43 states and 51 transitions. [2018-06-18 11:53:04,618 INFO ]: Interpolant automaton has 20 states. [2018-06-18 11:53:04,618 INFO ]: Start isEmpty. Operand 43 states and 51 transitions. [2018-06-18 11:53:04,619 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-18 11:53:04,619 INFO ]: Found error trace [2018-06-18 11:53:04,619 INFO ]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:04,619 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:04,620 INFO ]: Analyzing trace with hash -746421611, now seen corresponding path program 7 times [2018-06-18 11:53:04,620 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:04,620 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:04,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:04,620 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:53:04,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:04,809 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:04,810 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:06,126 INFO ]: Checked inductivity of 57 backedges. 3 proven. 34 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-18 11:53:06,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:06,127 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:06,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:53:06,161 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:06,167 INFO ]: Computing forward predicates... [2018-06-18 11:53:06,422 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))) (and (<= .cse0 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int))) (let ((.cse1 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse2)))) (store .cse1 .cse2 (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse0)))) is different from true [2018-06-18 11:53:06,430 WARN ]: unable to prove that (exists ((v_subst_2 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (.cse1 (+ v_subst_2 1))) (and (<= .cse0 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (<= .cse1 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse0) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse1) (= (let ((.cse2 (let ((.cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2))) (let ((.cse3 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2 (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse4)))) (store .cse3 .cse4 (select .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2 1))))))) (store .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int)))) is different from true [2018-06-18 11:53:06,441 WARN ]: unable to prove that (exists ((v_subst_3 Int) (v_subst_2 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ v_subst_3 1)) (.cse5 (+ v_subst_2 1))) (and (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse1 (let ((.cse2 (let ((.cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2))) (let ((.cse3 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2 (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse4)))) (store .cse3 .cse4 (select .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_2 1))))))) (store .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_3) (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_3 1)))))) (store .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))))) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (< INV_MAIN_1_hbv_INV_MAIN_1_1_Int c_INV_MAIN_1_hhv_INV_MAIN_1_1_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (<= v_subst_3 .cse5) (<= .cse5 v_subst_3)))) is different from true [2018-06-18 11:53:06,856 INFO ]: detected not equals via solver [2018-06-18 11:53:06,861 INFO ]: detected not equals via solver [2018-06-18 11:53:06,877 INFO ]: detected not equals via solver [2018-06-18 11:53:06,884 INFO ]: detected not equals via solver [2018-06-18 11:53:06,885 INFO ]: detected not equals via solver [2018-06-18 11:53:06,889 INFO ]: detected not equals via solver [2018-06-18 11:53:06,890 INFO ]: detected not equals via solver [2018-06-18 11:53:06,937 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 365 treesize of output 354 [2018-06-18 11:53:07,942 WARN ]: Spent 997.00 ms on a formula simplification. DAG size of input: 252 DAG size of output: 144 [2018-06-18 11:53:07,948 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:07,948 INFO ]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:07,952 INFO ]: detected not equals via solver [2018-06-18 11:53:07,953 INFO ]: detected not equals via solver [2018-06-18 11:53:07,954 INFO ]: detected not equals via solver [2018-06-18 11:53:07,954 INFO ]: detected not equals via solver [2018-06-18 11:53:07,955 INFO ]: detected not equals via solver [2018-06-18 11:53:07,956 INFO ]: detected not equals via solver [2018-06-18 11:53:07,965 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 193 [2018-06-18 11:53:08,019 INFO ]: detected not equals via solver [2018-06-18 11:53:08,019 INFO ]: detected not equals via solver [2018-06-18 11:53:08,020 INFO ]: detected not equals via solver [2018-06-18 11:53:08,021 INFO ]: detected equality via solver [2018-06-18 11:53:08,021 INFO ]: detected not equals via solver [2018-06-18 11:53:08,022 INFO ]: detected not equals via solver [2018-06-18 11:53:08,023 INFO ]: detected not equals via solver [2018-06-18 11:53:08,033 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 138 [2018-06-18 11:53:08,368 WARN ]: Spent 334.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2018-06-18 11:53:08,372 INFO ]: detected not equals via solver [2018-06-18 11:53:08,372 INFO ]: detected not equals via solver [2018-06-18 11:53:08,373 INFO ]: detected not equals via solver [2018-06-18 11:53:08,373 INFO ]: detected not equals via solver [2018-06-18 11:53:08,374 INFO ]: detected not equals via solver [2018-06-18 11:53:08,374 INFO ]: detected not equals via solver [2018-06-18 11:53:08,375 INFO ]: detected not equals via solver [2018-06-18 11:53:08,375 INFO ]: detected not equals via solver [2018-06-18 11:53:08,376 INFO ]: detected not equals via solver [2018-06-18 11:53:08,376 INFO ]: detected not equals via solver [2018-06-18 11:53:08,384 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 102 [2018-06-18 11:53:08,385 INFO ]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,387 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,387 INFO ]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,389 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,389 INFO ]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,391 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,391 INFO ]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,393 INFO ]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,394 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,394 INFO ]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,400 INFO ]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,465 INFO ]: detected not equals via solver [2018-06-18 11:53:08,466 INFO ]: detected not equals via solver [2018-06-18 11:53:08,466 INFO ]: detected not equals via solver [2018-06-18 11:53:08,467 INFO ]: detected not equals via solver [2018-06-18 11:53:08,468 INFO ]: detected not equals via solver [2018-06-18 11:53:08,468 INFO ]: detected not equals via solver [2018-06-18 11:53:08,475 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 187 [2018-06-18 11:53:08,504 INFO ]: detected not equals via solver [2018-06-18 11:53:08,504 INFO ]: detected not equals via solver [2018-06-18 11:53:08,505 INFO ]: detected not equals via solver [2018-06-18 11:53:08,506 INFO ]: detected equality via solver [2018-06-18 11:53:08,506 INFO ]: detected not equals via solver [2018-06-18 11:53:08,507 INFO ]: detected not equals via solver [2018-06-18 11:53:08,508 INFO ]: detected not equals via solver [2018-06-18 11:53:08,515 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 138 [2018-06-18 11:53:08,633 WARN ]: Spent 116.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2018-06-18 11:53:08,637 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,637 INFO ]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,640 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,641 INFO ]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,644 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,644 INFO ]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,647 INFO ]: detected not equals via solver [2018-06-18 11:53:08,647 INFO ]: detected not equals via solver [2018-06-18 11:53:08,650 INFO ]: detected not equals via solver [2018-06-18 11:53:08,650 INFO ]: detected not equals via solver [2018-06-18 11:53:08,651 INFO ]: detected not equals via solver [2018-06-18 11:53:08,651 INFO ]: detected not equals via solver [2018-06-18 11:53:08,652 INFO ]: detected not equals via solver [2018-06-18 11:53:08,652 INFO ]: detected not equals via solver [2018-06-18 11:53:08,653 INFO ]: detected not equals via solver [2018-06-18 11:53:08,654 INFO ]: detected not equals via solver [2018-06-18 11:53:08,661 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 102 [2018-06-18 11:53:08,662 INFO ]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,664 INFO ]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,666 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:08,666 INFO ]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,671 INFO ]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:53:08,834 INFO ]: detected not equals via solver [2018-06-18 11:53:08,859 INFO ]: detected not equals via solver [2018-06-18 11:53:08,883 INFO ]: detected not equals via solver [2018-06-18 11:53:08,935 INFO ]: detected not equals via solver [2018-06-18 11:53:09,009 INFO ]: detected not equals via solver [2018-06-18 11:53:09,033 INFO ]: detected not equals via solver [2018-06-18 11:53:09,046 INFO ]: detected not equals via solver [2018-06-18 11:53:09,047 INFO ]: detected not equals via solver [2018-06-18 11:53:09,048 INFO ]: detected not equals via solver [2018-06-18 11:53:09,049 INFO ]: detected not equals via solver [2018-06-18 11:53:09,051 INFO ]: detected not equals via solver [2018-06-18 11:53:09,052 INFO ]: detected not equals via solver [2018-06-18 11:53:09,081 INFO ]: Index analysis took 308 ms [2018-06-18 11:53:09,123 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 197 treesize of output 322 [2018-06-18 11:53:09,124 WARN ]: expecting exponential blowup for input size 6 [2018-06-18 11:53:15,043 WARN ]: Spent 5.88 s on a formula simplification. DAG size of input: 833 DAG size of output: 596 [2018-06-18 11:53:15,069 INFO ]: detected not equals via solver [2018-06-18 11:53:15,070 INFO ]: detected not equals via solver [2018-06-18 11:53:15,071 INFO ]: detected not equals via solver [2018-06-18 11:53:15,071 INFO ]: detected not equals via solver [2018-06-18 11:53:15,072 INFO ]: detected not equals via solver [2018-06-18 11:53:15,073 INFO ]: detected not equals via solver [2018-06-18 11:53:15,074 INFO ]: detected equality via solver [2018-06-18 11:53:15,076 INFO ]: detected not equals via solver [2018-06-18 11:53:15,077 INFO ]: detected not equals via solver [2018-06-18 11:53:15,078 INFO ]: detected not equals via solver [2018-06-18 11:53:15,079 INFO ]: detected not equals via solver [2018-06-18 11:53:15,080 INFO ]: detected not equals via solver [2018-06-18 11:53:15,081 INFO ]: detected not equals via solver [2018-06-18 11:53:15,082 INFO ]: detected not equals via solver [2018-06-18 11:53:15,082 INFO ]: detected not equals via solver [2018-06-18 11:53:15,083 INFO ]: detected not equals via solver [2018-06-18 11:53:15,085 INFO ]: detected not equals via solver [2018-06-18 11:53:15,086 INFO ]: detected not equals via solver [2018-06-18 11:53:15,086 INFO ]: detected not equals via solver [2018-06-18 11:53:15,087 INFO ]: detected not equals via solver [2018-06-18 11:53:15,088 INFO ]: detected not equals via solver [2018-06-18 11:53:15,088 INFO ]: detected not equals via solver [2018-06-18 11:53:15,089 INFO ]: detected not equals via solver [2018-06-18 11:53:15,090 INFO ]: detected not equals via solver [2018-06-18 11:53:15,091 INFO ]: detected not equals via solver [2018-06-18 11:53:15,142 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 389 [2018-06-18 11:53:16,023 WARN ]: Spent 871.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 95 [2018-06-18 11:53:16,053 INFO ]: detected not equals via solver [2018-06-18 11:53:16,056 INFO ]: detected not equals via solver [2018-06-18 11:53:16,057 INFO ]: detected not equals via solver [2018-06-18 11:53:16,058 INFO ]: detected not equals via solver [2018-06-18 11:53:16,060 INFO ]: detected not equals via solver [2018-06-18 11:53:16,060 INFO ]: detected not equals via solver [2018-06-18 11:53:16,063 INFO ]: detected not equals via solver [2018-06-18 11:53:16,064 INFO ]: detected not equals via solver [2018-06-18 11:53:16,065 INFO ]: detected not equals via solver [2018-06-18 11:53:16,066 INFO ]: detected not equals via solver [2018-06-18 11:53:16,067 INFO ]: detected not equals via solver [2018-06-18 11:53:16,068 INFO ]: detected not equals via solver [2018-06-18 11:53:16,069 INFO ]: detected not equals via solver [2018-06-18 11:53:16,069 INFO ]: detected not equals via solver [2018-06-18 11:53:16,070 INFO ]: detected not equals via solver [2018-06-18 11:53:16,071 INFO ]: detected not equals via solver [2018-06-18 11:53:16,073 INFO ]: detected not equals via solver [2018-06-18 11:53:16,073 INFO ]: detected not equals via solver [2018-06-18 11:53:16,074 INFO ]: detected not equals via solver [2018-06-18 11:53:16,083 INFO ]: detected not equals via solver [2018-06-18 11:53:16,083 INFO ]: detected not equals via solver [2018-06-18 11:53:16,084 INFO ]: detected not equals via solver [2018-06-18 11:53:16,085 INFO ]: detected not equals via solver [2018-06-18 11:53:16,165 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 23 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 5 case distinctions, treesize of input 124 treesize of output 326 [2018-06-18 11:53:16,208 INFO ]: Start of recursive call 20: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 32 xjuncts. [2018-06-18 11:53:16,806 INFO ]: detected not equals via solver [2018-06-18 11:53:16,806 INFO ]: detected not equals via solver [2018-06-18 11:53:16,807 INFO ]: detected not equals via solver [2018-06-18 11:53:16,807 INFO ]: detected not equals via solver [2018-06-18 11:53:16,808 INFO ]: detected not equals via solver [2018-06-18 11:53:16,808 INFO ]: detected equality via solver [2018-06-18 11:53:16,809 INFO ]: detected not equals via solver [2018-06-18 11:53:16,809 INFO ]: detected equality via solver [2018-06-18 11:53:16,810 INFO ]: detected not equals via solver [2018-06-18 11:53:16,810 INFO ]: detected not equals via solver [2018-06-18 11:53:16,811 INFO ]: detected not equals via solver [2018-06-18 11:53:16,811 INFO ]: detected not equals via solver [2018-06-18 11:53:16,812 INFO ]: detected not equals via solver [2018-06-18 11:53:16,812 INFO ]: detected equality via solver [2018-06-18 11:53:16,812 INFO ]: detected not equals via solver [2018-06-18 11:53:16,813 INFO ]: detected equality via solver [2018-06-18 11:53:16,826 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 152 [2018-06-18 11:53:16,827 INFO ]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:16,972 INFO ]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-18 11:53:16,976 WARN ]: Array PQE input equivalent to false [2018-06-18 11:53:16,976 INFO ]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:21,260 INFO ]: detected equality via solver [2018-06-18 11:53:21,267 INFO ]: detected not equals via solver [2018-06-18 11:53:21,275 INFO ]: detected not equals via solver [2018-06-18 11:53:21,283 INFO ]: detected not equals via solver [2018-06-18 11:53:21,304 INFO ]: detected not equals via solver [2018-06-18 11:53:21,309 INFO ]: detected not equals via solver [2018-06-18 11:53:21,313 INFO ]: detected equality via solver [2018-06-18 11:53:21,321 INFO ]: detected not equals via solver [2018-06-18 11:53:21,329 INFO ]: detected not equals via solver [2018-06-18 11:53:21,350 INFO ]: detected not equals via solver [2018-06-18 11:53:21,355 INFO ]: detected not equals via solver [2018-06-18 11:53:21,366 INFO ]: detected not equals via solver [2018-06-18 11:53:21,370 INFO ]: detected not equals via solver [2018-06-18 11:53:21,371 INFO ]: detected not equals via solver [2018-06-18 11:53:21,372 INFO ]: detected not equals via solver [2018-06-18 11:53:21,372 INFO ]: detected not equals via solver [2018-06-18 11:53:21,373 INFO ]: detected equality via solver [2018-06-18 11:53:21,393 INFO ]: Index analysis took 138 ms [2018-06-18 11:53:21,394 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 244 [2018-06-18 11:53:21,582 WARN ]: Spent 185.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 43 [2018-06-18 11:53:21,614 INFO ]: detected not equals via solver [2018-06-18 11:53:21,653 INFO ]: detected not equals via solver [2018-06-18 11:53:21,679 INFO ]: detected not equals via solver [2018-06-18 11:53:21,691 INFO ]: detected not equals via solver [2018-06-18 11:53:21,691 INFO ]: detected not equals via solver [2018-06-18 11:53:21,692 INFO ]: detected not equals via solver [2018-06-18 11:53:21,692 INFO ]: detected not equals via solver [2018-06-18 11:53:21,698 INFO ]: detected not equals via solver [2018-06-18 11:53:21,699 INFO ]: detected not equals via solver [2018-06-18 11:53:21,699 INFO ]: detected not equals via solver [2018-06-18 11:53:21,700 INFO ]: detected not equals via solver [2018-06-18 11:53:21,702 INFO ]: detected not equals via solver [2018-06-18 11:53:21,703 INFO ]: detected not equals via solver [2018-06-18 11:53:21,704 INFO ]: detected not equals via solver [2018-06-18 11:53:21,704 INFO ]: detected equality via solver [2018-06-18 11:53:21,705 INFO ]: detected not equals via solver [2018-06-18 11:53:21,705 INFO ]: detected not equals via solver [2018-06-18 11:53:21,705 INFO ]: detected equality via solver [2018-06-18 11:53:21,720 INFO ]: Index analysis took 136 ms [2018-06-18 11:53:21,720 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 166 [2018-06-18 11:53:21,721 INFO ]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:21,775 INFO ]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:53:23,175 INFO ]: detected not equals via solver [2018-06-18 11:53:23,200 INFO ]: detected not equals via solver [2018-06-18 11:53:23,212 INFO ]: detected not equals via solver [2018-06-18 11:53:23,225 INFO ]: detected not equals via solver [2018-06-18 11:53:23,228 INFO ]: detected not equals via solver [2018-06-18 11:53:23,229 INFO ]: detected not equals via solver [2018-06-18 11:53:23,229 INFO ]: detected equality via solver [2018-06-18 11:53:23,230 INFO ]: detected not equals via solver [2018-06-18 11:53:23,231 INFO ]: detected not equals via solver [2018-06-18 11:53:23,232 INFO ]: detected not equals via solver [2018-06-18 11:53:23,233 INFO ]: detected not equals via solver [2018-06-18 11:53:23,233 INFO ]: detected not equals via solver [2018-06-18 11:53:23,234 INFO ]: detected not equals via solver [2018-06-18 11:53:23,235 INFO ]: detected not equals via solver [2018-06-18 11:53:23,236 INFO ]: detected not equals via solver [2018-06-18 11:53:23,236 INFO ]: detected not equals via solver [2018-06-18 11:53:23,237 INFO ]: detected not equals via solver [2018-06-18 11:53:23,238 INFO ]: detected not equals via solver [2018-06-18 11:53:23,239 INFO ]: detected not equals via solver [2018-06-18 11:53:23,240 INFO ]: detected not equals via solver [2018-06-18 11:53:23,240 INFO ]: detected not equals via solver [2018-06-18 11:53:23,241 INFO ]: detected equality via solver [2018-06-18 11:53:23,266 INFO ]: Index analysis took 122 ms [2018-06-18 11:53:23,267 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 285 [2018-06-18 11:53:23,345 INFO ]: detected not equals via solver [2018-06-18 11:53:23,346 INFO ]: detected not equals via solver [2018-06-18 11:53:23,346 INFO ]: detected not equals via solver [2018-06-18 11:53:23,347 INFO ]: detected not equals via solver [2018-06-18 11:53:23,348 INFO ]: detected not equals via solver [2018-06-18 11:53:23,348 INFO ]: detected not equals via solver [2018-06-18 11:53:23,349 INFO ]: detected not equals via solver [2018-06-18 11:53:23,349 INFO ]: detected not equals via solver [2018-06-18 11:53:23,350 INFO ]: detected not equals via solver [2018-06-18 11:53:23,350 INFO ]: detected not equals via solver [2018-06-18 11:53:23,351 INFO ]: detected not equals via solver [2018-06-18 11:53:23,352 INFO ]: detected not equals via solver [2018-06-18 11:53:23,352 INFO ]: detected not equals via solver [2018-06-18 11:53:23,353 INFO ]: detected not equals via solver [2018-06-18 11:53:23,353 INFO ]: detected equality via solver [2018-06-18 11:53:23,365 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 141 [2018-06-18 11:53:23,365 INFO ]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-06-18 11:53:23,394 INFO ]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-06-18 11:53:23,486 INFO ]: Start of recursive call 18: 20 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-18 11:53:23,529 INFO ]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-18 11:53:23,556 INFO ]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-06-18 11:53:23,556 INFO ]: Needed 26 recursive calls to eliminate 5 variables, input treesize:521, output treesize:25 [2018-06-18 11:53:24,102 WARN ]: Spent 186.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2018-06-18 11:53:24,137 INFO ]: Checked inductivity of 57 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 18 not checked. [2018-06-18 11:53:24,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:53:24,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2018-06-18 11:53:24,200 INFO ]: Interpolant automaton has 32 states [2018-06-18 11:53:24,201 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-18 11:53:24,201 INFO ]: CoverageRelationStatistics Valid=89, Invalid=731, Unknown=4, NotChecked=168, Total=992 [2018-06-18 11:53:24,201 INFO ]: Start difference. First operand 43 states and 51 transitions. Second operand 32 states. [2018-06-18 11:53:25,143 WARN ]: Spent 360.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2018-06-18 11:53:25,833 WARN ]: Spent 372.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 30 [2018-06-18 11:53:26,644 WARN ]: Spent 397.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2018-06-18 11:53:27,644 WARN ]: Spent 521.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-06-18 11:53:28,553 WARN ]: Spent 479.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 87 [2018-06-18 11:53:29,717 WARN ]: Spent 626.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2018-06-18 11:53:30,318 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:30,318 INFO ]: Finished difference Result 47 states and 55 transitions. [2018-06-18 11:53:30,318 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-18 11:53:30,318 INFO ]: Start accepts. Automaton has 32 states. Word has length 41 [2018-06-18 11:53:30,319 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:30,319 INFO ]: With dead ends: 47 [2018-06-18 11:53:30,319 INFO ]: Without dead ends: 47 [2018-06-18 11:53:30,320 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=175, Invalid=1314, Unknown=5, NotChecked=228, Total=1722 [2018-06-18 11:53:30,320 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-18 11:53:30,325 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-18 11:53:30,325 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-18 11:53:30,326 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-06-18 11:53:30,326 INFO ]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 41 [2018-06-18 11:53:30,326 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:30,326 INFO ]: Abstraction has 45 states and 53 transitions. [2018-06-18 11:53:30,326 INFO ]: Interpolant automaton has 32 states. [2018-06-18 11:53:30,326 INFO ]: Start isEmpty. Operand 45 states and 53 transitions. [2018-06-18 11:53:30,327 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 11:53:30,327 INFO ]: Found error trace [2018-06-18 11:53:30,327 INFO ]: trace histogram [6, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:30,327 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:30,328 INFO ]: Analyzing trace with hash 160795385, now seen corresponding path program 8 times [2018-06-18 11:53:30,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:30,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:30,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:30,328 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-18 11:53:30,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:30,342 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:30,343 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:30,669 INFO ]: Checked inductivity of 76 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-18 11:53:30,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:30,669 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:30,685 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-18 11:53:30,730 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-18 11:53:30,730 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:30,734 INFO ]: Computing forward predicates... [2018-06-18 11:53:31,327 INFO ]: Checked inductivity of 76 backedges. 20 proven. 26 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-06-18 11:53:31,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:53:31,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 21 [2018-06-18 11:53:31,353 INFO ]: Interpolant automaton has 21 states [2018-06-18 11:53:31,353 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-18 11:53:31,353 INFO ]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-06-18 11:53:31,353 INFO ]: Start difference. First operand 45 states and 53 transitions. Second operand 21 states. [2018-06-18 11:53:32,201 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-18 11:53:33,478 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:33,478 INFO ]: Finished difference Result 47 states and 54 transitions. [2018-06-18 11:53:33,479 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-18 11:53:33,479 INFO ]: Start accepts. Automaton has 21 states. Word has length 45 [2018-06-18 11:53:33,479 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:33,480 INFO ]: With dead ends: 47 [2018-06-18 11:53:33,480 INFO ]: Without dead ends: 47 [2018-06-18 11:53:33,481 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2018-06-18 11:53:33,481 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-18 11:53:33,491 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-06-18 11:53:33,491 INFO ]: Start removeUnreachable. Operand 45 states. [2018-06-18 11:53:33,492 INFO ]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-06-18 11:53:33,492 INFO ]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 45 [2018-06-18 11:53:33,492 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:33,492 INFO ]: Abstraction has 45 states and 52 transitions. [2018-06-18 11:53:33,492 INFO ]: Interpolant automaton has 21 states. [2018-06-18 11:53:33,492 INFO ]: Start isEmpty. Operand 45 states and 52 transitions. [2018-06-18 11:53:33,493 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-18 11:53:33,493 INFO ]: Found error trace [2018-06-18 11:53:33,493 INFO ]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:33,493 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:33,493 INFO ]: Analyzing trace with hash 763445146, now seen corresponding path program 9 times [2018-06-18 11:53:33,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:33,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:33,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:33,494 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:53:33,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:33,509 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:33,509 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:33,845 INFO ]: Checked inductivity of 72 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-18 11:53:33,845 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:33,845 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:33,851 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-18 11:53:33,883 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-18 11:53:33,883 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:33,886 INFO ]: Computing forward predicates... [2018-06-18 11:53:34,895 INFO ]: Checked inductivity of 72 backedges. 20 proven. 23 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-18 11:53:34,917 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:53:34,917 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2018-06-18 11:53:34,918 INFO ]: Interpolant automaton has 20 states [2018-06-18 11:53:34,918 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-18 11:53:34,918 INFO ]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-06-18 11:53:34,918 INFO ]: Start difference. First operand 45 states and 52 transitions. Second operand 20 states. [2018-06-18 11:53:35,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:35,352 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-18 11:53:35,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-18 11:53:35,352 INFO ]: Start accepts. Automaton has 20 states. Word has length 45 [2018-06-18 11:53:35,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:35,353 INFO ]: With dead ends: 43 [2018-06-18 11:53:35,353 INFO ]: Without dead ends: 35 [2018-06-18 11:53:35,353 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2018-06-18 11:53:35,354 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-18 11:53:35,357 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-18 11:53:35,357 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-18 11:53:35,358 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-06-18 11:53:35,358 INFO ]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 45 [2018-06-18 11:53:35,358 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:35,358 INFO ]: Abstraction has 35 states and 40 transitions. [2018-06-18 11:53:35,358 INFO ]: Interpolant automaton has 20 states. [2018-06-18 11:53:35,358 INFO ]: Start isEmpty. Operand 35 states and 40 transitions. [2018-06-18 11:53:35,359 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-18 11:53:35,359 INFO ]: Found error trace [2018-06-18 11:53:35,359 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:35,359 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:35,359 INFO ]: Analyzing trace with hash 1668590854, now seen corresponding path program 5 times [2018-06-18 11:53:35,359 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:35,359 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:35,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:35,360 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:53:35,360 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:35,375 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:35,376 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:36,231 INFO ]: Checked inductivity of 91 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-18 11:53:36,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:36,231 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:36,239 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-18 11:53:36,277 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-18 11:53:36,277 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:36,279 INFO ]: Computing forward predicates... [2018-06-18 11:53:36,429 INFO ]: Checked inductivity of 91 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-06-18 11:53:36,450 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-18 11:53:36,450 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 9] total 24 [2018-06-18 11:53:36,451 INFO ]: Interpolant automaton has 24 states [2018-06-18 11:53:36,451 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-18 11:53:36,451 INFO ]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2018-06-18 11:53:36,451 INFO ]: Start difference. First operand 35 states and 40 transitions. Second operand 24 states. [2018-06-18 11:53:37,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-18 11:53:37,176 INFO ]: Finished difference Result 53 states and 62 transitions. [2018-06-18 11:53:37,177 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-18 11:53:37,177 INFO ]: Start accepts. Automaton has 24 states. Word has length 49 [2018-06-18 11:53:37,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-18 11:53:37,177 INFO ]: With dead ends: 53 [2018-06-18 11:53:37,177 INFO ]: Without dead ends: 53 [2018-06-18 11:53:37,178 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2018-06-18 11:53:37,178 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-18 11:53:37,192 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 49. [2018-06-18 11:53:37,192 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-18 11:53:37,193 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2018-06-18 11:53:37,198 INFO ]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 49 [2018-06-18 11:53:37,198 INFO ]: Finished accepts. word is rejected. [2018-06-18 11:53:37,198 INFO ]: Abstraction has 49 states and 57 transitions. [2018-06-18 11:53:37,198 INFO ]: Interpolant automaton has 24 states. [2018-06-18 11:53:37,198 INFO ]: Start isEmpty. Operand 49 states and 57 transitions. [2018-06-18 11:53:37,199 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-18 11:53:37,199 INFO ]: Found error trace [2018-06-18 11:53:37,199 INFO ]: trace histogram [6, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-18 11:53:37,199 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-18 11:53:37,200 INFO ]: Analyzing trace with hash 129246846, now seen corresponding path program 10 times [2018-06-18 11:53:37,200 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-18 11:53:37,200 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-18 11:53:37,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:37,200 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-18 11:53:37,200 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-18 11:53:37,262 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:37,262 WARN ]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-06-18 11:53:38,019 WARN ]: Spent 279.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-06-18 11:53:38,600 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2018-06-18 11:53:39,034 INFO ]: Checked inductivity of 91 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-06-18 11:53:39,034 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-18 11:53:39,034 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:39,052 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-18 11:53:39,088 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-18 11:53:39,088 INFO ]: Conjunction of SSA is unsat [2018-06-18 11:53:39,094 INFO ]: Computing forward predicates... [2018-06-18 11:53:39,439 WARN ]: unable to prove that (exists ((INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))) (and (<= .cse0 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (= c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int (let ((.cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int))) (let ((.cse1 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse2)))) (store .cse1 .cse2 (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))))) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse0)))) is different from true [2018-06-18 11:53:39,478 WARN ]: unable to prove that (exists ((v_subst_4 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (.cse4 (+ v_subst_4 1))) (and (<= .cse0 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (= (let ((.cse1 (let ((.cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4))) (let ((.cse2 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse3)))) (store .cse2 .cse3 (select .cse2 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 1))))))) (store .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse1 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse4) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse0) (<= .cse4 INV_MAIN_1_hbv_INV_MAIN_1_1_Int)))) is different from true [2018-06-18 11:53:39,510 WARN ]: unable to prove that (exists ((v_subst_5 Int) (v_subst_4 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse0 (+ v_subst_5 1)) (.cse2 (+ v_subst_4 1)) (.cse1 (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1))) (and (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (<= .cse1 c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int) (<= .cse2 v_subst_5) (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (<= v_subst_5 .cse2) (= (let ((.cse3 (let ((.cse4 (let ((.cse6 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4))) (let ((.cse5 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse6)))) (store .cse5 .cse6 (select .cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 1))))))) (store .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5) (select .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5 1)))))) (store .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int .cse1)))) is different from true [2018-06-18 11:53:39,541 WARN ]: unable to prove that (exists ((v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int) (INV_MAIN_1_hbv_INV_MAIN_1_1_Int Int)) (let ((.cse1 (+ v_subst_4 1)) (.cse0 (+ v_subst_6 1)) (.cse2 (+ v_subst_5 1))) (and (<= INV_MAIN_1_hbv_INV_MAIN_1_1_Int .cse0) (<= .cse1 v_subst_5) (<= v_subst_5 .cse1) (<= .cse0 INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (<= .cse2 v_subst_6) (< INV_MAIN_1_hbv_INV_MAIN_1_1_Int c_INV_MAIN_1_hhv_INV_MAIN_1_1_Int) (= (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse7 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4))) (let ((.cse6 (store c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 (- 1)) (select c_INV_MAIN_1_hhv_INV_MAIN_1_5_Array_Int_Int .cse7)))) (store .cse6 .cse7 (select .cse6 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_4 1))))))) (store .cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5) (select .cse5 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_5 1)))))) (store .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_6) (select .cse4 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int v_subst_6 1)))))) (store .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int) (select .cse3 (+ c_INV_MAIN_1_hhv_INV_MAIN_1_0_Int INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)))) c_INV_MAIN_1_hhv_INV_MAIN_1_3_Array_Int_Int) (<= c_INV_MAIN_1_hhv_INV_MAIN_1_2_Int (+ INV_MAIN_1_hbv_INV_MAIN_1_1_Int 1)) (<= v_subst_6 .cse2)))) is different from true [2018-06-18 11:53:40,536 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-06-18 11:53:40,993 INFO ]: detected not equals via solver [2018-06-18 11:53:40,997 INFO ]: detected not equals via solver [2018-06-18 11:53:40,999 INFO ]: detected not equals via solver [2018-06-18 11:53:41,000 INFO ]: detected not equals via solver [2018-06-18 11:53:41,000 INFO ]: detected not equals via solver [2018-06-18 11:53:41,002 INFO ]: detected not equals via solver [2018-06-18 11:53:41,005 INFO ]: detected not equals via solver [2018-06-18 11:53:41,006 INFO ]: detected not equals via solver [2018-06-18 11:53:41,006 INFO ]: detected not equals via solver [2018-06-18 11:53:41,008 INFO ]: detected not equals via solver [2018-06-18 11:53:41,077 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 965 treesize of output 790 [2018-06-18 11:53:42,108 WARN ]: Spent 1.02 s on a formula simplification. DAG size of input: 571 DAG size of output: 208 [2018-06-18 11:53:42,114 INFO ]: detected not equals via solver [2018-06-18 11:53:42,115 INFO ]: detected not equals via solver [2018-06-18 11:53:42,117 INFO ]: detected not equals via solver [2018-06-18 11:53:42,122 INFO ]: detected not equals via solver [2018-06-18 11:53:42,124 INFO ]: detected not equals via solver [2018-06-18 11:53:42,124 INFO ]: detected not equals via solver [2018-06-18 11:53:42,126 INFO ]: detected not equals via solver [2018-06-18 11:53:42,127 INFO ]: detected not equals via solver [2018-06-18 11:53:42,128 INFO ]: detected not equals via solver [2018-06-18 11:53:42,132 INFO ]: detected not equals via solver [2018-06-18 11:53:42,135 INFO ]: detected not equals via solver [2018-06-18 11:53:42,135 INFO ]: detected not equals via solver [2018-06-18 11:53:42,136 INFO ]: detected not equals via solver [2018-06-18 11:53:42,139 INFO ]: detected not equals via solver [2018-06-18 11:53:42,140 INFO ]: detected not equals via solver [2018-06-18 11:53:42,232 INFO ]: Index analysis took 122 ms [2018-06-18 11:53:42,325 INFO ]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 15 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 507 treesize of output 579 [2018-06-18 11:53:42,325 WARN ]: expecting exponential blowup for input size 8 Received shutdown request... [2018-06-18 11:53:51,006 WARN ]: Removed 61 from assertion stack [2018-06-18 11:53:51,006 INFO ]: Timeout while computing interpolants [2018-06-18 11:53:51,207 WARN ]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-18 11:53:51,207 WARN ]: Verification canceled [2018-06-18 11:53:51,212 WARN ]: Timeout [2018-06-18 11:53:51,212 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.06 11:53:51 BoogieIcfgContainer [2018-06-18 11:53:51,212 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-18 11:53:51,213 INFO ]: Toolchain (without parser) took 67030.91 ms. Allocated memory was 307.8 MB in the beginning and 701.5 MB in the end (delta: 393.7 MB). Free memory was 264.1 MB in the beginning and 613.9 MB in the end (delta: -349.8 MB). Peak memory consumption was 353.1 MB. Max. memory is 3.6 GB. [2018-06-18 11:53:51,214 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-18 11:53:51,214 INFO ]: ChcToBoogie took 52.83 ms. Allocated memory is still 307.8 MB. Free memory was 263.1 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:53:51,214 INFO ]: Boogie Preprocessor took 48.88 ms. Allocated memory is still 307.8 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 996.7 kB). Peak memory consumption was 996.7 kB. Max. memory is 3.6 GB. [2018-06-18 11:53:51,215 INFO ]: RCFGBuilder took 309.51 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 251.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-18 11:53:51,215 INFO ]: TraceAbstraction took 66610.13 ms. Allocated memory was 307.8 MB in the beginning and 701.5 MB in the end (delta: 393.7 MB). Free memory was 251.2 MB in the beginning and 613.9 MB in the end (delta: -362.7 MB). Peak memory consumption was 340.1 MB. Max. memory is 3.6 GB. [2018-06-18 11:53:51,222 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 52.83 ms. Allocated memory is still 307.8 MB. Free memory was 263.1 MB in the beginning and 261.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.88 ms. Allocated memory is still 307.8 MB. Free memory was 261.2 MB in the beginning and 260.2 MB in the end (delta: 996.7 kB). Peak memory consumption was 996.7 kB. Max. memory is 3.6 GB. * RCFGBuilder took 309.51 ms. Allocated memory is still 307.8 MB. Free memory was 260.2 MB in the beginning and 251.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 66610.13 ms. Allocated memory was 307.8 MB in the beginning and 701.5 MB in the end (delta: 393.7 MB). Free memory was 251.2 MB in the beginning and 613.9 MB in the end (delta: -362.7 MB). Peak memory consumption was 340.1 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 0). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 6, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 3010. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. TIMEOUT Result, 66.5s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 415 SDtfs, 238 SDslu, 2967 SDs, 0 SdLazy, 2511 SolverSat, 245 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 891 GetRequests, 477 SyntacticMatches, 14 SemanticMatches, 400 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1877 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=19, 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.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 40 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 33.7s InterpolantComputationTime, 1074 NumberOfCodeBlocks, 1070 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1040 ConstructedInterpolants, 27 QuantifiedInterpolants, 307912 SizeOfPredicates, 150 NumberOfNonLiveVariables, 2639 ConjunctsInSsa, 517 ConjunctsInUnsatCore, 34 InterpolantComputations, 5 PerfectInterpolantSequences, 756/1208 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/shiftByOne.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-18_11-53-51-235.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/shiftByOne.smt2_chcToBoogie_automizer.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-18_11-53-51-235.csv Completed graceful shutdown