java -Xss4m -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_Goto.epf -i '/storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:50:20,999 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:50:21,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:50:21,012 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:50:21,012 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:50:21,013 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:50:21,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:50:21,016 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:50:21,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:50:21,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:50:21,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:50:21,020 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:50:21,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:50:21,022 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:50:21,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:50:21,023 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:50:21,025 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:50:21,027 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:50:21,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:50:21,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:50:21,031 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:50:21,034 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:50:21,034 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:50:21,034 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:50:21,035 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:50:21,036 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:50:21,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:50:21,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:50:21,039 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:50:21,039 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:50:21,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:50:21,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:50:21,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:50:21,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:50:21,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:50:21,044 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-25 09:50:21,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:50:21,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:50:21,068 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:50:21,068 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:50:21,069 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:50:21,069 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:50:21,069 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:50:21,069 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:50:21,070 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:50:21,070 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:50:21,070 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:50:21,070 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:50:21,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:50:21,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:50:21,074 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:50:21,074 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:50:21,074 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:50:21,075 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:50:21,075 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:50:21,075 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:50:21,075 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:50:21,077 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:50:21,077 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:50:21,125 INFO ]: Repository-Root is: /tmp [2018-06-25 09:50:21,142 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:50:21,145 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:50:21,146 INFO ]: Initializing SmtParser... [2018-06-25 09:50:21,146 INFO ]: SmtParser initialized [2018-06-25 09:50:21,147 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-25 09:50:21,147 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-25 09:50:21,232 INFO ]: Executing SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 unknown de.uni_freiburg.informatik.ultimate.plugins.generator.treeautomizer.parsing.HornClauseParserScript$1@3c6ab0c4 [2018-06-25 09:50:21,482 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__limit2!.smt2 [2018-06-25 09:50:21,487 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:50:21,497 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:50:21,497 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:50:21,497 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:50:21,497 INFO ]: ChcToBoogie initialized [2018-06-25 09:50:21,502 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,562 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21 Unit [2018-06-25 09:50:21,562 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:50:21,563 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:50:21,563 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:50:21,563 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:50:21,583 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,584 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,589 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,591 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,596 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,602 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,604 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (1/1) ... [2018-06-25 09:50:21,606 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:50:21,606 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:50:21,606 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:50:21,606 INFO ]: RCFGBuilder initialized [2018-06-25 09:50:21,607 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (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-25 09:50:21,619 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:50:21,619 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:50:21,619 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:50:21,619 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:50:21,619 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:50:21,619 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-25 09:50:22,041 INFO ]: Using library mode [2018-06-25 09:50:22,042 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:22 BoogieIcfgContainer [2018-06-25 09:50:22,042 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:50:22,043 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:50:22,043 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:50:22,046 INFO ]: TraceAbstraction initialized [2018-06-25 09:50:22,046 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:21" (1/3) ... [2018-06-25 09:50:22,047 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451756a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:50:22, skipping insertion in model container [2018-06-25 09:50:22,047 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:21" (2/3) ... [2018-06-25 09:50:22,047 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@451756a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:50:22, skipping insertion in model container [2018-06-25 09:50:22,047 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:22" (3/3) ... [2018-06-25 09:50:22,049 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:50:22,058 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:50:22,066 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:50:22,112 INFO ]: Using default assertion order modulation [2018-06-25 09:50:22,113 INFO ]: Interprodecural is true [2018-06-25 09:50:22,113 INFO ]: Hoare is false [2018-06-25 09:50:22,113 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:50:22,113 INFO ]: Backedges is TWOTRACK [2018-06-25 09:50:22,113 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:50:22,113 INFO ]: Difference is false [2018-06-25 09:50:22,113 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:50:22,113 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:50:22,128 INFO ]: Start isEmpty. Operand 28 states. [2018-06-25 09:50:22,141 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:50:22,141 INFO ]: Found error trace [2018-06-25 09:50:22,142 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:22,142 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:22,147 INFO ]: Analyzing trace with hash -440665889, now seen corresponding path program 1 times [2018-06-25 09:50:22,149 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:22,149 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:22,189 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:22,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:22,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:22,219 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:22,278 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:22,280 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:22,280 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:22,281 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:22,291 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:22,292 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:22,294 INFO ]: Start difference. First operand 28 states. Second operand 4 states. [2018-06-25 09:50:22,899 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:22,899 INFO ]: Finished difference Result 49 states and 83 transitions. [2018-06-25 09:50:22,899 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:22,900 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-25 09:50:22,901 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:22,912 INFO ]: With dead ends: 49 [2018-06-25 09:50:22,912 INFO ]: Without dead ends: 49 [2018-06-25 09:50:22,914 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:22,930 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-25 09:50:22,963 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-25 09:50:22,964 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-25 09:50:22,968 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 83 transitions. [2018-06-25 09:50:22,969 INFO ]: Start accepts. Automaton has 49 states and 83 transitions. Word has length 7 [2018-06-25 09:50:22,969 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:22,969 INFO ]: Abstraction has 49 states and 83 transitions. [2018-06-25 09:50:22,969 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:22,969 INFO ]: Start isEmpty. Operand 49 states and 83 transitions. [2018-06-25 09:50:22,970 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:50:22,971 INFO ]: Found error trace [2018-06-25 09:50:22,971 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:22,971 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:22,971 INFO ]: Analyzing trace with hash -791723498, now seen corresponding path program 1 times [2018-06-25 09:50:22,971 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:22,971 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:22,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:22,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:22,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:22,976 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:23,114 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:23,115 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:23,115 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:23,116 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:23,116 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:23,116 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:23,116 INFO ]: Start difference. First operand 49 states and 83 transitions. Second operand 4 states. [2018-06-25 09:50:23,587 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:23,587 INFO ]: Finished difference Result 72 states and 123 transitions. [2018-06-25 09:50:23,587 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:23,587 INFO ]: Start accepts. Automaton has 4 states. Word has length 8 [2018-06-25 09:50:23,587 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:23,590 INFO ]: With dead ends: 72 [2018-06-25 09:50:23,590 INFO ]: Without dead ends: 72 [2018-06-25 09:50:23,591 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:23,592 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-25 09:50:23,602 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-06-25 09:50:23,602 INFO ]: Start removeUnreachable. Operand 72 states. [2018-06-25 09:50:23,605 INFO ]: Finished removeUnreachable. Reduced from 72 states to 72 states and 123 transitions. [2018-06-25 09:50:23,605 INFO ]: Start accepts. Automaton has 72 states and 123 transitions. Word has length 8 [2018-06-25 09:50:23,605 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:23,605 INFO ]: Abstraction has 72 states and 123 transitions. [2018-06-25 09:50:23,605 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:23,605 INFO ]: Start isEmpty. Operand 72 states and 123 transitions. [2018-06-25 09:50:23,606 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:23,606 INFO ]: Found error trace [2018-06-25 09:50:23,606 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:23,607 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:23,607 INFO ]: Analyzing trace with hash 1747383725, now seen corresponding path program 1 times [2018-06-25 09:50:23,607 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:23,607 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:23,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:23,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:23,608 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:23,616 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:23,651 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:23,651 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:23,652 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-25 09:50:23,652 INFO ]: Interpolant automaton has 4 states [2018-06-25 09:50:23,652 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-25 09:50:23,652 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-25 09:50:23,652 INFO ]: Start difference. First operand 72 states and 123 transitions. Second operand 4 states. [2018-06-25 09:50:23,927 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:23,927 INFO ]: Finished difference Result 91 states and 156 transitions. [2018-06-25 09:50:23,927 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:23,927 INFO ]: Start accepts. Automaton has 4 states. Word has length 11 [2018-06-25 09:50:23,928 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:23,930 INFO ]: With dead ends: 91 [2018-06-25 09:50:23,930 INFO ]: Without dead ends: 91 [2018-06-25 09:50:23,931 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:23,931 INFO ]: Start minimizeSevpa. Operand 91 states. [2018-06-25 09:50:23,943 INFO ]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-06-25 09:50:23,944 INFO ]: Start removeUnreachable. Operand 91 states. [2018-06-25 09:50:23,946 INFO ]: Finished removeUnreachable. Reduced from 91 states to 91 states and 156 transitions. [2018-06-25 09:50:23,946 INFO ]: Start accepts. Automaton has 91 states and 156 transitions. Word has length 11 [2018-06-25 09:50:23,946 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:23,946 INFO ]: Abstraction has 91 states and 156 transitions. [2018-06-25 09:50:23,946 INFO ]: Interpolant automaton has 4 states. [2018-06-25 09:50:23,946 INFO ]: Start isEmpty. Operand 91 states and 156 transitions. [2018-06-25 09:50:23,947 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:23,947 INFO ]: Found error trace [2018-06-25 09:50:23,947 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:23,948 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:23,948 INFO ]: Analyzing trace with hash -1120743626, now seen corresponding path program 1 times [2018-06-25 09:50:23,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:23,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:23,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:23,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:23,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:23,963 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:24,002 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:24,002 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:24,002 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:24,002 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:24,003 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:24,003 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:24,003 INFO ]: Start difference. First operand 91 states and 156 transitions. Second operand 3 states. [2018-06-25 09:50:24,026 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:24,026 INFO ]: Finished difference Result 95 states and 160 transitions. [2018-06-25 09:50:24,027 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:24,027 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 09:50:24,027 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:24,029 INFO ]: With dead ends: 95 [2018-06-25 09:50:24,029 INFO ]: Without dead ends: 95 [2018-06-25 09:50:24,029 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:24,030 INFO ]: Start minimizeSevpa. Operand 95 states. [2018-06-25 09:50:24,040 INFO ]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-06-25 09:50:24,040 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-25 09:50:24,042 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 160 transitions. [2018-06-25 09:50:24,043 INFO ]: Start accepts. Automaton has 95 states and 160 transitions. Word has length 11 [2018-06-25 09:50:24,044 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:24,044 INFO ]: Abstraction has 95 states and 160 transitions. [2018-06-25 09:50:24,044 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:24,044 INFO ]: Start isEmpty. Operand 95 states and 160 transitions. [2018-06-25 09:50:24,045 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:24,045 INFO ]: Found error trace [2018-06-25 09:50:24,045 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:24,045 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:24,045 INFO ]: Analyzing trace with hash -965413352, now seen corresponding path program 1 times [2018-06-25 09:50:24,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:24,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:24,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,046 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:24,046 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,055 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:24,170 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:24,170 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:24,170 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:24,170 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:24,170 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:24,170 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:24,171 INFO ]: Start difference. First operand 95 states and 160 transitions. Second operand 3 states. [2018-06-25 09:50:24,280 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:24,280 INFO ]: Finished difference Result 99 states and 164 transitions. [2018-06-25 09:50:24,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:24,283 INFO ]: Start accepts. Automaton has 3 states. Word has length 11 [2018-06-25 09:50:24,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:24,285 INFO ]: With dead ends: 99 [2018-06-25 09:50:24,285 INFO ]: Without dead ends: 99 [2018-06-25 09:50:24,286 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:24,286 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-25 09:50:24,303 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-06-25 09:50:24,303 INFO ]: Start removeUnreachable. Operand 99 states. [2018-06-25 09:50:24,307 INFO ]: Finished removeUnreachable. Reduced from 99 states to 99 states and 164 transitions. [2018-06-25 09:50:24,307 INFO ]: Start accepts. Automaton has 99 states and 164 transitions. Word has length 11 [2018-06-25 09:50:24,307 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:24,307 INFO ]: Abstraction has 99 states and 164 transitions. [2018-06-25 09:50:24,307 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:24,307 INFO ]: Start isEmpty. Operand 99 states and 164 transitions. [2018-06-25 09:50:24,308 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:24,308 INFO ]: Found error trace [2018-06-25 09:50:24,308 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:24,308 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:24,308 INFO ]: Analyzing trace with hash -383597008, now seen corresponding path program 1 times [2018-06-25 09:50:24,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:24,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:24,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,311 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:24,311 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,335 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:24,414 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:24,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:24,414 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-25 09:50:24,420 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:24,436 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:24,441 INFO ]: Computing forward predicates... [2018-06-25 09:50:24,514 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:24,536 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:50:24,536 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-25 09:50:24,536 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:24,536 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:24,536 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:24,536 INFO ]: Start difference. First operand 99 states and 164 transitions. Second operand 5 states. [2018-06-25 09:50:24,642 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:24,642 INFO ]: Finished difference Result 138 states and 247 transitions. [2018-06-25 09:50:24,643 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:24,643 INFO ]: Start accepts. Automaton has 5 states. Word has length 12 [2018-06-25 09:50:24,643 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:24,646 INFO ]: With dead ends: 138 [2018-06-25 09:50:24,646 INFO ]: Without dead ends: 115 [2018-06-25 09:50:24,647 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 12 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-25 09:50:24,647 INFO ]: Start minimizeSevpa. Operand 115 states. [2018-06-25 09:50:24,660 INFO ]: Finished minimizeSevpa. Reduced states from 115 to 87. [2018-06-25 09:50:24,660 INFO ]: Start removeUnreachable. Operand 87 states. [2018-06-25 09:50:24,662 INFO ]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2018-06-25 09:50:24,662 INFO ]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 12 [2018-06-25 09:50:24,662 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:24,662 INFO ]: Abstraction has 87 states and 139 transitions. [2018-06-25 09:50:24,662 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:24,662 INFO ]: Start isEmpty. Operand 87 states and 139 transitions. [2018-06-25 09:50:24,665 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:50:24,665 INFO ]: Found error trace [2018-06-25 09:50:24,665 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:24,665 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:24,665 INFO ]: Analyzing trace with hash 1787466705, now seen corresponding path program 1 times [2018-06-25 09:50:24,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:24,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:24,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:24,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,675 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:24,723 INFO ]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-25 09:50:24,723 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:24,723 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:24,723 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:24,723 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:24,723 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:24,723 INFO ]: Start difference. First operand 87 states and 139 transitions. Second operand 3 states. [2018-06-25 09:50:24,748 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:24,748 INFO ]: Finished difference Result 100 states and 167 transitions. [2018-06-25 09:50:24,750 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:24,750 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-25 09:50:24,751 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:24,752 INFO ]: With dead ends: 100 [2018-06-25 09:50:24,752 INFO ]: Without dead ends: 96 [2018-06-25 09:50:24,753 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:24,753 INFO ]: Start minimizeSevpa. Operand 96 states. [2018-06-25 09:50:24,766 INFO ]: Finished minimizeSevpa. Reduced states from 96 to 83. [2018-06-25 09:50:24,766 INFO ]: Start removeUnreachable. Operand 83 states. [2018-06-25 09:50:24,768 INFO ]: Finished removeUnreachable. Reduced from 83 states to 83 states and 131 transitions. [2018-06-25 09:50:24,768 INFO ]: Start accepts. Automaton has 83 states and 131 transitions. Word has length 19 [2018-06-25 09:50:24,768 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:24,768 INFO ]: Abstraction has 83 states and 131 transitions. [2018-06-25 09:50:24,768 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:24,768 INFO ]: Start isEmpty. Operand 83 states and 131 transitions. [2018-06-25 09:50:24,769 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-25 09:50:24,769 INFO ]: Found error trace [2018-06-25 09:50:24,769 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:24,769 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:24,769 INFO ]: Analyzing trace with hash -66068675, now seen corresponding path program 1 times [2018-06-25 09:50:24,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:24,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:24,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:24,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:24,788 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:25,046 WARN ]: Spent 196.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-06-25 09:50:25,282 INFO ]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-25 09:50:25,282 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:25,282 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-25 09:50:25,282 INFO ]: Interpolant automaton has 6 states [2018-06-25 09:50:25,283 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-25 09:50:25,283 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-25 09:50:25,283 INFO ]: Start difference. First operand 83 states and 131 transitions. Second operand 6 states. [2018-06-25 09:50:25,487 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:25,487 INFO ]: Finished difference Result 131 states and 232 transitions. [2018-06-25 09:50:25,488 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:25,488 INFO ]: Start accepts. Automaton has 6 states. Word has length 20 [2018-06-25 09:50:25,488 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:25,492 INFO ]: With dead ends: 131 [2018-06-25 09:50:25,492 INFO ]: Without dead ends: 131 [2018-06-25 09:50:25,492 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:25,492 INFO ]: Start minimizeSevpa. Operand 131 states. [2018-06-25 09:50:25,505 INFO ]: Finished minimizeSevpa. Reduced states from 131 to 95. [2018-06-25 09:50:25,505 INFO ]: Start removeUnreachable. Operand 95 states. [2018-06-25 09:50:25,507 INFO ]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2018-06-25 09:50:25,507 INFO ]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 20 [2018-06-25 09:50:25,507 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:25,507 INFO ]: Abstraction has 95 states and 147 transitions. [2018-06-25 09:50:25,507 INFO ]: Interpolant automaton has 6 states. [2018-06-25 09:50:25,507 INFO ]: Start isEmpty. Operand 95 states and 147 transitions. [2018-06-25 09:50:25,509 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-25 09:50:25,509 INFO ]: Found error trace [2018-06-25 09:50:25,509 INFO ]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:25,509 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:25,509 INFO ]: Analyzing trace with hash 487622646, now seen corresponding path program 1 times [2018-06-25 09:50:25,509 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:25,509 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:25,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:25,510 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:25,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:25,534 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:25,606 INFO ]: Checked inductivity of 15 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-25 09:50:25,606 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:25,606 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-25 09:50:25,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:25,646 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:25,649 INFO ]: Computing forward predicates... [2018-06-25 09:50:25,789 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-25 09:50:25,810 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-25 09:50:25,810 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2018-06-25 09:50:25,810 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:50:25,810 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:50:25,810 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:25,810 INFO ]: Start difference. First operand 95 states and 147 transitions. Second operand 8 states. [2018-06-25 09:50:26,461 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:26,461 INFO ]: Finished difference Result 93 states and 159 transitions. [2018-06-25 09:50:26,461 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-25 09:50:26,462 INFO ]: Start accepts. Automaton has 8 states. Word has length 28 [2018-06-25 09:50:26,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:26,463 INFO ]: With dead ends: 93 [2018-06-25 09:50:26,463 INFO ]: Without dead ends: 72 [2018-06-25 09:50:26,463 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:50:26,463 INFO ]: Start minimizeSevpa. Operand 72 states. [2018-06-25 09:50:26,469 INFO ]: Finished minimizeSevpa. Reduced states from 72 to 57. [2018-06-25 09:50:26,469 INFO ]: Start removeUnreachable. Operand 57 states. [2018-06-25 09:50:26,470 INFO ]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2018-06-25 09:50:26,470 INFO ]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 28 [2018-06-25 09:50:26,470 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:26,470 INFO ]: Abstraction has 57 states and 80 transitions. [2018-06-25 09:50:26,470 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:50:26,470 INFO ]: Start isEmpty. Operand 57 states and 80 transitions. [2018-06-25 09:50:26,471 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-25 09:50:26,471 INFO ]: Found error trace [2018-06-25 09:50:26,471 INFO ]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:26,472 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:26,472 INFO ]: Analyzing trace with hash -1031999511, now seen corresponding path program 1 times [2018-06-25 09:50:26,472 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:26,472 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:26,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:26,473 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:26,473 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:26,497 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:26,737 WARN ]: Spent 144.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2018-06-25 09:50:26,786 INFO ]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:50:26,786 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:26,786 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-25 09:50:26,801 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:26,836 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:26,839 INFO ]: Computing forward predicates... [2018-06-25 09:50:27,312 WARN ]: Spent 256.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 34 [2018-06-25 09:50:27,440 INFO ]: Checked inductivity of 17 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-06-25 09:50:27,459 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:27,459 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-06-25 09:50:27,459 INFO ]: Interpolant automaton has 13 states [2018-06-25 09:50:27,460 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-25 09:50:27,460 INFO ]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-06-25 09:50:27,460 INFO ]: Start difference. First operand 57 states and 80 transitions. Second operand 13 states. [2018-06-25 09:50:27,698 WARN ]: Spent 148.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2018-06-25 09:50:28,457 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:28,458 INFO ]: Finished difference Result 117 states and 211 transitions. [2018-06-25 09:50:28,458 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:50:28,458 INFO ]: Start accepts. Automaton has 13 states. Word has length 29 [2018-06-25 09:50:28,458 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:28,459 INFO ]: With dead ends: 117 [2018-06-25 09:50:28,459 INFO ]: Without dead ends: 99 [2018-06-25 09:50:28,460 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:50:28,460 INFO ]: Start minimizeSevpa. Operand 99 states. [2018-06-25 09:50:28,469 INFO ]: Finished minimizeSevpa. Reduced states from 99 to 75. [2018-06-25 09:50:28,469 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-25 09:50:28,470 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2018-06-25 09:50:28,470 INFO ]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 29 [2018-06-25 09:50:28,470 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:28,470 INFO ]: Abstraction has 75 states and 110 transitions. [2018-06-25 09:50:28,470 INFO ]: Interpolant automaton has 13 states. [2018-06-25 09:50:28,470 INFO ]: Start isEmpty. Operand 75 states and 110 transitions. [2018-06-25 09:50:28,472 INFO ]: Finished isEmpty. Found accepting run of length 48 [2018-06-25 09:50:28,472 INFO ]: Found error trace [2018-06-25 09:50:28,472 INFO ]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:28,473 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:28,473 INFO ]: Analyzing trace with hash 1490853481, now seen corresponding path program 2 times [2018-06-25 09:50:28,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:28,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:28,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:28,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:28,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:28,508 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:28,882 INFO ]: Checked inductivity of 68 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-25 09:50:28,882 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:28,882 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) [2018-06-25 09:50:28,897 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:28,950 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:28,950 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:28,955 INFO ]: Computing forward predicates... [2018-06-25 09:50:29,796 WARN ]: Spent 258.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 83 [2018-06-25 09:50:30,363 WARN ]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 27 [2018-06-25 09:50:30,499 INFO ]: Checked inductivity of 68 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-06-25 09:50:30,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:30,519 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-06-25 09:50:30,520 INFO ]: Interpolant automaton has 21 states [2018-06-25 09:50:30,520 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-25 09:50:30,520 INFO ]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2018-06-25 09:50:30,520 INFO ]: Start difference. First operand 75 states and 110 transitions. Second operand 21 states. [2018-06-25 09:50:31,128 WARN ]: Spent 113.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 71 [2018-06-25 09:50:31,305 WARN ]: Spent 130.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 110 [2018-06-25 09:50:31,672 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 127 [2018-06-25 09:50:31,863 WARN ]: Spent 108.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 70 [2018-06-25 09:50:32,623 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:32,623 INFO ]: Finished difference Result 183 states and 429 transitions. [2018-06-25 09:50:32,627 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-25 09:50:32,627 INFO ]: Start accepts. Automaton has 21 states. Word has length 47 [2018-06-25 09:50:32,627 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:32,632 INFO ]: With dead ends: 183 [2018-06-25 09:50:32,632 INFO ]: Without dead ends: 165 [2018-06-25 09:50:32,633 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=244, Invalid=1088, Unknown=0, NotChecked=0, Total=1332 [2018-06-25 09:50:32,633 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-25 09:50:32,661 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 111. [2018-06-25 09:50:32,661 INFO ]: Start removeUnreachable. Operand 111 states. [2018-06-25 09:50:32,662 INFO ]: Finished removeUnreachable. Reduced from 111 states to 111 states and 164 transitions. [2018-06-25 09:50:32,662 INFO ]: Start accepts. Automaton has 111 states and 164 transitions. Word has length 47 [2018-06-25 09:50:32,663 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:32,663 INFO ]: Abstraction has 111 states and 164 transitions. [2018-06-25 09:50:32,663 INFO ]: Interpolant automaton has 21 states. [2018-06-25 09:50:32,663 INFO ]: Start isEmpty. Operand 111 states and 164 transitions. [2018-06-25 09:50:32,668 INFO ]: Finished isEmpty. Found accepting run of length 84 [2018-06-25 09:50:32,668 INFO ]: Found error trace [2018-06-25 09:50:32,668 INFO ]: trace histogram [9, 9, 9, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:32,668 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:32,668 INFO ]: Analyzing trace with hash 1369971561, now seen corresponding path program 3 times [2018-06-25 09:50:32,668 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:32,668 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:32,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:32,673 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:32,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:32,759 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:33,548 INFO ]: Checked inductivity of 278 backedges. 16 proven. 70 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-06-25 09:50:33,548 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:33,548 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) [2018-06-25 09:50:33,563 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:33,667 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-25 09:50:33,667 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:33,673 INFO ]: Computing forward predicates... [2018-06-25 09:50:35,931 INFO ]: Checked inductivity of 278 backedges. 37 proven. 70 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-06-25 09:50:35,950 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:35,950 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 40 [2018-06-25 09:50:35,951 INFO ]: Interpolant automaton has 40 states [2018-06-25 09:50:35,951 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-25 09:50:35,951 INFO ]: CoverageRelationStatistics Valid=87, Invalid=1473, Unknown=0, NotChecked=0, Total=1560 [2018-06-25 09:50:35,952 INFO ]: Start difference. First operand 111 states and 164 transitions. Second operand 40 states. [2018-06-25 09:50:36,656 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-06-25 09:50:36,890 WARN ]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-25 09:50:37,128 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-25 09:50:37,375 WARN ]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-06-25 09:50:37,631 WARN ]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-25 09:50:37,945 WARN ]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2018-06-25 09:50:38,366 WARN ]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-25 09:50:38,779 WARN ]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-06-25 09:50:39,189 WARN ]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-06-25 09:50:39,489 WARN ]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-25 09:50:40,130 WARN ]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-06-25 09:50:40,455 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 172 [2018-06-25 09:50:40,875 WARN ]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-06-25 09:50:41,254 WARN ]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-06-25 09:50:41,667 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 104 [2018-06-25 09:50:42,347 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 292 DAG size of output: 90 [2018-06-25 09:50:42,607 WARN ]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2018-06-25 09:50:46,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:46,918 INFO ]: Finished difference Result 246 states and 668 transitions. [2018-06-25 09:50:46,919 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-25 09:50:46,919 INFO ]: Start accepts. Automaton has 40 states. Word has length 83 [2018-06-25 09:50:46,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:46,930 INFO ]: With dead ends: 246 [2018-06-25 09:50:46,930 INFO ]: Without dead ends: 231 [2018-06-25 09:50:46,931 INFO ]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=428, Invalid=3862, Unknown=0, NotChecked=0, Total=4290 [2018-06-25 09:50:46,931 INFO ]: Start minimizeSevpa. Operand 231 states. [2018-06-25 09:50:46,971 INFO ]: Finished minimizeSevpa. Reduced states from 231 to 120. [2018-06-25 09:50:46,971 INFO ]: Start removeUnreachable. Operand 120 states. [2018-06-25 09:50:46,973 INFO ]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2018-06-25 09:50:46,973 INFO ]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 83 [2018-06-25 09:50:46,974 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:46,974 INFO ]: Abstraction has 120 states and 179 transitions. [2018-06-25 09:50:46,974 INFO ]: Interpolant automaton has 40 states. [2018-06-25 09:50:46,974 INFO ]: Start isEmpty. Operand 120 states and 179 transitions. [2018-06-25 09:50:46,978 INFO ]: Finished isEmpty. Found accepting run of length 93 [2018-06-25 09:50:46,978 INFO ]: Found error trace [2018-06-25 09:50:46,978 INFO ]: trace histogram [10, 10, 10, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:46,978 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:46,978 INFO ]: Analyzing trace with hash 1795663165, now seen corresponding path program 4 times [2018-06-25 09:50:46,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:46,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:46,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:46,979 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:46,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:47,021 INFO ]: Conjunction of SSA is sat [2018-06-25 09:50:47,025 INFO ]: Counterexample might be feasible [2018-06-25 09:50:47,048 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:50:47 BoogieIcfgContainer [2018-06-25 09:50:47,048 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:50:47,049 INFO ]: Toolchain (without parser) took 25561.94 ms. Allocated memory was 309.3 MB in the beginning and 519.6 MB in the end (delta: 210.2 MB). Free memory was 261.7 MB in the beginning and 226.0 MB in the end (delta: 35.8 MB). Peak memory consumption was 246.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:47,050 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:50:47,050 INFO ]: ChcToBoogie took 65.52 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:47,051 INFO ]: Boogie Preprocessor took 42.62 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:47,051 INFO ]: RCFGBuilder took 435.75 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:47,051 INFO ]: TraceAbstraction took 25005.17 ms. Allocated memory was 309.3 MB in the beginning and 519.6 MB in the end (delta: 210.2 MB). Free memory was 245.7 MB in the beginning and 226.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 230.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:47,054 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 309.3 MB. Free memory is still 272.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 65.52 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 259.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 42.62 ms. Allocated memory is still 309.3 MB. Free memory was 259.7 MB in the beginning and 257.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 435.75 ms. Allocated memory is still 309.3 MB. Free memory was 257.7 MB in the beginning and 245.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 25005.17 ms. Allocated memory was 309.3 MB in the beginning and 519.6 MB in the end (delta: 210.2 MB). Free memory was 245.7 MB in the beginning and 226.0 MB in the end (delta: 19.8 MB). Peak memory consumption was 230.0 MB. 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 gotoProc(0, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND FALSE !(gotoSwitch == 3) [L0] COND FALSE !(gotoSwitch == 1) [L0] assume ((!(hbv_False_2_Int <= 1) && !(hbv_False_1_Int <= 0)) && !(hbv_False_1_Int + hbv_False_3_Int == (if hbv_False_2_Int == 10 then 10 else hbv_False_2_Int + hbv_False_4_Int))) && hbv_False_1_Int == hbv_False_2_Int; [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hbv_False_1_Int - 1, hbv_False_2_Int - 1, hbv_False_3_Int, hbv_False_4_Int; [L0] havoc hbv_False_4_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_1_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_3_Int == (if hhv_INV_REC_f^f_1_Int == 10 then 10 else hhv_INV_REC_f^f_1_Int + hbv_INV_REC_f^f_1_Int) && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_2_Int) && !(hhv_INV_REC_f^f_1_Int <= 1); [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, hhv_INV_REC_f^f_2_Int, hhv_INV_REC_f^f_3_Int := hhv_INV_REC_f^f_0_Int - 1, hhv_INV_REC_f^f_1_Int - 1, hbv_INV_REC_f^f_2_Int, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int, hbv_INV_REC_f^f_2_Int; [L0] assume ((hhv_INV_REC_f^f_2_Int == hhv_INV_REC_f^f_0_Int + hbv_INV_REC_f^f_1_Int && !(hhv_INV_REC_f^f_0_Int <= 0)) && hhv_INV_REC_f^f_3_Int == hhv_INV_REC_f^f_1_Int) && hhv_INV_REC_f^f_1_Int <= 1; [L0] CALL call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [L0] COND FALSE !(gotoSwitch == 6) [L0] COND TRUE gotoSwitch == 3 [L0] hhv_INV_REC_f^f_PRE_0_Int, hhv_INV_REC_f^f_PRE_1_Int := gpav_0_Int, gpav_1_Int; [L0] assume (((hhv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int - 1 && !(hbv_INV_REC_f^f_PRE_2_Int <= 1)) && !(hbv_INV_REC_f^f_PRE_1_Int <= 0)) && hhv_INV_REC_f^f_PRE_0_Int == hbv_INV_REC_f^f_PRE_1_Int - 1) && hbv_INV_REC_f^f_PRE_1_Int == hbv_INV_REC_f^f_PRE_2_Int; [L0] RET call gotoProc(3, hhv_INV_REC_f^f_0_Int, hhv_INV_REC_f^f_1_Int, 0, 0); [L0] hhv_INV_REC_f__1_0_Int, hhv_INV_REC_f__1_1_Int := hhv_INV_REC_f^f_0_Int - 1, hbv_INV_REC_f^f_1_Int; [L0] havoc hbv_INV_REC_f^f_1_Int; [L0] assume hhv_INV_REC_f__1_0_Int <= 0 && hhv_INV_REC_f__1_1_Int == hhv_INV_REC_f__1_0_Int; [L0] hhv_INV_REC_f__1_PRE_0_Int := hhv_INV_REC_f__1_0_Int; [L0] assume ((hbv_INV_REC_f__1_PRE_2_Int == hbv_INV_REC_f__1_PRE_1_Int && hhv_INV_REC_f__1_PRE_0_Int == hbv_INV_REC_f__1_PRE_2_Int - 1) && hbv_INV_REC_f__1_PRE_1_Int <= 1) && !(hbv_INV_REC_f__1_PRE_2_Int <= 0); [L0] RET call gotoProc(0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. UNSAFE Result, 24.9s OverallTime, 13 OverallIterations, 10 TraceHistogramMax, 16.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 646 SDtfs, 558 SDslu, 3616 SDs, 0 SdLazy, 4730 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 351 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 712 ImplicationChecksByTransitivity, 13.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 281 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 468 ConstructedInterpolants, 5 QuantifiedInterpolants, 330786 SizeOfPredicates, 48 NumberOfNonLiveVariables, 939 ConjunctsInSsa, 219 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 600/769 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__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-50-47-063.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__limit2!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-50-47-063.csv Received shutdown request...