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__barthe!.smt2' -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-25 09:50:05,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-25 09:50:05,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-25 09:50:05,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-25 09:50:05,161 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-25 09:50:05,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-25 09:50:05,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-25 09:50:05,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-25 09:50:05,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-25 09:50:05,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-25 09:50:05,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-25 09:50:05,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-25 09:50:05,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-25 09:50:05,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-25 09:50:05,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-25 09:50:05,175 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-25 09:50:05,179 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-25 09:50:05,181 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-25 09:50:05,194 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-25 09:50:05,195 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-25 09:50:05,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-25 09:50:05,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-25 09:50:05,199 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-25 09:50:05,199 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-25 09:50:05,200 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-25 09:50:05,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-25 09:50:05,202 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-25 09:50:05,202 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-25 09:50:05,209 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-25 09:50:05,209 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-25 09:50:05,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-25 09:50:05,210 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-25 09:50:05,210 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-25 09:50:05,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-25 09:50:05,212 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-25 09:50:05,212 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:05,242 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-25 09:50:05,242 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-25 09:50:05,243 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-25 09:50:05,243 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-25 09:50:05,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-25 09:50:05,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-25 09:50:05,244 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-25 09:50:05,245 INFO L133 SettingsManager]: * Use SBE=true [2018-06-25 09:50:05,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-25 09:50:05,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-25 09:50:05,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-25 09:50:05,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-25 09:50:05,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-25 09:50:05,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-25 09:50:05,246 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-25 09:50:05,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-25 09:50:05,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-25 09:50:05,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-25 09:50:05,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-25 09:50:05,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-25 09:50:05,250 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-25 09:50:05,252 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-25 09:50:05,252 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-25 09:50:05,298 INFO ]: Repository-Root is: /tmp [2018-06-25 09:50:05,322 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-25 09:50:05,327 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-25 09:50:05,329 INFO ]: Initializing SmtParser... [2018-06-25 09:50:05,329 INFO ]: SmtParser initialized [2018-06-25 09:50:05,330 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-25 09:50:05,331 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:05,424 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@741e30b6 [2018-06-25 09:50:05,604 INFO ]: Succesfully executed SMT file /storage/chc-comp/llreve-bench/smt2/faulty__barthe!.smt2 [2018-06-25 09:50:05,609 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-25 09:50:05,616 INFO ]: Walking toolchain with 4 elements. [2018-06-25 09:50:05,616 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-25 09:50:05,616 INFO ]: Initializing ChcToBoogie... [2018-06-25 09:50:05,617 INFO ]: ChcToBoogie initialized [2018-06-25 09:50:05,623 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,683 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05 Unit [2018-06-25 09:50:05,683 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-25 09:50:05,684 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-25 09:50:05,684 INFO ]: Initializing Boogie Preprocessor... [2018-06-25 09:50:05,684 INFO ]: Boogie Preprocessor initialized [2018-06-25 09:50:05,704 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,704 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,710 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,710 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,713 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,716 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,717 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (1/1) ... [2018-06-25 09:50:05,718 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-25 09:50:05,718 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-25 09:50:05,718 INFO ]: Initializing RCFGBuilder... [2018-06-25 09:50:05,718 INFO ]: RCFGBuilder initialized [2018-06-25 09:50:05,721 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (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:05,737 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-25 09:50:05,737 INFO ]: Found specification of procedure gotoProc [2018-06-25 09:50:05,737 INFO ]: Found implementation of procedure gotoProc [2018-06-25 09:50:05,737 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-25 09:50:05,737 INFO ]: Found specification of procedure Ultimate.START [2018-06-25 09:50:05,737 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:05,993 INFO ]: Using library mode [2018-06-25 09:50:05,994 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:05 BoogieIcfgContainer [2018-06-25 09:50:05,994 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-25 09:50:05,996 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-25 09:50:05,996 INFO ]: Initializing TraceAbstraction... [2018-06-25 09:50:05,999 INFO ]: TraceAbstraction initialized [2018-06-25 09:50:06,000 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 25.06 09:50:05" (1/3) ... [2018-06-25 09:50:06,001 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603052ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 25.06 09:50:06, skipping insertion in model container [2018-06-25 09:50:06,001 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 25.06 09:50:05" (2/3) ... [2018-06-25 09:50:06,001 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603052ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.06 09:50:06, skipping insertion in model container [2018-06-25 09:50:06,001 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.06 09:50:05" (3/3) ... [2018-06-25 09:50:06,004 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver [2018-06-25 09:50:06,014 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-25 09:50:06,025 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-25 09:50:06,079 INFO ]: Using default assertion order modulation [2018-06-25 09:50:06,080 INFO ]: Interprodecural is true [2018-06-25 09:50:06,080 INFO ]: Hoare is false [2018-06-25 09:50:06,080 INFO ]: Compute interpolants for FPandBP [2018-06-25 09:50:06,080 INFO ]: Backedges is TWOTRACK [2018-06-25 09:50:06,080 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-25 09:50:06,080 INFO ]: Difference is false [2018-06-25 09:50:06,080 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-25 09:50:06,080 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-25 09:50:06,098 INFO ]: Start isEmpty. Operand 10 states. [2018-06-25 09:50:06,112 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-25 09:50:06,112 INFO ]: Found error trace [2018-06-25 09:50:06,113 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:06,113 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:06,119 INFO ]: Analyzing trace with hash -204663978, now seen corresponding path program 1 times [2018-06-25 09:50:06,122 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:06,122 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:06,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,173 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:06,173 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,214 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:06,296 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:06,298 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:06,298 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:06,299 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:06,312 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:06,312 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:06,315 INFO ]: Start difference. First operand 10 states. Second operand 3 states. [2018-06-25 09:50:06,387 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:06,387 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-25 09:50:06,388 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:06,389 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-25 09:50:06,389 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:06,397 INFO ]: With dead ends: 9 [2018-06-25 09:50:06,397 INFO ]: Without dead ends: 9 [2018-06-25 09:50:06,399 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:06,416 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:50:06,432 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:50:06,433 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:50:06,437 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:50:06,438 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 7 [2018-06-25 09:50:06,439 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:06,439 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:50:06,439 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:06,439 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:50:06,439 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:50:06,439 INFO ]: Found error trace [2018-06-25 09:50:06,439 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:06,439 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:06,439 INFO ]: Analyzing trace with hash -2057099186, now seen corresponding path program 1 times [2018-06-25 09:50:06,440 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:06,440 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:06,440 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,441 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:06,441 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,462 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:06,627 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:06,627 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:06,627 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:06,629 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:06,629 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:06,629 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:06,629 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-25 09:50:06,777 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:06,777 INFO ]: Finished difference Result 10 states and 16 transitions. [2018-06-25 09:50:06,778 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:06,778 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:50:06,778 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:06,779 INFO ]: With dead ends: 10 [2018-06-25 09:50:06,779 INFO ]: Without dead ends: 10 [2018-06-25 09:50:06,780 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:06,780 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:50:06,781 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-06-25 09:50:06,781 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:50:06,781 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 13 transitions. [2018-06-25 09:50:06,781 INFO ]: Start accepts. Automaton has 9 states and 13 transitions. Word has length 8 [2018-06-25 09:50:06,781 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:06,781 INFO ]: Abstraction has 9 states and 13 transitions. [2018-06-25 09:50:06,781 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:06,782 INFO ]: Start isEmpty. Operand 9 states and 13 transitions. [2018-06-25 09:50:06,782 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:50:06,782 INFO ]: Found error trace [2018-06-25 09:50:06,782 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:06,783 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:06,783 INFO ]: Analyzing trace with hash -2053405102, now seen corresponding path program 1 times [2018-06-25 09:50:06,783 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:06,783 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:06,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,784 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:06,784 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,810 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:06,875 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:06,876 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:06,876 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:06,876 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:06,876 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:06,876 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:06,876 INFO ]: Start difference. First operand 9 states and 13 transitions. Second operand 3 states. [2018-06-25 09:50:06,971 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:06,972 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-25 09:50:06,974 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:06,974 INFO ]: Start accepts. Automaton has 3 states. Word has length 8 [2018-06-25 09:50:06,975 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:06,975 INFO ]: With dead ends: 10 [2018-06-25 09:50:06,975 INFO ]: Without dead ends: 9 [2018-06-25 09:50:06,975 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:06,975 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-25 09:50:06,977 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-25 09:50:06,977 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-25 09:50:06,977 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-25 09:50:06,977 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-25 09:50:06,977 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:06,977 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-25 09:50:06,977 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:06,977 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-25 09:50:06,977 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-25 09:50:06,977 INFO ]: Found error trace [2018-06-25 09:50:06,978 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:06,978 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:06,978 INFO ]: Analyzing trace with hash -2048787497, now seen corresponding path program 1 times [2018-06-25 09:50:06,978 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:06,978 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:06,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:06,979 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:06,979 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:07,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:07,106 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:07,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:07,107 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:07,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:07,165 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:07,174 INFO ]: Computing forward predicates... [2018-06-25 09:50:07,242 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:07,278 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:07,278 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-25 09:50:07,279 INFO ]: Interpolant automaton has 5 states [2018-06-25 09:50:07,279 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-25 09:50:07,279 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:07,279 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-25 09:50:07,464 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:07,464 INFO ]: Finished difference Result 11 states and 15 transitions. [2018-06-25 09:50:07,464 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-25 09:50:07,464 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-25 09:50:07,465 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:07,465 INFO ]: With dead ends: 11 [2018-06-25 09:50:07,465 INFO ]: Without dead ends: 11 [2018-06-25 09:50:07,465 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-25 09:50:07,465 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:50:07,467 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-06-25 09:50:07,467 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:50:07,467 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-25 09:50:07,467 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 8 [2018-06-25 09:50:07,467 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:07,467 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-25 09:50:07,467 INFO ]: Interpolant automaton has 5 states. [2018-06-25 09:50:07,467 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-25 09:50:07,468 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:50:07,468 INFO ]: Found error trace [2018-06-25 09:50:07,469 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:07,469 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:07,469 INFO ]: Analyzing trace with hash 655263199, now seen corresponding path program 1 times [2018-06-25 09:50:07,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:07,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:07,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:07,470 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:07,470 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:07,493 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:07,550 INFO ]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-25 09:50:07,550 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-25 09:50:07,550 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-25 09:50:07,550 INFO ]: Interpolant automaton has 3 states [2018-06-25 09:50:07,551 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-25 09:50:07,551 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-25 09:50:07,551 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 3 states. [2018-06-25 09:50:07,568 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:07,568 INFO ]: Finished difference Result 12 states and 17 transitions. [2018-06-25 09:50:07,569 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-25 09:50:07,569 INFO ]: Start accepts. Automaton has 3 states. Word has length 9 [2018-06-25 09:50:07,570 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:07,570 INFO ]: With dead ends: 12 [2018-06-25 09:50:07,570 INFO ]: Without dead ends: 10 [2018-06-25 09:50:07,570 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 3 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:07,570 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-25 09:50:07,571 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-25 09:50:07,571 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-25 09:50:07,572 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-25 09:50:07,572 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2018-06-25 09:50:07,572 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:07,572 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-25 09:50:07,572 INFO ]: Interpolant automaton has 3 states. [2018-06-25 09:50:07,572 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-25 09:50:07,572 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-25 09:50:07,572 INFO ]: Found error trace [2018-06-25 09:50:07,572 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:07,572 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:07,572 INFO ]: Analyzing trace with hash 912925558, now seen corresponding path program 2 times [2018-06-25 09:50:07,572 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:07,572 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:07,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:07,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:07,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:07,615 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:07,809 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:07,809 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:07,809 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:07,817 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-25 09:50:07,874 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:07,874 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:07,877 INFO ]: Computing forward predicates... [2018-06-25 09:50:08,122 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:08,145 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:08,146 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-25 09:50:08,146 INFO ]: Interpolant automaton has 7 states [2018-06-25 09:50:08,146 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-25 09:50:08,146 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:08,146 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2018-06-25 09:50:08,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:08,275 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-25 09:50:08,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-25 09:50:08,276 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-25 09:50:08,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:08,276 INFO ]: With dead ends: 11 [2018-06-25 09:50:08,276 INFO ]: Without dead ends: 11 [2018-06-25 09:50:08,276 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-25 09:50:08,276 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-25 09:50:08,278 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-25 09:50:08,278 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-25 09:50:08,278 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-25 09:50:08,278 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-25 09:50:08,278 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:08,278 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-25 09:50:08,278 INFO ]: Interpolant automaton has 7 states. [2018-06-25 09:50:08,278 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-25 09:50:08,279 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-25 09:50:08,279 INFO ]: Found error trace [2018-06-25 09:50:08,279 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:08,279 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:08,279 INFO ]: Analyzing trace with hash -1763250249, now seen corresponding path program 3 times [2018-06-25 09:50:08,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:08,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:08,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:08,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:08,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:08,312 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:08,520 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:08,520 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:08,520 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:08,534 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:50:08,603 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-25 09:50:08,603 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:08,606 INFO ]: Computing forward predicates... [2018-06-25 09:50:08,946 WARN ]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-06-25 09:50:09,061 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:09,080 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:09,080 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-25 09:50:09,080 INFO ]: Interpolant automaton has 8 states [2018-06-25 09:50:09,081 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-25 09:50:09,081 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:09,081 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2018-06-25 09:50:09,412 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:09,412 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-25 09:50:09,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-25 09:50:09,415 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-25 09:50:09,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:09,416 INFO ]: With dead ends: 12 [2018-06-25 09:50:09,416 INFO ]: Without dead ends: 12 [2018-06-25 09:50:09,416 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-25 09:50:09,416 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-25 09:50:09,417 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-25 09:50:09,417 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-25 09:50:09,417 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-25 09:50:09,417 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-25 09:50:09,417 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:09,417 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-25 09:50:09,417 INFO ]: Interpolant automaton has 8 states. [2018-06-25 09:50:09,418 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-25 09:50:09,418 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-25 09:50:09,418 INFO ]: Found error trace [2018-06-25 09:50:09,418 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:09,418 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:09,418 INFO ]: Analyzing trace with hash 1174645654, now seen corresponding path program 4 times [2018-06-25 09:50:09,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:09,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:09,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:09,419 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:09,419 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:09,489 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:09,836 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:09,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:09,836 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-25 09:50:09,842 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:50:09,866 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:50:09,866 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:09,869 INFO ]: Computing forward predicates... [2018-06-25 09:50:10,231 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:10,264 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:10,264 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-25 09:50:10,264 INFO ]: Interpolant automaton has 10 states [2018-06-25 09:50:10,264 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-25 09:50:10,264 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:10,265 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-06-25 09:50:10,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:10,362 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-25 09:50:10,363 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-25 09:50:10,363 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-25 09:50:10,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:10,363 INFO ]: With dead ends: 13 [2018-06-25 09:50:10,363 INFO ]: Without dead ends: 13 [2018-06-25 09:50:10,363 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-25 09:50:10,364 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-25 09:50:10,365 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-25 09:50:10,365 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-25 09:50:10,365 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-25 09:50:10,365 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-25 09:50:10,365 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:10,365 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-25 09:50:10,365 INFO ]: Interpolant automaton has 10 states. [2018-06-25 09:50:10,365 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-25 09:50:10,366 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-25 09:50:10,366 INFO ]: Found error trace [2018-06-25 09:50:10,366 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:10,366 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:10,366 INFO ]: Analyzing trace with hash 2055105431, now seen corresponding path program 5 times [2018-06-25 09:50:10,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:10,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:10,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:10,367 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:10,367 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:10,392 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:10,798 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-25 09:50:10,935 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:10,935 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:10,935 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-25 09:50:10,949 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:50:11,015 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-25 09:50:11,015 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:11,019 INFO ]: Computing forward predicates... [2018-06-25 09:50:11,684 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:11,708 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:11,708 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-25 09:50:11,708 INFO ]: Interpolant automaton has 12 states [2018-06-25 09:50:11,708 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-25 09:50:11,709 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:11,709 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-06-25 09:50:11,763 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:11,763 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-25 09:50:11,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-25 09:50:11,766 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-25 09:50:11,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:11,766 INFO ]: With dead ends: 14 [2018-06-25 09:50:11,766 INFO ]: Without dead ends: 14 [2018-06-25 09:50:11,766 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-25 09:50:11,766 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-25 09:50:11,767 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-25 09:50:11,767 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-25 09:50:11,768 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-25 09:50:11,768 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-25 09:50:11,768 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:11,768 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-25 09:50:11,768 INFO ]: Interpolant automaton has 12 states. [2018-06-25 09:50:11,768 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-25 09:50:11,768 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-25 09:50:11,768 INFO ]: Found error trace [2018-06-25 09:50:11,768 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:11,768 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:11,768 INFO ]: Analyzing trace with hash -715412554, now seen corresponding path program 6 times [2018-06-25 09:50:11,768 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:11,768 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:11,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:11,769 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:11,769 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:11,797 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:12,011 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:12,012 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:12,012 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:12,017 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-25 09:50:12,044 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-25 09:50:12,045 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:12,049 INFO ]: Computing forward predicates... [2018-06-25 09:50:12,471 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:12,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:12,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-25 09:50:12,491 INFO ]: Interpolant automaton has 14 states [2018-06-25 09:50:12,491 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-25 09:50:12,491 INFO ]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:50:12,491 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-06-25 09:50:12,555 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:12,555 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-25 09:50:12,555 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-25 09:50:12,555 INFO ]: Start accepts. Automaton has 14 states. Word has length 13 [2018-06-25 09:50:12,555 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:12,556 INFO ]: With dead ends: 15 [2018-06-25 09:50:12,556 INFO ]: Without dead ends: 15 [2018-06-25 09:50:12,556 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-06-25 09:50:12,556 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-25 09:50:12,557 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-25 09:50:12,557 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-25 09:50:12,558 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-25 09:50:12,558 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-25 09:50:12,558 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:12,558 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-25 09:50:12,558 INFO ]: Interpolant automaton has 14 states. [2018-06-25 09:50:12,558 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-25 09:50:12,558 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-25 09:50:12,558 INFO ]: Found error trace [2018-06-25 09:50:12,558 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:12,558 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:12,559 INFO ]: Analyzing trace with hash -702124169, now seen corresponding path program 7 times [2018-06-25 09:50:12,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:12,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:12,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:12,559 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:12,559 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:12,595 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:13,115 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:13,115 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:13,115 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-25 09:50:13,124 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:13,164 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:13,170 INFO ]: Computing forward predicates... [2018-06-25 09:50:13,902 WARN ]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2018-06-25 09:50:13,963 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:13,982 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:13,982 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-06-25 09:50:13,982 INFO ]: Interpolant automaton has 16 states [2018-06-25 09:50:13,983 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-25 09:50:13,983 INFO ]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:50:13,983 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 16 states. [2018-06-25 09:50:14,069 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:14,069 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-25 09:50:14,069 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-25 09:50:14,069 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-25 09:50:14,069 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:14,070 INFO ]: With dead ends: 16 [2018-06-25 09:50:14,070 INFO ]: Without dead ends: 16 [2018-06-25 09:50:14,070 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-06-25 09:50:14,070 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-25 09:50:14,072 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-25 09:50:14,072 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-25 09:50:14,072 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-25 09:50:14,072 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-25 09:50:14,072 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:14,072 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-25 09:50:14,072 INFO ]: Interpolant automaton has 16 states. [2018-06-25 09:50:14,072 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-25 09:50:14,073 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-25 09:50:14,073 INFO ]: Found error trace [2018-06-25 09:50:14,073 INFO ]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:14,073 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:14,073 INFO ]: Analyzing trace with hash -290184234, now seen corresponding path program 8 times [2018-06-25 09:50:14,073 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:14,073 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:14,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:14,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-25 09:50:14,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:14,130 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:14,340 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:14,340 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:14,340 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) [2018-06-25 09:50:14,357 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-25 09:50:14,406 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-25 09:50:14,406 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:14,411 INFO ]: Computing forward predicates... [2018-06-25 09:50:14,886 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:14,905 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:14,906 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-06-25 09:50:14,906 INFO ]: Interpolant automaton has 18 states [2018-06-25 09:50:14,906 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-25 09:50:14,906 INFO ]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:50:14,906 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 18 states. [2018-06-25 09:50:15,053 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:15,053 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-25 09:50:15,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-25 09:50:15,053 INFO ]: Start accepts. Automaton has 18 states. Word has length 15 [2018-06-25 09:50:15,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:15,053 INFO ]: With dead ends: 17 [2018-06-25 09:50:15,053 INFO ]: Without dead ends: 17 [2018-06-25 09:50:15,054 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-06-25 09:50:15,054 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-25 09:50:15,055 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-25 09:50:15,055 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-25 09:50:15,056 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-25 09:50:15,056 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-25 09:50:15,056 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:15,056 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-25 09:50:15,056 INFO ]: Interpolant automaton has 18 states. [2018-06-25 09:50:15,056 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-25 09:50:15,056 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-25 09:50:15,056 INFO ]: Found error trace [2018-06-25 09:50:15,056 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:15,056 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:15,056 INFO ]: Analyzing trace with hash -404948137, now seen corresponding path program 9 times [2018-06-25 09:50:15,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:15,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:15,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:15,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:15,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:15,126 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:15,405 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:15,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:15,406 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-25 09:50:15,411 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-25 09:50:15,489 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-25 09:50:15,489 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:15,494 INFO ]: Computing forward predicates... [2018-06-25 09:50:16,381 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:16,401 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:16,401 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2018-06-25 09:50:16,401 INFO ]: Interpolant automaton has 20 states [2018-06-25 09:50:16,401 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-25 09:50:16,401 INFO ]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:50:16,402 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 20 states. [2018-06-25 09:50:16,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:16,737 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-25 09:50:16,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-25 09:50:16,738 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-25 09:50:16,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:16,739 INFO ]: With dead ends: 18 [2018-06-25 09:50:16,739 INFO ]: Without dead ends: 18 [2018-06-25 09:50:16,739 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-06-25 09:50:16,739 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-25 09:50:16,741 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-25 09:50:16,741 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-25 09:50:16,741 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-25 09:50:16,741 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-25 09:50:16,741 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:16,741 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-25 09:50:16,741 INFO ]: Interpolant automaton has 20 states. [2018-06-25 09:50:16,741 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-25 09:50:16,742 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-25 09:50:16,742 INFO ]: Found error trace [2018-06-25 09:50:16,742 INFO ]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:16,742 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:16,742 INFO ]: Analyzing trace with hash 332338166, now seen corresponding path program 10 times [2018-06-25 09:50:16,742 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:16,742 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:16,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:16,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:16,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:16,790 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:17,149 WARN ]: Spent 220.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 10 [2018-06-25 09:50:17,448 WARN ]: Spent 252.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-06-25 09:50:17,750 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:17,750 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:17,750 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-25 09:50:17,755 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-25 09:50:17,802 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-25 09:50:17,802 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:17,808 INFO ]: Computing forward predicates... [2018-06-25 09:50:19,111 WARN ]: Spent 508.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2018-06-25 09:50:19,610 WARN ]: Spent 142.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2018-06-25 09:50:19,956 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:19,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:19,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-06-25 09:50:19,977 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:50:19,977 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:50:19,977 INFO ]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:50:19,977 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 24 states. [2018-06-25 09:50:20,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:20,198 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-25 09:50:20,198 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:50:20,198 INFO ]: Start accepts. Automaton has 24 states. Word has length 17 [2018-06-25 09:50:20,198 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:20,198 INFO ]: With dead ends: 19 [2018-06-25 09:50:20,198 INFO ]: Without dead ends: 19 [2018-06-25 09:50:20,199 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-06-25 09:50:20,199 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-25 09:50:20,200 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-25 09:50:20,200 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-25 09:50:20,201 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-25 09:50:20,201 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-25 09:50:20,201 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:20,201 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-25 09:50:20,201 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:50:20,201 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-25 09:50:20,201 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-25 09:50:20,201 INFO ]: Found error trace [2018-06-25 09:50:20,201 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:20,201 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:20,201 INFO ]: Analyzing trace with hash 1713377079, now seen corresponding path program 11 times [2018-06-25 09:50:20,201 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:20,201 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:20,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:20,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:20,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:20,265 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:20,566 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:20,566 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-25 09:50:20,566 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-25 09:50:20,573 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-25 09:50:20,623 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-25 09:50:20,623 INFO ]: Conjunction of SSA is unsat [2018-06-25 09:50:20,629 INFO ]: Computing forward predicates... [2018-06-25 09:50:21,465 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-25 09:50:21,485 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-25 09:50:21,485 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2018-06-25 09:50:21,485 INFO ]: Interpolant automaton has 24 states [2018-06-25 09:50:21,486 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-25 09:50:21,486 INFO ]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:50:21,486 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 24 states. [2018-06-25 09:50:21,699 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-25 09:50:21,699 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-25 09:50:21,700 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-25 09:50:21,700 INFO ]: Start accepts. Automaton has 24 states. Word has length 18 [2018-06-25 09:50:21,700 INFO ]: Finished accepts. some prefix is accepted. [2018-06-25 09:50:21,700 INFO ]: With dead ends: 20 [2018-06-25 09:50:21,700 INFO ]: Without dead ends: 20 [2018-06-25 09:50:21,701 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2018-06-25 09:50:21,701 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-25 09:50:21,702 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-25 09:50:21,702 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-25 09:50:21,703 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-25 09:50:21,703 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-25 09:50:21,703 INFO ]: Finished accepts. word is rejected. [2018-06-25 09:50:21,703 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-25 09:50:21,703 INFO ]: Interpolant automaton has 24 states. [2018-06-25 09:50:21,703 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-25 09:50:21,703 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-25 09:50:21,703 INFO ]: Found error trace [2018-06-25 09:50:21,703 INFO ]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1] [2018-06-25 09:50:21,704 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-25 09:50:21,704 INFO ]: Analyzing trace with hash 1575910422, now seen corresponding path program 12 times [2018-06-25 09:50:21,704 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-25 09:50:21,704 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-25 09:50:21,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:21,704 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-25 09:50:21,704 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-25 09:50:21,741 INFO ]: Conjunction of SSA is sat [2018-06-25 09:50:21,746 INFO ]: Counterexample might be feasible [2018-06-25 09:50:21,765 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.06 09:50:21 BoogieIcfgContainer [2018-06-25 09:50:21,765 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-25 09:50:21,766 INFO ]: Toolchain (without parser) took 16156.68 ms. Allocated memory was 302.0 MB in the beginning and 438.8 MB in the end (delta: 136.8 MB). Free memory was 258.4 MB in the beginning and 350.5 MB in the end (delta: -92.1 MB). Peak memory consumption was 44.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:21,767 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-25 09:50:21,767 INFO ]: ChcToBoogie took 66.77 ms. Allocated memory is still 302.0 MB. Free memory was 258.4 MB in the beginning and 255.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:21,767 INFO ]: Boogie Preprocessor took 34.42 ms. Allocated memory is still 302.0 MB. Free memory was 255.4 MB in the beginning and 254.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-25 09:50:21,768 INFO ]: RCFGBuilder took 275.64 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 246.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:21,768 INFO ]: TraceAbstraction took 15769.11 ms. Allocated memory was 302.0 MB in the beginning and 438.8 MB in the end (delta: 136.8 MB). Free memory was 245.4 MB in the beginning and 350.5 MB in the end (delta: -105.1 MB). Peak memory consumption was 31.7 MB. Max. memory is 3.6 GB. [2018-06-25 09:50:21,771 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 302.0 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.77 ms. Allocated memory is still 302.0 MB. Free memory was 258.4 MB in the beginning and 255.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.42 ms. Allocated memory is still 302.0 MB. Free memory was 255.4 MB in the beginning and 254.4 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 275.64 ms. Allocated memory is still 302.0 MB. Free memory was 254.4 MB in the beginning and 246.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 15769.11 ms. Allocated memory was 302.0 MB in the beginning and 438.8 MB in the end (delta: 136.8 MB). Free memory was 245.4 MB in the beginning and 350.5 MB in the end (delta: -105.1 MB). Peak memory consumption was 31.7 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, 0, 0, 0, 0); [L0] gotoSwitch := gotoSwitch_in; [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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_False_5_Int, hbv_False_3_Int, hbv_False_6_Int, hbv_False_8_Int, hbv_False_2_Int, hbv_False_4_Int, hbv_False_7_Int, hbv_False_1_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_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] hhv_INV_MAIN_42_0_Int, hhv_INV_MAIN_42_1_Int, hhv_INV_MAIN_42_2_Int, hhv_INV_MAIN_42_3_Int, hhv_INV_MAIN_42_4_Int, hhv_INV_MAIN_42_5_Int, hhv_INV_MAIN_42_6_Int, hhv_INV_MAIN_42_7_Int := 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] havoc hbv_INV_MAIN_42_4_Int, hbv_INV_MAIN_42_5_Int, hbv_INV_MAIN_42_1_Int, hbv_INV_MAIN_42_3_Int, hbv_INV_MAIN_42_2_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 gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 10 locations, 1 error locations. UNSAFE Result, 15.6s OverallTime, 16 OverallIterations, 12 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 113 SDtfs, 10 SDslu, 552 SDs, 0 SdLazy, 1132 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 96 SyntacticMatches, 9 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=15, 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, 15 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 337 NumberOfCodeBlocks, 337 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 84269 SizeOfPredicates, 65 NumberOfNonLiveVariables, 2486 ConjunctsInSsa, 1397 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 5/577 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_Goto.epf_AutomizerCHC.xml/Csv-Benchmark-0-2018-06-25_09-50-21-786.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/faulty__barthe!.smt2_AutomizerCHC_Goto.epf_AutomizerCHC.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-25_09-50-21-786.csv Received shutdown request...