java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:38:07,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:38:07,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:38:07,036 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:38:07,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:38:07,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:38:07,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:38:07,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:38:07,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:38:07,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:38:07,044 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:38:07,045 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:38:07,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:38:07,047 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:38:07,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:38:07,051 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:38:07,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:38:07,066 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:38:07,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:38:07,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:38:07,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:38:07,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:38:07,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:38:07,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:38:07,072 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:38:07,073 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:38:07,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:38:07,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:38:07,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:38:07,079 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:38:07,079 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:38:07,084 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:38:07,085 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:38:07,085 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:38:07,086 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:38:07,086 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:38:07,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:38:07,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:38:07,105 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:38:07,105 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:38:07,106 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:38:07,106 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:38:07,106 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:38:07,106 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:38:07,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:38:07,107 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:38:07,107 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:38:07,107 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:38:07,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:38:07,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:38:07,108 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:38:07,108 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:38:07,108 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:38:07,108 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:38:07,108 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:38:07,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:38:07,109 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:38:07,110 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:38:07,110 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:38:07,155 INFO ]: Repository-Root is: /tmp [2018-06-24 20:38:07,171 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:38:07,179 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:38:07,181 INFO ]: Initializing SmtParser... [2018-06-24 20:38:07,181 INFO ]: SmtParser initialized [2018-06-24 20:38:07,182 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 [2018-06-24 20:38:07,183 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-24 20:38:07,273 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 unknown [2018-06-24 20:38:07,627 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/Consistency/slow-hull.56.smt2 [2018-06-24 20:38:07,631 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:38:07,636 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:38:07,637 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:38:07,637 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:38:07,637 INFO ]: ChcToBoogie initialized [2018-06-24 20:38:07,643 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,739 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07 Unit [2018-06-24 20:38:07,739 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:38:07,740 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:38:07,740 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:38:07,740 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:38:07,756 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,756 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,765 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,765 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,779 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,783 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,786 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (1/1) ... [2018-06-24 20:38:07,789 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:38:07,790 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:38:07,790 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:38:07,790 INFO ]: RCFGBuilder initialized [2018-06-24 20:38:07,790 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:38:07,806 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:38:07,806 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:38:07,807 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:38:07,807 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:38:07,807 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:38:07,807 INFO ]: Found implementation of procedure Ultimate.START [2018-06-24 20:38:09,023 INFO ]: Using library mode [2018-06-24 20:38:09,023 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:38:09 BoogieIcfgContainer [2018-06-24 20:38:09,024 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:38:09,024 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:38:09,024 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:38:09,025 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:38:09,026 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:38:09" (1/1) ... [2018-06-24 20:38:09,062 INFO ]: Initial Icfg 144 locations, 276 edges [2018-06-24 20:38:09,063 INFO ]: Using Remove infeasible edges [2018-06-24 20:38:09,064 INFO ]: Using Maximize final states [2018-06-24 20:38:09,064 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:38:09,064 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:38:09,066 INFO ]: Using Remove sink states [2018-06-24 20:38:09,067 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:38:09,067 INFO ]: Using Use SBE [2018-06-24 20:38:09,081 INFO ]: SBE split 0 edges [2018-06-24 20:38:09,092 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:38:09,095 INFO ]: 0 new accepting states [2018-06-24 20:38:09,580 INFO ]: Removed 49 edges and 8 locations by large block encoding [2018-06-24 20:38:09,583 INFO ]: Removed 1 edges and 1 locations by removing sink states [2018-06-24 20:38:09,586 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:38:09,587 INFO ]: 0 new accepting states [2018-06-24 20:38:09,589 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:38:09,590 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:38:09,592 INFO ]: Encoded RCFG 133 locations, 264 edges [2018-06-24 20:38:09,592 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:38:09 BasicIcfg [2018-06-24 20:38:09,592 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:38:09,593 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:38:09,593 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:38:09,596 INFO ]: TraceAbstraction initialized [2018-06-24 20:38:09,597 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:38:07" (1/4) ... [2018-06-24 20:38:09,597 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85e4792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:38:09, skipping insertion in model container [2018-06-24 20:38:09,598 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:38:07" (2/4) ... [2018-06-24 20:38:09,598 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85e4792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:38:09, skipping insertion in model container [2018-06-24 20:38:09,598 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:38:09" (3/4) ... [2018-06-24 20:38:09,600 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@85e4792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:38:09, skipping insertion in model container [2018-06-24 20:38:09,600 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:38:09" (4/4) ... [2018-06-24 20:38:09,604 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:38:09,611 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:38:09,618 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:38:09,653 INFO ]: Using default assertion order modulation [2018-06-24 20:38:09,654 INFO ]: Interprodecural is true [2018-06-24 20:38:09,654 INFO ]: Hoare is false [2018-06-24 20:38:09,654 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:38:09,654 INFO ]: Backedges is TWOTRACK [2018-06-24 20:38:09,654 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:38:09,654 INFO ]: Difference is false [2018-06-24 20:38:09,654 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:38:09,654 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:38:09,671 INFO ]: Start isEmpty. Operand 133 states. [2018-06-24 20:38:09,707 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-24 20:38:09,707 INFO ]: Found error trace [2018-06-24 20:38:09,708 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-24 20:38:09,709 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:09,713 INFO ]: Analyzing trace with hash 5655428, now seen corresponding path program 1 times [2018-06-24 20:38:09,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:09,716 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:09,750 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:09,751 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:09,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:09,814 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:09,943 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:38:09,945 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:09,945 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:38:09,947 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:38:09,962 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:38:09,962 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:38:09,965 INFO ]: Start difference. First operand 133 states. Second operand 3 states. [2018-06-24 20:38:11,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:11,325 INFO ]: Finished difference Result 134 states and 361 transitions. [2018-06-24 20:38:11,326 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:38:11,327 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-24 20:38:11,327 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:11,372 INFO ]: With dead ends: 134 [2018-06-24 20:38:11,372 INFO ]: Without dead ends: 134 [2018-06-24 20:38:11,374 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-24 20:38:11,394 INFO ]: Start minimizeSevpa. Operand 134 states. [2018-06-24 20:38:11,525 INFO ]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-06-24 20:38:11,526 INFO ]: Start removeUnreachable. Operand 134 states. [2018-06-24 20:38:11,591 INFO ]: Finished removeUnreachable. Reduced from 134 states to 134 states and 361 transitions. [2018-06-24 20:38:11,593 INFO ]: Start accepts. Automaton has 134 states and 361 transitions. Word has length 4 [2018-06-24 20:38:11,593 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:11,594 INFO ]: Abstraction has 134 states and 361 transitions. [2018-06-24 20:38:11,594 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:38:11,594 INFO ]: Start isEmpty. Operand 134 states and 361 transitions. [2018-06-24 20:38:11,602 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:38:11,602 INFO ]: Found error trace [2018-06-24 20:38:11,602 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:38:11,602 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:11,603 INFO ]: Analyzing trace with hash 174777013, now seen corresponding path program 1 times [2018-06-24 20:38:11,603 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:11,603 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:11,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:11,604 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:11,604 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:11,619 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:11,701 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:38:11,701 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:11,701 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:38:11,703 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:38:11,703 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:38:11,703 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:38:11,703 INFO ]: Start difference. First operand 134 states and 361 transitions. Second operand 3 states. [2018-06-24 20:38:13,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:13,500 INFO ]: Finished difference Result 264 states and 575 transitions. [2018-06-24 20:38:13,501 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:38:13,501 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:38:13,501 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:13,518 INFO ]: With dead ends: 264 [2018-06-24 20:38:13,518 INFO ]: Without dead ends: 264 [2018-06-24 20:38:13,518 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-24 20:38:13,519 INFO ]: Start minimizeSevpa. Operand 264 states. [2018-06-24 20:38:13,570 INFO ]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-06-24 20:38:13,570 INFO ]: Start removeUnreachable. Operand 264 states. [2018-06-24 20:38:13,581 INFO ]: Finished removeUnreachable. Reduced from 264 states to 264 states and 575 transitions. [2018-06-24 20:38:13,582 INFO ]: Start accepts. Automaton has 264 states and 575 transitions. Word has length 5 [2018-06-24 20:38:13,582 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:13,582 INFO ]: Abstraction has 264 states and 575 transitions. [2018-06-24 20:38:13,582 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:38:13,582 INFO ]: Start isEmpty. Operand 264 states and 575 transitions. [2018-06-24 20:38:13,591 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:38:13,591 INFO ]: Found error trace [2018-06-24 20:38:13,591 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:38:13,591 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:13,591 INFO ]: Analyzing trace with hash 174807765, now seen corresponding path program 1 times [2018-06-24 20:38:13,591 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:13,591 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:13,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:13,592 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:13,592 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:13,605 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:13,687 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:38:13,687 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:13,687 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:38:13,687 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:38:13,687 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:38:13,687 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:38:13,688 INFO ]: Start difference. First operand 264 states and 575 transitions. Second operand 3 states. [2018-06-24 20:38:14,437 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:14,437 INFO ]: Finished difference Result 394 states and 786 transitions. [2018-06-24 20:38:14,438 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:38:14,438 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:38:14,438 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:14,459 INFO ]: With dead ends: 394 [2018-06-24 20:38:14,459 INFO ]: Without dead ends: 394 [2018-06-24 20:38:14,460 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-24 20:38:14,460 INFO ]: Start minimizeSevpa. Operand 394 states. [2018-06-24 20:38:14,578 INFO ]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-06-24 20:38:14,578 INFO ]: Start removeUnreachable. Operand 394 states. [2018-06-24 20:38:14,592 INFO ]: Finished removeUnreachable. Reduced from 394 states to 394 states and 786 transitions. [2018-06-24 20:38:14,592 INFO ]: Start accepts. Automaton has 394 states and 786 transitions. Word has length 5 [2018-06-24 20:38:14,592 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:14,592 INFO ]: Abstraction has 394 states and 786 transitions. [2018-06-24 20:38:14,592 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:38:14,592 INFO ]: Start isEmpty. Operand 394 states and 786 transitions. [2018-06-24 20:38:14,614 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:38:14,614 INFO ]: Found error trace [2018-06-24 20:38:14,614 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:14,614 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:14,615 INFO ]: Analyzing trace with hash -1339379745, now seen corresponding path program 1 times [2018-06-24 20:38:14,615 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:14,615 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:14,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:14,616 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:14,616 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:14,662 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:14,781 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:14,781 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:14,781 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:38:14,781 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:38:14,781 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:38:14,782 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:38:14,782 INFO ]: Start difference. First operand 394 states and 786 transitions. Second operand 5 states. [2018-06-24 20:38:16,420 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:16,420 INFO ]: Finished difference Result 748 states and 1872 transitions. [2018-06-24 20:38:16,421 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:38:16,421 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:38:16,421 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:16,494 INFO ]: With dead ends: 748 [2018-06-24 20:38:16,494 INFO ]: Without dead ends: 744 [2018-06-24 20:38:16,494 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:38:16,496 INFO ]: Start minimizeSevpa. Operand 744 states. [2018-06-24 20:38:16,643 INFO ]: Finished minimizeSevpa. Reduced states from 744 to 610. [2018-06-24 20:38:16,643 INFO ]: Start removeUnreachable. Operand 610 states. [2018-06-24 20:38:16,664 INFO ]: Finished removeUnreachable. Reduced from 610 states to 610 states and 1338 transitions. [2018-06-24 20:38:16,664 INFO ]: Start accepts. Automaton has 610 states and 1338 transitions. Word has length 9 [2018-06-24 20:38:16,664 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:16,664 INFO ]: Abstraction has 610 states and 1338 transitions. [2018-06-24 20:38:16,664 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:38:16,664 INFO ]: Start isEmpty. Operand 610 states and 1338 transitions. [2018-06-24 20:38:16,689 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:38:16,689 INFO ]: Found error trace [2018-06-24 20:38:16,689 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:16,689 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:16,689 INFO ]: Analyzing trace with hash -1001601719, now seen corresponding path program 1 times [2018-06-24 20:38:16,689 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:16,689 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:16,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:16,690 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:16,690 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:16,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:16,815 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:16,815 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:16,815 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:38:16,815 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:38:16,815 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:38:16,815 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:38:16,815 INFO ]: Start difference. First operand 610 states and 1338 transitions. Second operand 5 states. [2018-06-24 20:38:19,014 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:19,015 INFO ]: Finished difference Result 1402 states and 4365 transitions. [2018-06-24 20:38:19,018 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:38:19,018 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:38:19,018 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:19,166 INFO ]: With dead ends: 1402 [2018-06-24 20:38:19,166 INFO ]: Without dead ends: 1101 [2018-06-24 20:38:19,166 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:38:19,167 INFO ]: Start minimizeSevpa. Operand 1101 states. [2018-06-24 20:38:19,446 INFO ]: Finished minimizeSevpa. Reduced states from 1101 to 750. [2018-06-24 20:38:19,446 INFO ]: Start removeUnreachable. Operand 750 states. [2018-06-24 20:38:19,550 INFO ]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1682 transitions. [2018-06-24 20:38:19,550 INFO ]: Start accepts. Automaton has 750 states and 1682 transitions. Word has length 9 [2018-06-24 20:38:19,550 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:19,550 INFO ]: Abstraction has 750 states and 1682 transitions. [2018-06-24 20:38:19,550 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:38:19,550 INFO ]: Start isEmpty. Operand 750 states and 1682 transitions. [2018-06-24 20:38:19,577 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:38:19,577 INFO ]: Found error trace [2018-06-24 20:38:19,577 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:19,577 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:19,577 INFO ]: Analyzing trace with hash -1001597875, now seen corresponding path program 1 times [2018-06-24 20:38:19,577 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:19,577 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:19,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:19,578 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:19,578 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:19,614 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:19,869 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:19,869 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:19,869 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-24 20:38:19,869 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:38:19,869 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:38:19,869 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:38:19,869 INFO ]: Start difference. First operand 750 states and 1682 transitions. Second operand 5 states. [2018-06-24 20:38:21,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:21,357 INFO ]: Finished difference Result 1101 states and 3415 transitions. [2018-06-24 20:38:21,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:38:21,357 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-24 20:38:21,357 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:21,454 INFO ]: With dead ends: 1101 [2018-06-24 20:38:21,454 INFO ]: Without dead ends: 1101 [2018-06-24 20:38:21,454 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:38:21,455 INFO ]: Start minimizeSevpa. Operand 1101 states. [2018-06-24 20:38:21,684 INFO ]: Finished minimizeSevpa. Reduced states from 1101 to 750. [2018-06-24 20:38:21,685 INFO ]: Start removeUnreachable. Operand 750 states. [2018-06-24 20:38:21,751 INFO ]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1677 transitions. [2018-06-24 20:38:21,751 INFO ]: Start accepts. Automaton has 750 states and 1677 transitions. Word has length 9 [2018-06-24 20:38:21,751 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:21,751 INFO ]: Abstraction has 750 states and 1677 transitions. [2018-06-24 20:38:21,751 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:38:21,751 INFO ]: Start isEmpty. Operand 750 states and 1677 transitions. [2018-06-24 20:38:21,784 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:38:21,784 INFO ]: Found error trace [2018-06-24 20:38:21,784 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:21,784 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:21,785 INFO ]: Analyzing trace with hash 261926427, now seen corresponding path program 1 times [2018-06-24 20:38:21,785 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:21,785 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:21,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:21,785 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:21,785 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:21,810 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:22,150 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:22,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:38:22,150 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-24 20:38:22,159 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:22,198 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:22,205 INFO ]: Computing forward predicates... [2018-06-24 20:38:22,364 INFO ]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:22,399 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:38:22,399 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 20:38:22,399 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:38:22,399 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:38:22,399 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:38:22,399 INFO ]: Start difference. First operand 750 states and 1677 transitions. Second operand 10 states. [2018-06-24 20:38:30,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:30,768 INFO ]: Finished difference Result 1299 states and 4088 transitions. [2018-06-24 20:38:30,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:38:30,768 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-24 20:38:30,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:30,899 INFO ]: With dead ends: 1299 [2018-06-24 20:38:30,899 INFO ]: Without dead ends: 1287 [2018-06-24 20:38:30,899 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:38:30,902 INFO ]: Start minimizeSevpa. Operand 1287 states. [2018-06-24 20:38:31,231 INFO ]: Finished minimizeSevpa. Reduced states from 1287 to 991. [2018-06-24 20:38:31,231 INFO ]: Start removeUnreachable. Operand 991 states. [2018-06-24 20:38:31,267 INFO ]: Finished removeUnreachable. Reduced from 991 states to 991 states and 2389 transitions. [2018-06-24 20:38:31,267 INFO ]: Start accepts. Automaton has 991 states and 2389 transitions. Word has length 10 [2018-06-24 20:38:31,267 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:31,267 INFO ]: Abstraction has 991 states and 2389 transitions. [2018-06-24 20:38:31,267 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:38:31,267 INFO ]: Start isEmpty. Operand 991 states and 2389 transitions. [2018-06-24 20:38:31,308 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:38:31,308 INFO ]: Found error trace [2018-06-24 20:38:31,308 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:31,308 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:31,308 INFO ]: Analyzing trace with hash -985005437, now seen corresponding path program 1 times [2018-06-24 20:38:31,308 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:31,308 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:31,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:31,309 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:31,309 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:31,336 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:31,696 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:31,696 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:31,696 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:38:31,697 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:38:31,697 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:38:31,697 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:38:31,697 INFO ]: Start difference. First operand 991 states and 2389 transitions. Second operand 6 states. [2018-06-24 20:38:33,738 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:33,738 INFO ]: Finished difference Result 1845 states and 9122 transitions. [2018-06-24 20:38:33,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:38:33,738 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:38:33,739 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:33,931 INFO ]: With dead ends: 1845 [2018-06-24 20:38:33,931 INFO ]: Without dead ends: 1845 [2018-06-24 20:38:33,931 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:38:33,933 INFO ]: Start minimizeSevpa. Operand 1845 states. [2018-06-24 20:38:34,586 INFO ]: Finished minimizeSevpa. Reduced states from 1845 to 997. [2018-06-24 20:38:34,587 INFO ]: Start removeUnreachable. Operand 997 states. [2018-06-24 20:38:34,620 INFO ]: Finished removeUnreachable. Reduced from 997 states to 997 states and 2443 transitions. [2018-06-24 20:38:34,620 INFO ]: Start accepts. Automaton has 997 states and 2443 transitions. Word has length 10 [2018-06-24 20:38:34,620 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:34,620 INFO ]: Abstraction has 997 states and 2443 transitions. [2018-06-24 20:38:34,620 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:38:34,620 INFO ]: Start isEmpty. Operand 997 states and 2443 transitions. [2018-06-24 20:38:34,665 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:38:34,665 INFO ]: Found error trace [2018-06-24 20:38:34,665 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:34,665 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:34,665 INFO ]: Analyzing trace with hash -990993428, now seen corresponding path program 1 times [2018-06-24 20:38:34,665 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:34,665 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:34,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:34,666 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:34,666 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:34,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:35,064 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:35,064 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:35,064 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:38:35,065 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:38:35,065 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:38:35,065 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:38:35,065 INFO ]: Start difference. First operand 997 states and 2443 transitions. Second operand 6 states. [2018-06-24 20:38:39,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:39,052 INFO ]: Finished difference Result 3505 states and 17568 transitions. [2018-06-24 20:38:39,052 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:38:39,052 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:38:39,052 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:39,386 INFO ]: With dead ends: 3505 [2018-06-24 20:38:39,386 INFO ]: Without dead ends: 3505 [2018-06-24 20:38:39,386 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:38:39,388 INFO ]: Start minimizeSevpa. Operand 3505 states. [2018-06-24 20:38:40,684 INFO ]: Finished minimizeSevpa. Reduced states from 3505 to 1834. [2018-06-24 20:38:40,684 INFO ]: Start removeUnreachable. Operand 1834 states. [2018-06-24 20:38:40,775 INFO ]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 4575 transitions. [2018-06-24 20:38:40,775 INFO ]: Start accepts. Automaton has 1834 states and 4575 transitions. Word has length 10 [2018-06-24 20:38:40,775 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:40,775 INFO ]: Abstraction has 1834 states and 4575 transitions. [2018-06-24 20:38:40,775 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:38:40,775 INFO ]: Start isEmpty. Operand 1834 states and 4575 transitions. [2018-06-24 20:38:40,803 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:38:40,803 INFO ]: Found error trace [2018-06-24 20:38:40,803 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:40,803 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:40,803 INFO ]: Analyzing trace with hash -653304048, now seen corresponding path program 1 times [2018-06-24 20:38:40,803 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:40,803 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:40,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:40,804 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:40,804 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:40,818 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:41,251 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:41,252 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:41,309 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:38:41,310 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:38:41,310 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:38:41,310 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:38:41,310 INFO ]: Start difference. First operand 1834 states and 4575 transitions. Second operand 6 states. [2018-06-24 20:38:45,134 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:45,134 INFO ]: Finished difference Result 3707 states and 20259 transitions. [2018-06-24 20:38:45,135 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:38:45,135 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:38:45,135 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:45,577 INFO ]: With dead ends: 3707 [2018-06-24 20:38:45,577 INFO ]: Without dead ends: 3707 [2018-06-24 20:38:45,577 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:38:45,579 INFO ]: Start minimizeSevpa. Operand 3707 states. [2018-06-24 20:38:47,609 INFO ]: Finished minimizeSevpa. Reduced states from 3707 to 2208. [2018-06-24 20:38:47,609 INFO ]: Start removeUnreachable. Operand 2208 states. [2018-06-24 20:38:47,732 INFO ]: Finished removeUnreachable. Reduced from 2208 states to 2208 states and 6205 transitions. [2018-06-24 20:38:47,733 INFO ]: Start accepts. Automaton has 2208 states and 6205 transitions. Word has length 10 [2018-06-24 20:38:47,733 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:47,733 INFO ]: Abstraction has 2208 states and 6205 transitions. [2018-06-24 20:38:47,733 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:38:47,733 INFO ]: Start isEmpty. Operand 2208 states and 6205 transitions. [2018-06-24 20:38:47,769 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:38:47,770 INFO ]: Found error trace [2018-06-24 20:38:47,770 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:47,770 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:47,771 INFO ]: Analyzing trace with hash -653300204, now seen corresponding path program 1 times [2018-06-24 20:38:47,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:47,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:47,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:47,772 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:47,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:47,790 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:38:48,216 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:38:48,217 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:38:48,217 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-06-24 20:38:48,217 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:38:48,217 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:38:48,217 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:38:48,217 INFO ]: Start difference. First operand 2208 states and 6205 transitions. Second operand 6 states. [2018-06-24 20:38:53,612 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:38:53,612 INFO ]: Finished difference Result 3757 states and 23007 transitions. [2018-06-24 20:38:53,612 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:38:53,612 INFO ]: Start accepts. Automaton has 6 states. Word has length 10 [2018-06-24 20:38:53,612 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:38:54,158 INFO ]: With dead ends: 3757 [2018-06-24 20:38:54,158 INFO ]: Without dead ends: 3757 [2018-06-24 20:38:54,158 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:38:54,161 INFO ]: Start minimizeSevpa. Operand 3757 states. [2018-06-24 20:38:55,420 INFO ]: Finished minimizeSevpa. Reduced states from 3757 to 2572. [2018-06-24 20:38:55,420 INFO ]: Start removeUnreachable. Operand 2572 states. [2018-06-24 20:38:55,587 INFO ]: Finished removeUnreachable. Reduced from 2572 states to 2572 states and 8096 transitions. [2018-06-24 20:38:55,587 INFO ]: Start accepts. Automaton has 2572 states and 8096 transitions. Word has length 10 [2018-06-24 20:38:55,587 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:38:55,587 INFO ]: Abstraction has 2572 states and 8096 transitions. [2018-06-24 20:38:55,587 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:38:55,587 INFO ]: Start isEmpty. Operand 2572 states and 8096 transitions. [2018-06-24 20:38:55,621 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:38:55,621 INFO ]: Found error trace [2018-06-24 20:38:55,621 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:38:55,621 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:38:55,622 INFO ]: Analyzing trace with hash -1637189793, now seen corresponding path program 2 times [2018-06-24 20:38:55,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:38:55,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:38:55,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:55,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:38:55,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:38:55,642 INFO ]: Conjunction of SSA is sat [2018-06-24 20:38:55,646 INFO ]: Counterexample might be feasible [2018-06-24 20:38:55,659 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:38:55,661 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:38:55 BasicIcfg [2018-06-24 20:38:55,662 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:38:55,662 INFO ]: Toolchain (without parser) took 48030.78 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 255.7 MB in the beginning and 1.0 GB in the end (delta: -786.7 MB). Peak memory consumption was 381.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:38:55,664 INFO ]: SmtParser took 0.37 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:38:55,664 INFO ]: ChcToBoogie took 102.93 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:38:55,666 INFO ]: Boogie Preprocessor took 48.97 ms. Allocated memory is still 309.3 MB. Free memory is still 251.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:38:55,666 INFO ]: RCFGBuilder took 1234.02 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 201.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:38:55,667 INFO ]: BlockEncodingV2 took 568.23 ms. Allocated memory was 309.3 MB in the beginning and 327.2 MB in the end (delta: 17.8 MB). Free memory was 201.8 MB in the beginning and 278.1 MB in the end (delta: -76.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 3.6 GB. [2018-06-24 20:38:55,667 INFO ]: TraceAbstraction took 46068.39 ms. Allocated memory was 327.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 278.1 MB in the beginning and 1.0 GB in the end (delta: -764.3 MB). Peak memory consumption was 386.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:38:55,674 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 144 locations, 276 edges - StatisticsResult: Encoded RCFG 133 locations, 264 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.37 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 102.93 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 253.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 48.97 ms. Allocated memory is still 309.3 MB. Free memory is still 251.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 1234.02 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 201.8 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 568.23 ms. Allocated memory was 309.3 MB in the beginning and 327.2 MB in the end (delta: 17.8 MB). Free memory was 201.8 MB in the beginning and 278.1 MB in the end (delta: -76.3 MB). Peak memory consumption was 21.1 MB. Max. memory is 3.6 GB. * TraceAbstraction took 46068.39 ms. Allocated memory was 327.2 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 278.1 MB in the beginning and 1.0 GB in the end (delta: -764.3 MB). Peak memory consumption was 386.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [UNKNOWN] : assertion can be violated assertion can be violated We found a FailurePath: [L0] CALL call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assume true; [L0] CALL call gotoProc(4, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int); [L0] COND TRUE gotoSwitch == 4 [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int := gpav_0_Int, gpav_1_Int, gpav_2_Int, gpav_3_Int, gpav_4_Int, gpav_5_Int, gpav_6_Int, gpav_7_Int, gpav_8_Int; [L0] assume true; [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int := hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_5_Int, hhv_step_lturn_8_Int; [L0] assume true; [L0] hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_5_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_8_Int := hhv_step_lturn_0_Int, hhv_step_lturn_1_Int, hhv_step_lturn_2_Int, hhv_step_lturn_3_Int, hhv_step_lturn_4_Int, hhv_step_lturn_6_Int, hhv_step_lturn_7_Int, hhv_step_lturn_5_Int, hhv_step_lturn_8_Int; [L0] RET call gotoProc(4, hbv_False_1_Int, hbv_False_2_Int, hbv_False_3_Int, hbv_False_4_Int, hbv_False_5_Int, hbv_False_6_Int, hbv_False_7_Int, hbv_False_8_Int, hbv_False_9_Int); [L0] RET call gotoProc(0, 0, 0, 0, 0, 0, 0, 0, 0, 0); [L0] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 133 locations, 1 error locations. UNSAFE Result, 46.0s OverallTime, 12 OverallIterations, 2 TraceHistogramMax, 34.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7586 SDtfs, 1163 SDslu, 15859 SDs, 0 SdLazy, 15455 SolverSat, 2632 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2572occurred in iteration=11, 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: 7.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 6335 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1931 SizeOfPredicates, 10 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 12 InterpolantComputations, 10 PerfectInterpolantSequences, 18/20 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/slow-hull.56.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-38-55-689.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/slow-hull.56.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-38-55-689.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/slow-hull.56.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-38-55-689.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/slow-hull.56.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-38-55-689.csv Received shutdown request...