java -Xss1g -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/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8d74a04 [2018-06-22 11:55:22,862 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-22 11:55:22,865 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-22 11:55:22,879 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-22 11:55:22,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-22 11:55:22,881 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-22 11:55:22,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-22 11:55:22,886 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-22 11:55:22,888 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-22 11:55:22,888 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-22 11:55:22,890 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-22 11:55:22,890 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-22 11:55:22,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-22 11:55:22,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-22 11:55:22,895 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-22 11:55:22,896 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-22 11:55:22,898 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-22 11:55:22,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-22 11:55:22,912 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-22 11:55:22,913 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-22 11:55:22,914 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-22 11:55:22,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-22 11:55:22,917 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-22 11:55:22,917 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-22 11:55:22,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-22 11:55:22,924 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-22 11:55:22,925 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-22 11:55:22,925 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-22 11:55:22,926 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-22 11:55:22,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-22 11:55:22,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-22 11:55:22,932 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-22 11:55:22,933 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-22 11:55:22,934 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-22 11:55:22,934 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-22 11:55:22,934 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_No_Goto.epf [2018-06-22 11:55:22,956 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-22 11:55:22,958 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-22 11:55:22,958 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-22 11:55:22,958 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-22 11:55:22,959 INFO L131 SettingsManager]: Preferences of ChcToBoogie differ from their defaults: [2018-06-22 11:55:22,959 INFO L133 SettingsManager]: * Use one large procedure with gotos to replace tail recursive calls=false [2018-06-22 11:55:22,960 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-22 11:55:22,960 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-22 11:55:22,960 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-22 11:55:22,960 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-22 11:55:22,961 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-22 11:55:22,961 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-22 11:55:22,961 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-22 11:55:22,961 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-22 11:55:22,961 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-22 11:55:22,962 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-22 11:55:22,962 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-22 11:55:22,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-22 11:55:22,963 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-22 11:55:22,964 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-22 11:55:22,964 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-22 11:55:23,013 INFO ]: Repository-Root is: /tmp [2018-06-22 11:55:23,028 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-22 11:55:23,032 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-22 11:55:23,033 INFO ]: Initializing SmtParser... [2018-06-22 11:55:23,033 INFO ]: SmtParser initialized [2018-06-22 11:55:23,034 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-22 11:55:23,036 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-22 11:55:23,125 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@260afc6a [2018-06-22 11:55:23,302 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-22 11:55:23,310 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-22 11:55:23,317 INFO ]: Walking toolchain with 4 elements. [2018-06-22 11:55:23,317 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-22 11:55:23,317 INFO ]: Initializing ChcToBoogie... [2018-06-22 11:55:23,317 INFO ]: ChcToBoogie initialized [2018-06-22 11:55:23,321 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,367 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23 Unit [2018-06-22 11:55:23,367 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-22 11:55:23,367 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-22 11:55:23,367 INFO ]: Initializing Boogie Preprocessor... [2018-06-22 11:55:23,368 INFO ]: Boogie Preprocessor initialized [2018-06-22 11:55:23,390 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,390 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,399 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,399 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,401 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,404 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,405 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (1/1) ... [2018-06-22 11:55:23,406 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-22 11:55:23,407 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-22 11:55:23,407 INFO ]: Initializing RCFGBuilder... [2018-06-22 11:55:23,407 INFO ]: RCFGBuilder initialized [2018-06-22 11:55:23,407 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (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-22 11:55:23,423 INFO ]: Specification and implementation of procedure False given in one single declaration [2018-06-22 11:55:23,423 INFO ]: Found specification of procedure False [2018-06-22 11:55:23,423 INFO ]: Found implementation of procedure False [2018-06-22 11:55:23,423 INFO ]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration [2018-06-22 11:55:23,423 INFO ]: Found specification of procedure INV_MAIN_42 [2018-06-22 11:55:23,424 INFO ]: Found implementation of procedure INV_MAIN_42 [2018-06-22 11:55:23,424 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-22 11:55:23,424 INFO ]: Found specification of procedure Ultimate.START [2018-06-22 11:55:23,424 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-22 11:55:23,663 INFO ]: Using library mode [2018-06-22 11:55:23,663 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:23 BoogieIcfgContainer [2018-06-22 11:55:23,663 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-22 11:55:23,664 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-22 11:55:23,664 INFO ]: Initializing TraceAbstraction... [2018-06-22 11:55:23,666 INFO ]: TraceAbstraction initialized [2018-06-22 11:55:23,667 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 22.06 11:55:23" (1/3) ... [2018-06-22 11:55:23,667 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682c295c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 22.06 11:55:23, skipping insertion in model container [2018-06-22 11:55:23,667 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 22.06 11:55:23" (2/3) ... [2018-06-22 11:55:23,668 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@682c295c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 11:55:23, skipping insertion in model container [2018-06-22 11:55:23,668 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 11:55:23" (3/3) ... [2018-06-22 11:55:23,670 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-22 11:55:23,679 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-22 11:55:23,686 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-22 11:55:23,739 INFO ]: Using default assertion order modulation [2018-06-22 11:55:23,740 INFO ]: Interprodecural is true [2018-06-22 11:55:23,740 INFO ]: Hoare is false [2018-06-22 11:55:23,740 INFO ]: Compute interpolants for FPandBP [2018-06-22 11:55:23,740 INFO ]: Backedges is TWOTRACK [2018-06-22 11:55:23,740 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-22 11:55:23,740 INFO ]: Difference is false [2018-06-22 11:55:23,740 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-22 11:55:23,740 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-22 11:55:23,765 INFO ]: Start isEmpty. Operand 15 states. [2018-06-22 11:55:23,780 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-22 11:55:23,780 INFO ]: Found error trace [2018-06-22 11:55:23,781 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:23,781 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:23,788 INFO ]: Analyzing trace with hash -997173371, now seen corresponding path program 1 times [2018-06-22 11:55:23,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:23,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:23,834 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:23,835 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:23,835 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:23,882 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:23,980 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-22 11:55:23,983 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:23,983 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:23,985 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:24,000 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:24,000 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:24,002 INFO ]: Start difference. First operand 15 states. Second operand 4 states. [2018-06-22 11:55:24,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:24,149 INFO ]: Finished difference Result 15 states and 22 transitions. [2018-06-22 11:55:24,150 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:24,151 INFO ]: Start accepts. Automaton has 4 states. Word has length 9 [2018-06-22 11:55:24,151 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:24,165 INFO ]: With dead ends: 15 [2018-06-22 11:55:24,165 INFO ]: Without dead ends: 15 [2018-06-22 11:55:24,167 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-22 11:55:24,181 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-22 11:55:24,203 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-22 11:55:24,204 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-22 11:55:24,205 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-06-22 11:55:24,206 INFO ]: Start accepts. Automaton has 15 states and 22 transitions. Word has length 9 [2018-06-22 11:55:24,207 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:24,207 INFO ]: Abstraction has 15 states and 22 transitions. [2018-06-22 11:55:24,207 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:24,207 INFO ]: Start isEmpty. Operand 15 states and 22 transitions. [2018-06-22 11:55:24,209 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:24,209 INFO ]: Found error trace [2018-06-22 11:55:24,209 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:24,209 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:24,209 INFO ]: Analyzing trace with hash 219620007, now seen corresponding path program 1 times [2018-06-22 11:55:24,209 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:24,209 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:24,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:24,210 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:24,210 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:24,248 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:24,467 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:55:24,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:24,467 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-22 11:55:24,485 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:24,515 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:24,523 INFO ]: Computing forward predicates... [2018-06-22 11:55:24,887 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:55:24,909 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:24,909 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-22 11:55:24,909 INFO ]: Interpolant automaton has 8 states [2018-06-22 11:55:24,909 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-22 11:55:24,910 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-22 11:55:24,910 INFO ]: Start difference. First operand 15 states and 22 transitions. Second operand 8 states. [2018-06-22 11:55:25,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:25,589 INFO ]: Finished difference Result 19 states and 31 transitions. [2018-06-22 11:55:25,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:55:25,589 INFO ]: Start accepts. Automaton has 8 states. Word has length 13 [2018-06-22 11:55:25,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:25,590 INFO ]: With dead ends: 19 [2018-06-22 11:55:25,590 INFO ]: Without dead ends: 19 [2018-06-22 11:55:25,591 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-22 11:55:25,591 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:55:25,598 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-06-22 11:55:25,598 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:55:25,599 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2018-06-22 11:55:25,599 INFO ]: Start accepts. Automaton has 17 states and 26 transitions. Word has length 13 [2018-06-22 11:55:25,599 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:25,599 INFO ]: Abstraction has 17 states and 26 transitions. [2018-06-22 11:55:25,599 INFO ]: Interpolant automaton has 8 states. [2018-06-22 11:55:25,599 INFO ]: Start isEmpty. Operand 17 states and 26 transitions. [2018-06-22 11:55:25,600 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:25,600 INFO ]: Found error trace [2018-06-22 11:55:25,601 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:25,601 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:25,601 INFO ]: Analyzing trace with hash 1103148723, now seen corresponding path program 1 times [2018-06-22 11:55:25,601 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:25,601 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:25,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,602 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:25,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,612 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:25,650 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:55:25,650 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:25,650 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:25,651 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:25,651 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:25,651 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:25,651 INFO ]: Start difference. First operand 17 states and 26 transitions. Second operand 4 states. [2018-06-22 11:55:25,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:25,748 INFO ]: Finished difference Result 21 states and 34 transitions. [2018-06-22 11:55:25,749 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:25,749 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:25,749 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:25,750 INFO ]: With dead ends: 21 [2018-06-22 11:55:25,750 INFO ]: Without dead ends: 21 [2018-06-22 11:55:25,750 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-22 11:55:25,750 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:55:25,760 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-06-22 11:55:25,760 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:55:25,761 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 29 transitions. [2018-06-22 11:55:25,761 INFO ]: Start accepts. Automaton has 19 states and 29 transitions. Word has length 13 [2018-06-22 11:55:25,761 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:25,761 INFO ]: Abstraction has 19 states and 29 transitions. [2018-06-22 11:55:25,761 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:25,761 INFO ]: Start isEmpty. Operand 19 states and 29 transitions. [2018-06-22 11:55:25,762 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-22 11:55:25,762 INFO ]: Found error trace [2018-06-22 11:55:25,762 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:25,762 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:25,763 INFO ]: Analyzing trace with hash 857897870, now seen corresponding path program 1 times [2018-06-22 11:55:25,763 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:25,763 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:25,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,764 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:25,764 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,773 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:25,825 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-22 11:55:25,826 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:25,826 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-22 11:55:25,826 INFO ]: Interpolant automaton has 4 states [2018-06-22 11:55:25,826 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-22 11:55:25,826 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-22 11:55:25,826 INFO ]: Start difference. First operand 19 states and 29 transitions. Second operand 4 states. [2018-06-22 11:55:25,903 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:25,903 INFO ]: Finished difference Result 21 states and 32 transitions. [2018-06-22 11:55:25,904 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-22 11:55:25,904 INFO ]: Start accepts. Automaton has 4 states. Word has length 13 [2018-06-22 11:55:25,904 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:25,905 INFO ]: With dead ends: 21 [2018-06-22 11:55:25,905 INFO ]: Without dead ends: 21 [2018-06-22 11:55:25,905 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-22 11:55:25,906 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:55:25,911 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:55:25,911 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:55:25,912 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2018-06-22 11:55:25,912 INFO ]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 13 [2018-06-22 11:55:25,912 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:25,912 INFO ]: Abstraction has 21 states and 32 transitions. [2018-06-22 11:55:25,912 INFO ]: Interpolant automaton has 4 states. [2018-06-22 11:55:25,912 INFO ]: Start isEmpty. Operand 21 states and 32 transitions. [2018-06-22 11:55:25,913 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:55:25,913 INFO ]: Found error trace [2018-06-22 11:55:25,913 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:25,913 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:25,914 INFO ]: Analyzing trace with hash 1815177045, now seen corresponding path program 1 times [2018-06-22 11:55:25,914 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:25,914 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:25,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:25,915 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:25,941 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:26,046 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:55:26,046 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:26,046 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:55:26,046 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:55:26,046 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:55:26,046 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:26,047 INFO ]: Start difference. First operand 21 states and 32 transitions. Second operand 5 states. [2018-06-22 11:55:26,439 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:26,439 INFO ]: Finished difference Result 19 states and 26 transitions. [2018-06-22 11:55:26,441 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:55:26,441 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:55:26,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:26,442 INFO ]: With dead ends: 19 [2018-06-22 11:55:26,442 INFO ]: Without dead ends: 18 [2018-06-22 11:55:26,442 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:55:26,442 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-22 11:55:26,445 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-06-22 11:55:26,445 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-22 11:55:26,447 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-22 11:55:26,447 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 17 [2018-06-22 11:55:26,447 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:26,447 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-22 11:55:26,447 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:55:26,447 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-22 11:55:26,448 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:55:26,448 INFO ]: Found error trace [2018-06-22 11:55:26,448 INFO ]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:26,448 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:26,448 INFO ]: Analyzing trace with hash -1015654583, now seen corresponding path program 2 times [2018-06-22 11:55:26,448 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:26,448 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:26,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:26,449 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:26,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:26,470 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:26,649 INFO ]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:55:26,649 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:26,649 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-22 11:55:26,657 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:55:26,694 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:55:26,694 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:26,698 INFO ]: Computing forward predicates... [2018-06-22 11:55:26,990 INFO ]: Checked inductivity of 10 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-22 11:55:27,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:27,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-06-22 11:55:27,021 INFO ]: Interpolant automaton has 13 states [2018-06-22 11:55:27,021 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-22 11:55:27,021 INFO ]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-22 11:55:27,021 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 13 states. [2018-06-22 11:55:27,550 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:27,550 INFO ]: Finished difference Result 20 states and 27 transitions. [2018-06-22 11:55:27,551 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-22 11:55:27,551 INFO ]: Start accepts. Automaton has 13 states. Word has length 17 [2018-06-22 11:55:27,551 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:27,552 INFO ]: With dead ends: 20 [2018-06-22 11:55:27,552 INFO ]: Without dead ends: 20 [2018-06-22 11:55:27,552 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-06-22 11:55:27,552 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-22 11:55:27,555 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-06-22 11:55:27,555 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-22 11:55:27,556 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2018-06-22 11:55:27,556 INFO ]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2018-06-22 11:55:27,556 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:27,556 INFO ]: Abstraction has 18 states and 23 transitions. [2018-06-22 11:55:27,556 INFO ]: Interpolant automaton has 13 states. [2018-06-22 11:55:27,556 INFO ]: Start isEmpty. Operand 18 states and 23 transitions. [2018-06-22 11:55:27,557 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-22 11:55:27,557 INFO ]: Found error trace [2018-06-22 11:55:27,557 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:27,557 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:27,557 INFO ]: Analyzing trace with hash -1242163792, now seen corresponding path program 1 times [2018-06-22 11:55:27,557 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:27,557 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:27,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:27,558 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:27,558 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:27,580 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:27,635 INFO ]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-22 11:55:27,635 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-22 11:55:27,635 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-22 11:55:27,635 INFO ]: Interpolant automaton has 5 states [2018-06-22 11:55:27,635 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-22 11:55:27,635 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-22 11:55:27,636 INFO ]: Start difference. First operand 18 states and 23 transitions. Second operand 5 states. [2018-06-22 11:55:27,770 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:27,770 INFO ]: Finished difference Result 18 states and 20 transitions. [2018-06-22 11:55:27,770 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-22 11:55:27,770 INFO ]: Start accepts. Automaton has 5 states. Word has length 17 [2018-06-22 11:55:27,770 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:27,771 INFO ]: With dead ends: 18 [2018-06-22 11:55:27,771 INFO ]: Without dead ends: 17 [2018-06-22 11:55:27,771 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-22 11:55:27,771 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-22 11:55:27,773 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-22 11:55:27,774 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-22 11:55:27,774 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-22 11:55:27,774 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 17 [2018-06-22 11:55:27,774 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:27,774 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-22 11:55:27,774 INFO ]: Interpolant automaton has 5 states. [2018-06-22 11:55:27,774 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-22 11:55:27,775 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-22 11:55:27,775 INFO ]: Found error trace [2018-06-22 11:55:27,775 INFO ]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:27,775 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:27,775 INFO ]: Analyzing trace with hash -808151701, now seen corresponding path program 3 times [2018-06-22 11:55:27,775 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:27,775 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:27,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:27,776 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:27,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:27,793 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:27,949 INFO ]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:55:27,949 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:27,949 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) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:27,961 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:55:28,004 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-22 11:55:28,004 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:28,009 INFO ]: Computing forward predicates... [2018-06-22 11:55:28,310 INFO ]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-22 11:55:28,330 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:28,330 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-06-22 11:55:28,330 INFO ]: Interpolant automaton has 17 states [2018-06-22 11:55:28,330 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-22 11:55:28,330 INFO ]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2018-06-22 11:55:28,330 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 17 states. [2018-06-22 11:55:28,508 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:28,508 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-22 11:55:28,508 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-22 11:55:28,508 INFO ]: Start accepts. Automaton has 17 states. Word has length 21 [2018-06-22 11:55:28,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:28,509 INFO ]: With dead ends: 19 [2018-06-22 11:55:28,509 INFO ]: Without dead ends: 19 [2018-06-22 11:55:28,509 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:55:28,509 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-22 11:55:28,512 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-22 11:55:28,512 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-22 11:55:28,512 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-22 11:55:28,512 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 21 [2018-06-22 11:55:28,512 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:28,512 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-22 11:55:28,512 INFO ]: Interpolant automaton has 17 states. [2018-06-22 11:55:28,512 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-22 11:55:28,513 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-22 11:55:28,513 INFO ]: Found error trace [2018-06-22 11:55:28,513 INFO ]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:28,513 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:28,513 INFO ]: Analyzing trace with hash -441418483, now seen corresponding path program 4 times [2018-06-22 11:55:28,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:28,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:28,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:28,514 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:28,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:28,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:29,087 INFO ]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-22 11:55:29,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:29,088 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-22 11:55:29,094 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:55:29,114 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:55:29,114 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:29,117 INFO ]: Computing forward predicates... [2018-06-22 11:55:29,574 INFO ]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-22 11:55:29,607 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:29,607 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-06-22 11:55:29,607 INFO ]: Interpolant automaton has 20 states [2018-06-22 11:55:29,607 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-22 11:55:29,607 INFO ]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2018-06-22 11:55:29,608 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 20 states. [2018-06-22 11:55:29,888 WARN ]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-06-22 11:55:30,173 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:30,173 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-22 11:55:30,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-22 11:55:30,173 INFO ]: Start accepts. Automaton has 20 states. Word has length 25 [2018-06-22 11:55:30,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:30,174 INFO ]: With dead ends: 21 [2018-06-22 11:55:30,174 INFO ]: Without dead ends: 21 [2018-06-22 11:55:30,174 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2018-06-22 11:55:30,174 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-22 11:55:30,177 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-22 11:55:30,177 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-22 11:55:30,177 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-22 11:55:30,177 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 25 [2018-06-22 11:55:30,177 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:30,177 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-22 11:55:30,177 INFO ]: Interpolant automaton has 20 states. [2018-06-22 11:55:30,178 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-22 11:55:30,178 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-22 11:55:30,178 INFO ]: Found error trace [2018-06-22 11:55:30,178 INFO ]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:30,178 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:30,179 INFO ]: Analyzing trace with hash -840913361, now seen corresponding path program 5 times [2018-06-22 11:55:30,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:30,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:30,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:30,179 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:30,179 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:30,198 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:30,609 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 11:55:30,927 INFO ]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-22 11:55:30,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:30,927 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-22 11:55:30,941 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:55:30,978 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-22 11:55:30,978 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:30,982 INFO ]: Computing forward predicates... [2018-06-22 11:55:31,429 INFO ]: Checked inductivity of 55 backedges. 7 proven. 30 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-06-22 11:55:31,460 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:31,460 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2018-06-22 11:55:31,461 INFO ]: Interpolant automaton has 23 states [2018-06-22 11:55:31,461 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-22 11:55:31,461 INFO ]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2018-06-22 11:55:31,461 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 23 states. [2018-06-22 11:55:31,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:31,899 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-22 11:55:31,901 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-22 11:55:31,901 INFO ]: Start accepts. Automaton has 23 states. Word has length 29 [2018-06-22 11:55:31,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:31,902 INFO ]: With dead ends: 23 [2018-06-22 11:55:31,902 INFO ]: Without dead ends: 23 [2018-06-22 11:55:31,902 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2018-06-22 11:55:31,902 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-22 11:55:31,905 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-22 11:55:31,905 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-22 11:55:31,905 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-22 11:55:31,905 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 29 [2018-06-22 11:55:31,906 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:31,906 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-22 11:55:31,906 INFO ]: Interpolant automaton has 23 states. [2018-06-22 11:55:31,906 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-22 11:55:31,907 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-22 11:55:31,907 INFO ]: Found error trace [2018-06-22 11:55:31,907 INFO ]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:31,907 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:31,907 INFO ]: Analyzing trace with hash 814991569, now seen corresponding path program 6 times [2018-06-22 11:55:31,907 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:31,907 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:31,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:31,908 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:31,908 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:31,927 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:32,512 INFO ]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-22 11:55:32,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:32,512 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) [2018-06-22 11:55:32,526 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:32,560 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-22 11:55:32,560 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:32,565 INFO ]: Computing forward predicates... [2018-06-22 11:55:33,044 INFO ]: Checked inductivity of 78 backedges. 9 proven. 42 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-06-22 11:55:33,073 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:33,073 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 26 [2018-06-22 11:55:33,074 INFO ]: Interpolant automaton has 26 states [2018-06-22 11:55:33,074 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-22 11:55:33,074 INFO ]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-06-22 11:55:33,075 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 26 states. [2018-06-22 11:55:33,434 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:33,434 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-22 11:55:33,434 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-22 11:55:33,434 INFO ]: Start accepts. Automaton has 26 states. Word has length 33 [2018-06-22 11:55:33,434 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:33,435 INFO ]: With dead ends: 25 [2018-06-22 11:55:33,435 INFO ]: Without dead ends: 25 [2018-06-22 11:55:33,435 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:55:33,436 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-22 11:55:33,439 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-22 11:55:33,439 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-22 11:55:33,440 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-22 11:55:33,440 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 33 [2018-06-22 11:55:33,440 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:33,440 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-22 11:55:33,440 INFO ]: Interpolant automaton has 26 states. [2018-06-22 11:55:33,440 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-22 11:55:33,441 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-22 11:55:33,441 INFO ]: Found error trace [2018-06-22 11:55:33,441 INFO ]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:33,441 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:33,441 INFO ]: Analyzing trace with hash -548377357, now seen corresponding path program 7 times [2018-06-22 11:55:33,441 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:33,441 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:33,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:33,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:33,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:33,467 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:34,081 INFO ]: Checked inductivity of 105 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-22 11:55:34,081 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:34,081 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-22 11:55:34,087 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:34,131 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:34,148 INFO ]: Computing forward predicates... [2018-06-22 11:55:34,625 WARN ]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-06-22 11:55:35,158 INFO ]: Checked inductivity of 105 backedges. 11 proven. 56 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-06-22 11:55:35,177 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:35,177 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-06-22 11:55:35,178 INFO ]: Interpolant automaton has 29 states [2018-06-22 11:55:35,178 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-22 11:55:35,178 INFO ]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2018-06-22 11:55:35,179 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 29 states. [2018-06-22 11:55:35,528 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:35,528 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-22 11:55:35,528 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-22 11:55:35,529 INFO ]: Start accepts. Automaton has 29 states. Word has length 37 [2018-06-22 11:55:35,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:35,529 INFO ]: With dead ends: 27 [2018-06-22 11:55:35,529 INFO ]: Without dead ends: 27 [2018-06-22 11:55:35,530 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2018-06-22 11:55:35,530 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-22 11:55:35,533 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-22 11:55:35,533 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-22 11:55:35,533 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-22 11:55:35,534 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 37 [2018-06-22 11:55:35,534 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:35,534 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-22 11:55:35,534 INFO ]: Interpolant automaton has 29 states. [2018-06-22 11:55:35,534 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-22 11:55:35,535 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-22 11:55:35,535 INFO ]: Found error trace [2018-06-22 11:55:35,535 INFO ]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:35,535 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:35,535 INFO ]: Analyzing trace with hash -1628095851, now seen corresponding path program 8 times [2018-06-22 11:55:35,535 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:35,535 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:35,535 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:35,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-22 11:55:35,536 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:35,561 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:36,036 WARN ]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-06-22 11:55:36,346 INFO ]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-22 11:55:36,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:36,346 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-22 11:55:36,353 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-22 11:55:36,393 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-22 11:55:36,394 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:36,402 INFO ]: Computing forward predicates... [2018-06-22 11:55:36,925 INFO ]: Checked inductivity of 136 backedges. 13 proven. 72 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-06-22 11:55:36,944 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:36,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 32 [2018-06-22 11:55:36,944 INFO ]: Interpolant automaton has 32 states [2018-06-22 11:55:36,944 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-22 11:55:36,945 INFO ]: CoverageRelationStatistics Valid=130, Invalid=862, Unknown=0, NotChecked=0, Total=992 [2018-06-22 11:55:36,945 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 32 states. [2018-06-22 11:55:37,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:37,505 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-22 11:55:37,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-22 11:55:37,517 INFO ]: Start accepts. Automaton has 32 states. Word has length 41 [2018-06-22 11:55:37,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:37,517 INFO ]: With dead ends: 29 [2018-06-22 11:55:37,517 INFO ]: Without dead ends: 29 [2018-06-22 11:55:37,518 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:55:37,518 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-22 11:55:37,522 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-22 11:55:37,522 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-22 11:55:37,522 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-22 11:55:37,522 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 41 [2018-06-22 11:55:37,523 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:37,523 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-22 11:55:37,523 INFO ]: Interpolant automaton has 32 states. [2018-06-22 11:55:37,523 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-22 11:55:37,523 INFO ]: Finished isEmpty. Found accepting run of length 46 [2018-06-22 11:55:37,523 INFO ]: Found error trace [2018-06-22 11:55:37,523 INFO ]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:37,523 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:37,524 INFO ]: Analyzing trace with hash 1907937719, now seen corresponding path program 9 times [2018-06-22 11:55:37,524 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:37,524 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:37,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:37,524 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:37,524 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:37,551 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:38,110 INFO ]: Checked inductivity of 171 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-22 11:55:38,110 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:38,110 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-22 11:55:38,115 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-22 11:55:38,160 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-22 11:55:38,160 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:38,167 INFO ]: Computing forward predicates... [2018-06-22 11:55:39,523 INFO ]: Checked inductivity of 171 backedges. 15 proven. 90 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:55:39,542 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:39,542 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16] total 35 [2018-06-22 11:55:39,542 INFO ]: Interpolant automaton has 35 states [2018-06-22 11:55:39,543 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-22 11:55:39,543 INFO ]: CoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2018-06-22 11:55:39,543 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 35 states. [2018-06-22 11:55:40,096 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:40,096 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-22 11:55:40,096 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-22 11:55:40,096 INFO ]: Start accepts. Automaton has 35 states. Word has length 45 [2018-06-22 11:55:40,097 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:40,097 INFO ]: With dead ends: 31 [2018-06-22 11:55:40,097 INFO ]: Without dead ends: 31 [2018-06-22 11:55:40,098 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=329, Invalid=1563, Unknown=0, NotChecked=0, Total=1892 [2018-06-22 11:55:40,098 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-22 11:55:40,101 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-22 11:55:40,101 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-22 11:55:40,101 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-22 11:55:40,101 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 45 [2018-06-22 11:55:40,101 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:40,101 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-22 11:55:40,101 INFO ]: Interpolant automaton has 35 states. [2018-06-22 11:55:40,102 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-22 11:55:40,102 INFO ]: Finished isEmpty. Found accepting run of length 50 [2018-06-22 11:55:40,102 INFO ]: Found error trace [2018-06-22 11:55:40,102 INFO ]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:40,102 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:40,102 INFO ]: Analyzing trace with hash 1630130777, now seen corresponding path program 10 times [2018-06-22 11:55:40,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:40,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:40,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:40,103 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:40,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:40,129 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:40,604 WARN ]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-06-22 11:55:40,866 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-06-22 11:55:41,705 INFO ]: Checked inductivity of 210 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-22 11:55:41,705 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:41,705 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-22 11:55:41,711 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-22 11:55:41,764 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-22 11:55:41,764 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:41,771 INFO ]: Computing forward predicates... [2018-06-22 11:55:42,440 INFO ]: Checked inductivity of 210 backedges. 17 proven. 110 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-06-22 11:55:42,461 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:42,461 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 17] total 38 [2018-06-22 11:55:42,462 INFO ]: Interpolant automaton has 38 states [2018-06-22 11:55:42,462 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-22 11:55:42,462 INFO ]: CoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2018-06-22 11:55:42,463 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 38 states. [2018-06-22 11:55:43,192 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:43,192 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-22 11:55:43,193 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-22 11:55:43,193 INFO ]: Start accepts. Automaton has 38 states. Word has length 49 [2018-06-22 11:55:43,193 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:43,194 INFO ]: With dead ends: 33 [2018-06-22 11:55:43,194 INFO ]: Without dead ends: 33 [2018-06-22 11:55:43,195 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=382, Invalid=1874, Unknown=0, NotChecked=0, Total=2256 [2018-06-22 11:55:43,195 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-22 11:55:43,200 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-22 11:55:43,201 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-22 11:55:43,201 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-22 11:55:43,201 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 49 [2018-06-22 11:55:43,201 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:43,201 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-22 11:55:43,201 INFO ]: Interpolant automaton has 38 states. [2018-06-22 11:55:43,201 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-22 11:55:43,202 INFO ]: Finished isEmpty. Found accepting run of length 54 [2018-06-22 11:55:43,202 INFO ]: Found error trace [2018-06-22 11:55:43,202 INFO ]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:43,202 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:43,202 INFO ]: Analyzing trace with hash -936452997, now seen corresponding path program 11 times [2018-06-22 11:55:43,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:43,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:43,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:43,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:43,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:43,239 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:43,927 INFO ]: Checked inductivity of 253 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-22 11:55:43,927 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-22 11:55:43,927 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-22 11:55:43,933 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-22 11:55:44,042 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-22 11:55:44,042 INFO ]: Conjunction of SSA is unsat [2018-06-22 11:55:44,050 INFO ]: Computing forward predicates... [2018-06-22 11:55:44,976 INFO ]: Checked inductivity of 253 backedges. 10 proven. 132 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-06-22 11:55:44,998 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-22 11:55:44,998 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17] total 40 [2018-06-22 11:55:44,999 INFO ]: Interpolant automaton has 40 states [2018-06-22 11:55:44,999 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-22 11:55:44,999 INFO ]: CoverageRelationStatistics Valid=182, Invalid=1378, Unknown=0, NotChecked=0, Total=1560 [2018-06-22 11:55:44,999 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 40 states. [2018-06-22 11:55:45,968 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-22 11:55:45,968 INFO ]: Finished difference Result 35 states and 36 transitions. [2018-06-22 11:55:45,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-22 11:55:45,969 INFO ]: Start accepts. Automaton has 40 states. Word has length 53 [2018-06-22 11:55:45,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-22 11:55:45,969 INFO ]: With dead ends: 35 [2018-06-22 11:55:45,969 INFO ]: Without dead ends: 35 [2018-06-22 11:55:45,970 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=424, Invalid=2126, Unknown=0, NotChecked=0, Total=2550 [2018-06-22 11:55:45,970 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-22 11:55:45,975 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-22 11:55:45,975 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-22 11:55:45,976 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-22 11:55:45,976 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 53 [2018-06-22 11:55:45,976 INFO ]: Finished accepts. word is rejected. [2018-06-22 11:55:45,976 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-22 11:55:45,976 INFO ]: Interpolant automaton has 40 states. [2018-06-22 11:55:45,976 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-22 11:55:45,977 INFO ]: Finished isEmpty. Found accepting run of length 58 [2018-06-22 11:55:45,977 INFO ]: Found error trace [2018-06-22 11:55:45,977 INFO ]: trace histogram [13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-22 11:55:45,977 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-22 11:55:45,977 INFO ]: Analyzing trace with hash 486969373, now seen corresponding path program 12 times [2018-06-22 11:55:45,977 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-22 11:55:45,977 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-22 11:55:45,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:45,978 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-22 11:55:45,978 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-22 11:55:46,013 INFO ]: Conjunction of SSA is sat [2018-06-22 11:55:46,018 INFO ]: Counterexample might be feasible [2018-06-22 11:55:46,045 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 11:55:46 BoogieIcfgContainer [2018-06-22 11:55:46,045 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-22 11:55:46,049 INFO ]: Toolchain (without parser) took 22737.81 ms. Allocated memory was 307.2 MB in the beginning and 510.1 MB in the end (delta: 202.9 MB). Free memory was 263.6 MB in the beginning and 456.7 MB in the end (delta: -193.0 MB). Peak memory consumption was 9.9 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:46,049 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:55:46,050 INFO ]: ChcToBoogie took 49.90 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:46,050 INFO ]: Boogie Preprocessor took 38.70 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:46,050 INFO ]: RCFGBuilder took 256.64 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 252.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-22 11:55:46,051 INFO ]: TraceAbstraction took 22380.58 ms. Allocated memory was 307.2 MB in the beginning and 510.1 MB in the end (delta: 202.9 MB). Free memory was 251.7 MB in the beginning and 456.7 MB in the end (delta: -205.0 MB). There was no memory consumed. Max. memory is 3.6 GB. [2018-06-22 11:55:46,053 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 307.2 MB. Free memory is still 272.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.90 ms. Allocated memory is still 307.2 MB. Free memory was 263.6 MB in the beginning and 261.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 38.70 ms. Allocated memory is still 307.2 MB. Free memory was 261.6 MB in the beginning and 259.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 256.64 ms. Allocated memory is still 307.2 MB. Free memory was 259.6 MB in the beginning and 252.6 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 22380.58 ms. Allocated memory was 307.2 MB in the beginning and 510.1 MB in the end (delta: 202.9 MB). Free memory was 251.7 MB in the beginning and 456.7 MB in the end (delta: -205.0 MB). There was no memory consumed. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call False(); [L0] assume (!(hbv_False_1_Int == hbv_False_2_Int) && !(hbv_False_5_Int < hbv_False_6_Int)) && !(hbv_False_3_Int < hbv_False_4_Int); [L0] CALL call INV_MAIN_42(hbv_False_7_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_8_Int, hbv_False_4_Int, hbv_False_2_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume (((((hhv_INV_MAIN_42_5_Int == (if hbv_INV_MAIN_42_2_Int == 10 then 10 else hbv_INV_MAIN_42_4_Int + 5) && hbv_INV_MAIN_42_2_Int < hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_7_Int == hbv_INV_MAIN_42_5_Int + hbv_INV_MAIN_42_4_Int) && hhv_INV_MAIN_42_1_Int == hbv_INV_MAIN_42_1_Int + 1) && hhv_INV_MAIN_42_3_Int == hbv_INV_MAIN_42_3_Int + (5 * hbv_INV_MAIN_42_1_Int + hhv_INV_MAIN_42_0_Int)) && hbv_INV_MAIN_42_1_Int < hhv_INV_MAIN_42_2_Int) && hhv_INV_MAIN_42_4_Int == hbv_INV_MAIN_42_2_Int + 1; [L0] CALL call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] assume ((((hhv_INV_MAIN_42_0_Int == hhv_INV_MAIN_42_5_Int && hhv_INV_MAIN_42_3_Int == 0) && hhv_INV_MAIN_42_4_Int == 0) && hhv_INV_MAIN_42_2_Int == hhv_INV_MAIN_42_6_Int) && hhv_INV_MAIN_42_1_Int == 0) && hhv_INV_MAIN_42_7_Int == 0; [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hhv_INV_MAIN_42_0_Int, hbv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_Int, hbv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_6_Int, hbv_INV_MAIN_42_5_Int); [L0] RET call INV_MAIN_42(hbv_False_7_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_1_Int, hbv_False_3_Int, hbv_False_8_Int, hbv_False_4_Int, hbv_False_2_Int); [L0] RET call False(); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 15 locations, 1 error locations. UNSAFE Result, 22.3s OverallTime, 17 OverallIterations, 13 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 261 SDtfs, 418 SDslu, 1811 SDs, 0 SdLazy, 1807 SolverSat, 434 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 620 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 339 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 15.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 852 NumberOfCodeBlocks, 852 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 768 ConstructedInterpolants, 20 QuantifiedInterpolants, 503208 SizeOfPredicates, 351 NumberOfNonLiveVariables, 2585 ConjunctsInSsa, 1419 ConjunctsInUnsatCore, 27 InterpolantComputations, 5 PerfectInterpolantSequences, 816/2180 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-22_11-55-46-071.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_No_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-22_11-55-46-071.csv Received shutdown request...