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/hopv/lia/mochi/inc4.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 18:23:24,028 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 18:23:24,030 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 18:23:24,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 18:23:24,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 18:23:24,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 18:23:24,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 18:23:24,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 18:23:24,046 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 18:23:24,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 18:23:24,048 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 18:23:24,048 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 18:23:24,049 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 18:23:24,050 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 18:23:24,051 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 18:23:24,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 18:23:24,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 18:23:24,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 18:23:24,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 18:23:24,066 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 18:23:24,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 18:23:24,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 18:23:24,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 18:23:24,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 18:23:24,071 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 18:23:24,078 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 18:23:24,079 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 18:23:24,079 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 18:23:24,080 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 18:23:24,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 18:23:24,081 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 18:23:24,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 18:23:24,082 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 18:23:24,082 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 18:23:24,087 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 18:23:24,088 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 18:23:24,088 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 18:23:24,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 18:23:24,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 18:23:24,103 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 18:23:24,103 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 18:23:24,104 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 18:23:24,105 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 18:23:24,105 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 18:23:24,105 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 18:23:24,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 18:23:24,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 18:23:24,106 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 18:23:24,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 18:23:24,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 18:23:24,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 18:23:24,106 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 18:23:24,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 18:23:24,107 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 18:23:24,107 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 18:23:24,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 18:23:24,107 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 18:23:24,108 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 18:23:24,109 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 18:23:24,109 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 18:23:24,156 INFO ]: Repository-Root is: /tmp [2018-06-26 18:23:24,176 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 18:23:24,181 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 18:23:24,183 INFO ]: Initializing SmtParser... [2018-06-26 18:23:24,183 INFO ]: SmtParser initialized [2018-06-26 18:23:24,183 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/hopv/lia/mochi/inc4.smt2 [2018-06-26 18:23:24,185 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-26 18:23:24,270 INFO ]: Executing SMT file /storage/chc-comp/hopv/lia/mochi/inc4.smt2 unknown [2018-06-26 18:23:24,589 INFO ]: Succesfully executed SMT file /storage/chc-comp/hopv/lia/mochi/inc4.smt2 [2018-06-26 18:23:24,594 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 18:23:24,603 INFO ]: Walking toolchain with 5 elements. [2018-06-26 18:23:24,604 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 18:23:24,604 INFO ]: Initializing ChcToBoogie... [2018-06-26 18:23:24,604 INFO ]: ChcToBoogie initialized [2018-06-26 18:23:24,607 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,670 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24 Unit [2018-06-26 18:23:24,670 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 18:23:24,671 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 18:23:24,671 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 18:23:24,671 INFO ]: Boogie Preprocessor initialized [2018-06-26 18:23:24,695 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,695 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,703 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,704 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,721 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,733 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,735 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (1/1) ... [2018-06-26 18:23:24,737 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 18:23:24,738 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 18:23:24,738 INFO ]: Initializing RCFGBuilder... [2018-06-26 18:23:24,738 INFO ]: RCFGBuilder initialized [2018-06-26 18:23:24,739 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (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-26 18:23:24,764 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 18:23:24,764 INFO ]: Found specification of procedure gotoProc [2018-06-26 18:23:24,764 INFO ]: Found implementation of procedure gotoProc [2018-06-26 18:23:24,764 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 18:23:24,764 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 18:23:24,764 INFO ]: Found implementation of procedure Ultimate.START [2018-06-26 18:23:25,302 INFO ]: Using library mode [2018-06-26 18:23:25,303 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:23:25 BoogieIcfgContainer [2018-06-26 18:23:25,303 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 18:23:25,303 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 18:23:25,303 INFO ]: Initializing BlockEncodingV2... [2018-06-26 18:23:25,304 INFO ]: BlockEncodingV2 initialized [2018-06-26 18:23:25,305 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:23:25" (1/1) ... [2018-06-26 18:23:25,330 INFO ]: Initial Icfg 70 locations, 110 edges [2018-06-26 18:23:25,331 INFO ]: Using Remove infeasible edges [2018-06-26 18:23:25,332 INFO ]: Using Maximize final states [2018-06-26 18:23:25,332 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 18:23:25,333 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 18:23:25,334 INFO ]: Using Remove sink states [2018-06-26 18:23:25,337 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 18:23:25,337 INFO ]: Using Use SBE [2018-06-26 18:23:25,375 INFO ]: SBE split 1 edges [2018-06-26 18:23:25,380 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-26 18:23:25,381 INFO ]: 0 new accepting states [2018-06-26 18:23:25,924 INFO ]: Removed 78 edges and 25 locations by large block encoding [2018-06-26 18:23:25,926 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:23:25,928 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-26 18:23:25,929 INFO ]: 0 new accepting states [2018-06-26 18:23:25,929 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:23:25,930 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:23:25,930 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 18:23:25,931 INFO ]: 0 new accepting states [2018-06-26 18:23:25,931 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 18:23:25,932 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 18:23:25,933 INFO ]: Encoded RCFG 43 locations, 84 edges [2018-06-26 18:23:25,933 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:23:25 BasicIcfg [2018-06-26 18:23:25,933 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 18:23:25,935 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 18:23:25,935 INFO ]: Initializing TraceAbstraction... [2018-06-26 18:23:25,937 INFO ]: TraceAbstraction initialized [2018-06-26 18:23:25,938 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 06:23:24" (1/4) ... [2018-06-26 18:23:25,938 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13352789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 06:23:25, skipping insertion in model container [2018-06-26 18:23:25,938 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 06:23:24" (2/4) ... [2018-06-26 18:23:25,939 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13352789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 06:23:25, skipping insertion in model container [2018-06-26 18:23:25,939 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 06:23:25" (3/4) ... [2018-06-26 18:23:25,939 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13352789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:23:25, skipping insertion in model container [2018-06-26 18:23:25,939 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 06:23:25" (4/4) ... [2018-06-26 18:23:25,941 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 18:23:25,949 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 18:23:25,954 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 18:23:25,999 INFO ]: Using default assertion order modulation [2018-06-26 18:23:26,000 INFO ]: Interprodecural is true [2018-06-26 18:23:26,000 INFO ]: Hoare is false [2018-06-26 18:23:26,000 INFO ]: Compute interpolants for FPandBP [2018-06-26 18:23:26,000 INFO ]: Backedges is TWOTRACK [2018-06-26 18:23:26,000 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 18:23:26,000 INFO ]: Difference is false [2018-06-26 18:23:26,000 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 18:23:26,000 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 18:23:26,013 INFO ]: Start isEmpty. Operand 43 states. [2018-06-26 18:23:26,033 INFO ]: Finished isEmpty. Found accepting run of length 5 [2018-06-26 18:23:26,034 INFO ]: Found error trace [2018-06-26 18:23:26,035 INFO ]: trace histogram [1, 1, 1, 1] [2018-06-26 18:23:26,035 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:26,039 INFO ]: Analyzing trace with hash 2781946, now seen corresponding path program 1 times [2018-06-26 18:23:26,040 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:26,040 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:26,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:26,074 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:26,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:26,111 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:26,175 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:23:26,177 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:23:26,177 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:23:26,178 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:26,192 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:26,192 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:26,195 INFO ]: Start difference. First operand 43 states. Second operand 3 states. [2018-06-26 18:23:27,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:27,323 INFO ]: Finished difference Result 60 states and 116 transitions. [2018-06-26 18:23:27,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:27,326 INFO ]: Start accepts. Automaton has 3 states. Word has length 4 [2018-06-26 18:23:27,326 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:27,352 INFO ]: With dead ends: 60 [2018-06-26 18:23:27,352 INFO ]: Without dead ends: 60 [2018-06-26 18:23:27,353 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-26 18:23:27,374 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 18:23:27,429 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-06-26 18:23:27,430 INFO ]: Start removeUnreachable. Operand 60 states. [2018-06-26 18:23:27,441 INFO ]: Finished removeUnreachable. Reduced from 60 states to 60 states and 116 transitions. [2018-06-26 18:23:27,442 INFO ]: Start accepts. Automaton has 60 states and 116 transitions. Word has length 4 [2018-06-26 18:23:27,443 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:27,443 INFO ]: Abstraction has 60 states and 116 transitions. [2018-06-26 18:23:27,443 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:27,443 INFO ]: Start isEmpty. Operand 60 states and 116 transitions. [2018-06-26 18:23:27,448 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:23:27,448 INFO ]: Found error trace [2018-06-26 18:23:27,451 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:23:27,451 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:27,451 INFO ]: Analyzing trace with hash 87149097, now seen corresponding path program 1 times [2018-06-26 18:23:27,451 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:27,451 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:27,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:27,452 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:27,452 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:27,464 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:27,551 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:23:27,552 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:23:27,552 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:23:27,553 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:27,553 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:27,553 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:27,553 INFO ]: Start difference. First operand 60 states and 116 transitions. Second operand 3 states. [2018-06-26 18:23:28,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:28,214 INFO ]: Finished difference Result 75 states and 154 transitions. [2018-06-26 18:23:28,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:28,215 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:23:28,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:28,221 INFO ]: With dead ends: 75 [2018-06-26 18:23:28,221 INFO ]: Without dead ends: 75 [2018-06-26 18:23:28,222 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-26 18:23:28,222 INFO ]: Start minimizeSevpa. Operand 75 states. [2018-06-26 18:23:28,241 INFO ]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-06-26 18:23:28,242 INFO ]: Start removeUnreachable. Operand 75 states. [2018-06-26 18:23:28,248 INFO ]: Finished removeUnreachable. Reduced from 75 states to 75 states and 154 transitions. [2018-06-26 18:23:28,249 INFO ]: Start accepts. Automaton has 75 states and 154 transitions. Word has length 5 [2018-06-26 18:23:28,249 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:28,249 INFO ]: Abstraction has 75 states and 154 transitions. [2018-06-26 18:23:28,249 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:28,249 INFO ]: Start isEmpty. Operand 75 states and 154 transitions. [2018-06-26 18:23:28,252 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:23:28,252 INFO ]: Found error trace [2018-06-26 18:23:28,252 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:23:28,252 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:28,252 INFO ]: Analyzing trace with hash 87238470, now seen corresponding path program 1 times [2018-06-26 18:23:28,252 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:28,252 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:28,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,253 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:28,253 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,278 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:28,307 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:23:28,307 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:23:28,308 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:23:28,308 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:28,308 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:28,308 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:28,308 INFO ]: Start difference. First operand 75 states and 154 transitions. Second operand 3 states. [2018-06-26 18:23:28,334 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:28,335 INFO ]: Finished difference Result 114 states and 220 transitions. [2018-06-26 18:23:28,336 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:28,336 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:23:28,336 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:28,343 INFO ]: With dead ends: 114 [2018-06-26 18:23:28,343 INFO ]: Without dead ends: 114 [2018-06-26 18:23:28,343 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-26 18:23:28,348 INFO ]: Start minimizeSevpa. Operand 114 states. [2018-06-26 18:23:28,376 INFO ]: Finished minimizeSevpa. Reduced states from 114 to 78. [2018-06-26 18:23:28,376 INFO ]: Start removeUnreachable. Operand 78 states. [2018-06-26 18:23:28,382 INFO ]: Finished removeUnreachable. Reduced from 78 states to 78 states and 160 transitions. [2018-06-26 18:23:28,382 INFO ]: Start accepts. Automaton has 78 states and 160 transitions. Word has length 5 [2018-06-26 18:23:28,382 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:28,382 INFO ]: Abstraction has 78 states and 160 transitions. [2018-06-26 18:23:28,382 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:28,382 INFO ]: Start isEmpty. Operand 78 states and 160 transitions. [2018-06-26 18:23:28,384 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 18:23:28,384 INFO ]: Found error trace [2018-06-26 18:23:28,385 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 18:23:28,385 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:28,390 INFO ]: Analyzing trace with hash 87268261, now seen corresponding path program 1 times [2018-06-26 18:23:28,390 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:28,390 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:28,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,390 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:28,390 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,414 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:28,507 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 18:23:28,508 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:23:28,508 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:23:28,508 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:28,508 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:28,508 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:28,508 INFO ]: Start difference. First operand 78 states and 160 transitions. Second operand 3 states. [2018-06-26 18:23:28,588 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:28,588 INFO ]: Finished difference Result 111 states and 214 transitions. [2018-06-26 18:23:28,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:28,589 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 18:23:28,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:28,592 INFO ]: With dead ends: 111 [2018-06-26 18:23:28,592 INFO ]: Without dead ends: 111 [2018-06-26 18:23:28,592 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-26 18:23:28,592 INFO ]: Start minimizeSevpa. Operand 111 states. [2018-06-26 18:23:28,606 INFO ]: Finished minimizeSevpa. Reduced states from 111 to 81. [2018-06-26 18:23:28,606 INFO ]: Start removeUnreachable. Operand 81 states. [2018-06-26 18:23:28,608 INFO ]: Finished removeUnreachable. Reduced from 81 states to 81 states and 163 transitions. [2018-06-26 18:23:28,608 INFO ]: Start accepts. Automaton has 81 states and 163 transitions. Word has length 5 [2018-06-26 18:23:28,608 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:28,608 INFO ]: Abstraction has 81 states and 163 transitions. [2018-06-26 18:23:28,608 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:28,608 INFO ]: Start isEmpty. Operand 81 states and 163 transitions. [2018-06-26 18:23:28,616 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:23:28,616 INFO ]: Found error trace [2018-06-26 18:23:28,616 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:28,616 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:28,616 INFO ]: Analyzing trace with hash 472052836, now seen corresponding path program 1 times [2018-06-26 18:23:28,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:28,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:28,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:28,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,641 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:28,684 INFO ]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:23:28,684 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 18:23:28,684 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 18:23:28,685 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:28,685 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:28,685 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:28,685 INFO ]: Start difference. First operand 81 states and 163 transitions. Second operand 3 states. [2018-06-26 18:23:28,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:28,948 INFO ]: Finished difference Result 98 states and 180 transitions. [2018-06-26 18:23:28,949 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:28,949 INFO ]: Start accepts. Automaton has 3 states. Word has length 16 [2018-06-26 18:23:28,949 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:28,952 INFO ]: With dead ends: 98 [2018-06-26 18:23:28,952 INFO ]: Without dead ends: 98 [2018-06-26 18:23:28,952 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-26 18:23:28,952 INFO ]: Start minimizeSevpa. Operand 98 states. [2018-06-26 18:23:28,962 INFO ]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-06-26 18:23:28,962 INFO ]: Start removeUnreachable. Operand 98 states. [2018-06-26 18:23:28,965 INFO ]: Finished removeUnreachable. Reduced from 98 states to 98 states and 180 transitions. [2018-06-26 18:23:28,965 INFO ]: Start accepts. Automaton has 98 states and 180 transitions. Word has length 16 [2018-06-26 18:23:28,965 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:28,965 INFO ]: Abstraction has 98 states and 180 transitions. [2018-06-26 18:23:28,965 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:28,965 INFO ]: Start isEmpty. Operand 98 states and 180 transitions. [2018-06-26 18:23:28,971 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 18:23:28,971 INFO ]: Found error trace [2018-06-26 18:23:28,971 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:28,971 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:28,972 INFO ]: Analyzing trace with hash 1217005408, now seen corresponding path program 1 times [2018-06-26 18:23:28,972 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:28,972 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:28,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,972 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:28,972 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:28,999 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:29,253 INFO ]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:23:29,253 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:29,253 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-26 18:23:29,276 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:29,343 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:29,355 INFO ]: Computing forward predicates... [2018-06-26 18:23:29,468 INFO ]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 18:23:29,491 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:29,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 7 [2018-06-26 18:23:29,492 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:23:29,492 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:23:29,492 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:23:29,492 INFO ]: Start difference. First operand 98 states and 180 transitions. Second operand 7 states. [2018-06-26 18:23:29,795 WARN ]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-26 18:23:32,231 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:32,231 INFO ]: Finished difference Result 227 states and 471 transitions. [2018-06-26 18:23:32,231 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 18:23:32,231 INFO ]: Start accepts. Automaton has 7 states. Word has length 16 [2018-06-26 18:23:32,231 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:32,244 INFO ]: With dead ends: 227 [2018-06-26 18:23:32,245 INFO ]: Without dead ends: 213 [2018-06-26 18:23:32,245 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:23:32,245 INFO ]: Start minimizeSevpa. Operand 213 states. [2018-06-26 18:23:32,282 INFO ]: Finished minimizeSevpa. Reduced states from 213 to 141. [2018-06-26 18:23:32,282 INFO ]: Start removeUnreachable. Operand 141 states. [2018-06-26 18:23:32,288 INFO ]: Finished removeUnreachable. Reduced from 141 states to 141 states and 297 transitions. [2018-06-26 18:23:32,288 INFO ]: Start accepts. Automaton has 141 states and 297 transitions. Word has length 16 [2018-06-26 18:23:32,288 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:32,288 INFO ]: Abstraction has 141 states and 297 transitions. [2018-06-26 18:23:32,288 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:23:32,288 INFO ]: Start isEmpty. Operand 141 states and 297 transitions. [2018-06-26 18:23:32,298 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 18:23:32,298 INFO ]: Found error trace [2018-06-26 18:23:32,298 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:32,298 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:32,298 INFO ]: Analyzing trace with hash -799406053, now seen corresponding path program 1 times [2018-06-26 18:23:32,298 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:32,298 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:32,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:32,299 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:32,299 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:32,323 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:32,403 INFO ]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-26 18:23:32,403 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:32,403 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) [2018-06-26 18:23:32,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:32,463 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:32,466 INFO ]: Computing forward predicates... [2018-06-26 18:23:32,471 INFO ]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 18:23:32,496 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:23:32,497 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-26 18:23:32,497 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:32,497 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:32,497 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:32,497 INFO ]: Start difference. First operand 141 states and 297 transitions. Second operand 3 states. [2018-06-26 18:23:32,964 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:32,964 INFO ]: Finished difference Result 165 states and 336 transitions. [2018-06-26 18:23:32,964 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:32,964 INFO ]: Start accepts. Automaton has 3 states. Word has length 19 [2018-06-26 18:23:32,965 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:32,971 INFO ]: With dead ends: 165 [2018-06-26 18:23:32,971 INFO ]: Without dead ends: 165 [2018-06-26 18:23:32,971 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 20 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-26 18:23:32,971 INFO ]: Start minimizeSevpa. Operand 165 states. [2018-06-26 18:23:32,992 INFO ]: Finished minimizeSevpa. Reduced states from 165 to 160. [2018-06-26 18:23:32,992 INFO ]: Start removeUnreachable. Operand 160 states. [2018-06-26 18:23:32,997 INFO ]: Finished removeUnreachable. Reduced from 160 states to 160 states and 326 transitions. [2018-06-26 18:23:32,997 INFO ]: Start accepts. Automaton has 160 states and 326 transitions. Word has length 19 [2018-06-26 18:23:32,997 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:32,997 INFO ]: Abstraction has 160 states and 326 transitions. [2018-06-26 18:23:32,997 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:32,998 INFO ]: Start isEmpty. Operand 160 states and 326 transitions. [2018-06-26 18:23:33,013 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 18:23:33,014 INFO ]: Found error trace [2018-06-26 18:23:33,014 INFO ]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:33,014 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:33,014 INFO ]: Analyzing trace with hash -1863438718, now seen corresponding path program 1 times [2018-06-26 18:23:33,014 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:33,014 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:33,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:33,015 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:33,015 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:33,069 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:33,134 INFO ]: Checked inductivity of 43 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-06-26 18:23:33,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:33,134 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-26 18:23:33,140 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:33,198 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:33,201 INFO ]: Computing forward predicates... [2018-06-26 18:23:33,366 INFO ]: Checked inductivity of 43 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-26 18:23:33,392 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:33,392 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-06-26 18:23:33,392 INFO ]: Interpolant automaton has 10 states [2018-06-26 18:23:33,392 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 18:23:33,392 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-26 18:23:33,393 INFO ]: Start difference. First operand 160 states and 326 transitions. Second operand 10 states. [2018-06-26 18:23:34,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:34,392 INFO ]: Finished difference Result 379 states and 869 transitions. [2018-06-26 18:23:34,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 18:23:34,392 INFO ]: Start accepts. Automaton has 10 states. Word has length 30 [2018-06-26 18:23:34,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:34,405 INFO ]: With dead ends: 379 [2018-06-26 18:23:34,405 INFO ]: Without dead ends: 379 [2018-06-26 18:23:34,405 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-06-26 18:23:34,406 INFO ]: Start minimizeSevpa. Operand 379 states. [2018-06-26 18:23:34,464 INFO ]: Finished minimizeSevpa. Reduced states from 379 to 209. [2018-06-26 18:23:34,465 INFO ]: Start removeUnreachable. Operand 209 states. [2018-06-26 18:23:34,472 INFO ]: Finished removeUnreachable. Reduced from 209 states to 209 states and 448 transitions. [2018-06-26 18:23:34,473 INFO ]: Start accepts. Automaton has 209 states and 448 transitions. Word has length 30 [2018-06-26 18:23:34,473 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:34,473 INFO ]: Abstraction has 209 states and 448 transitions. [2018-06-26 18:23:34,473 INFO ]: Interpolant automaton has 10 states. [2018-06-26 18:23:34,473 INFO ]: Start isEmpty. Operand 209 states and 448 transitions. [2018-06-26 18:23:34,489 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 18:23:34,489 INFO ]: Found error trace [2018-06-26 18:23:34,489 INFO ]: trace histogram [6, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:34,489 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:34,489 INFO ]: Analyzing trace with hash -497597904, now seen corresponding path program 1 times [2018-06-26 18:23:34,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:34,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:34,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:34,490 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:34,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:34,509 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:34,675 INFO ]: Checked inductivity of 80 backedges. 21 proven. 16 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-06-26 18:23:34,676 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:34,676 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-26 18:23:34,693 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:34,763 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:34,767 INFO ]: Computing forward predicates... [2018-06-26 18:23:34,892 INFO ]: Checked inductivity of 80 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-06-26 18:23:34,921 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:23:34,921 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-06-26 18:23:34,922 INFO ]: Interpolant automaton has 6 states [2018-06-26 18:23:34,922 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 18:23:34,922 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-26 18:23:34,922 INFO ]: Start difference. First operand 209 states and 448 transitions. Second operand 6 states. [2018-06-26 18:23:35,415 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:35,415 INFO ]: Finished difference Result 339 states and 702 transitions. [2018-06-26 18:23:35,415 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 18:23:35,415 INFO ]: Start accepts. Automaton has 6 states. Word has length 39 [2018-06-26 18:23:35,415 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:35,425 INFO ]: With dead ends: 339 [2018-06-26 18:23:35,425 INFO ]: Without dead ends: 339 [2018-06-26 18:23:35,425 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:23:35,426 INFO ]: Start minimizeSevpa. Operand 339 states. [2018-06-26 18:23:35,457 INFO ]: Finished minimizeSevpa. Reduced states from 339 to 228. [2018-06-26 18:23:35,457 INFO ]: Start removeUnreachable. Operand 228 states. [2018-06-26 18:23:35,461 INFO ]: Finished removeUnreachable. Reduced from 228 states to 228 states and 468 transitions. [2018-06-26 18:23:35,461 INFO ]: Start accepts. Automaton has 228 states and 468 transitions. Word has length 39 [2018-06-26 18:23:35,462 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:35,462 INFO ]: Abstraction has 228 states and 468 transitions. [2018-06-26 18:23:35,462 INFO ]: Interpolant automaton has 6 states. [2018-06-26 18:23:35,462 INFO ]: Start isEmpty. Operand 228 states and 468 transitions. [2018-06-26 18:23:35,477 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 18:23:35,477 INFO ]: Found error trace [2018-06-26 18:23:35,477 INFO ]: trace histogram [6, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:35,477 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:35,477 INFO ]: Analyzing trace with hash 1575894676, now seen corresponding path program 1 times [2018-06-26 18:23:35,477 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:35,477 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:35,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:35,478 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:35,478 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:35,538 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:35,707 INFO ]: Checked inductivity of 86 backedges. 29 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-06-26 18:23:35,707 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:35,707 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-26 18:23:35,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:35,787 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:35,793 INFO ]: Computing forward predicates... [2018-06-26 18:23:36,178 INFO ]: Checked inductivity of 86 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-06-26 18:23:36,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:36,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-06-26 18:23:36,198 INFO ]: Interpolant automaton has 12 states [2018-06-26 18:23:36,198 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 18:23:36,198 INFO ]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-06-26 18:23:36,198 INFO ]: Start difference. First operand 228 states and 468 transitions. Second operand 12 states. [2018-06-26 18:23:40,183 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:40,184 INFO ]: Finished difference Result 742 states and 1983 transitions. [2018-06-26 18:23:40,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 18:23:40,184 INFO ]: Start accepts. Automaton has 12 states. Word has length 41 [2018-06-26 18:23:40,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:40,221 INFO ]: With dead ends: 742 [2018-06-26 18:23:40,221 INFO ]: Without dead ends: 742 [2018-06-26 18:23:40,222 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 18:23:40,222 INFO ]: Start minimizeSevpa. Operand 742 states. [2018-06-26 18:23:40,322 INFO ]: Finished minimizeSevpa. Reduced states from 742 to 381. [2018-06-26 18:23:40,322 INFO ]: Start removeUnreachable. Operand 381 states. [2018-06-26 18:23:40,339 INFO ]: Finished removeUnreachable. Reduced from 381 states to 381 states and 822 transitions. [2018-06-26 18:23:40,339 INFO ]: Start accepts. Automaton has 381 states and 822 transitions. Word has length 41 [2018-06-26 18:23:40,339 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:40,339 INFO ]: Abstraction has 381 states and 822 transitions. [2018-06-26 18:23:40,339 INFO ]: Interpolant automaton has 12 states. [2018-06-26 18:23:40,339 INFO ]: Start isEmpty. Operand 381 states and 822 transitions. [2018-06-26 18:23:40,380 INFO ]: Finished isEmpty. Found accepting run of length 51 [2018-06-26 18:23:40,380 INFO ]: Found error trace [2018-06-26 18:23:40,380 INFO ]: trace histogram [7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:40,380 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:40,383 INFO ]: Analyzing trace with hash -1730148623, now seen corresponding path program 1 times [2018-06-26 18:23:40,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:40,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:40,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:40,384 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:40,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:40,416 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:40,516 INFO ]: Checked inductivity of 132 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-06-26 18:23:40,517 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:40,517 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:23:40,526 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:40,612 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:40,617 INFO ]: Computing forward predicates... [2018-06-26 18:23:40,921 INFO ]: Checked inductivity of 132 backedges. 70 proven. 5 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-06-26 18:23:40,940 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:40,940 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8] total 9 [2018-06-26 18:23:40,940 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:23:40,940 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:23:40,940 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:23:40,941 INFO ]: Start difference. First operand 381 states and 822 transitions. Second operand 9 states. [2018-06-26 18:23:41,819 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:41,819 INFO ]: Finished difference Result 703 states and 2234 transitions. [2018-06-26 18:23:41,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 18:23:41,819 INFO ]: Start accepts. Automaton has 9 states. Word has length 50 [2018-06-26 18:23:41,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:41,868 INFO ]: With dead ends: 703 [2018-06-26 18:23:41,868 INFO ]: Without dead ends: 703 [2018-06-26 18:23:41,868 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-06-26 18:23:41,869 INFO ]: Start minimizeSevpa. Operand 703 states. [2018-06-26 18:23:42,001 INFO ]: Finished minimizeSevpa. Reduced states from 703 to 479. [2018-06-26 18:23:42,001 INFO ]: Start removeUnreachable. Operand 479 states. [2018-06-26 18:23:42,012 INFO ]: Finished removeUnreachable. Reduced from 479 states to 479 states and 1202 transitions. [2018-06-26 18:23:42,012 INFO ]: Start accepts. Automaton has 479 states and 1202 transitions. Word has length 50 [2018-06-26 18:23:42,012 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:42,012 INFO ]: Abstraction has 479 states and 1202 transitions. [2018-06-26 18:23:42,012 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:23:42,012 INFO ]: Start isEmpty. Operand 479 states and 1202 transitions. [2018-06-26 18:23:42,038 INFO ]: Finished isEmpty. Found accepting run of length 59 [2018-06-26 18:23:42,038 INFO ]: Found error trace [2018-06-26 18:23:42,038 INFO ]: trace histogram [8, 5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:42,038 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:42,039 INFO ]: Analyzing trace with hash -1400092484, now seen corresponding path program 1 times [2018-06-26 18:23:42,039 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:42,039 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:42,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:42,041 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:42,041 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:42,068 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:42,169 INFO ]: Checked inductivity of 187 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-06-26 18:23:42,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:42,169 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) [2018-06-26 18:23:42,181 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:42,270 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:42,275 INFO ]: Computing forward predicates... [2018-06-26 18:23:42,482 INFO ]: Checked inductivity of 187 backedges. 86 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-06-26 18:23:42,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:42,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8] total 9 [2018-06-26 18:23:42,502 INFO ]: Interpolant automaton has 9 states [2018-06-26 18:23:42,502 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 18:23:42,502 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 18:23:42,502 INFO ]: Start difference. First operand 479 states and 1202 transitions. Second operand 9 states. [2018-06-26 18:23:47,040 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:47,040 INFO ]: Finished difference Result 828 states and 2743 transitions. [2018-06-26 18:23:47,040 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 18:23:47,040 INFO ]: Start accepts. Automaton has 9 states. Word has length 58 [2018-06-26 18:23:47,040 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:47,085 INFO ]: With dead ends: 828 [2018-06-26 18:23:47,085 INFO ]: Without dead ends: 828 [2018-06-26 18:23:47,085 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-06-26 18:23:47,086 INFO ]: Start minimizeSevpa. Operand 828 states. [2018-06-26 18:23:47,226 INFO ]: Finished minimizeSevpa. Reduced states from 828 to 511. [2018-06-26 18:23:47,226 INFO ]: Start removeUnreachable. Operand 511 states. [2018-06-26 18:23:47,237 INFO ]: Finished removeUnreachable. Reduced from 511 states to 511 states and 1281 transitions. [2018-06-26 18:23:47,237 INFO ]: Start accepts. Automaton has 511 states and 1281 transitions. Word has length 58 [2018-06-26 18:23:47,237 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:47,237 INFO ]: Abstraction has 511 states and 1281 transitions. [2018-06-26 18:23:47,238 INFO ]: Interpolant automaton has 9 states. [2018-06-26 18:23:47,238 INFO ]: Start isEmpty. Operand 511 states and 1281 transitions. [2018-06-26 18:23:47,268 INFO ]: Finished isEmpty. Found accepting run of length 89 [2018-06-26 18:23:47,268 INFO ]: Found error trace [2018-06-26 18:23:47,269 INFO ]: trace histogram [12, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:47,269 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:47,269 INFO ]: Analyzing trace with hash 1130841098, now seen corresponding path program 1 times [2018-06-26 18:23:47,269 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:47,269 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:47,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:47,270 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:47,270 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:47,289 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:47,405 INFO ]: Checked inductivity of 449 backedges. 99 proven. 48 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-06-26 18:23:47,405 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:47,405 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-26 18:23:47,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:47,549 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:47,555 INFO ]: Computing forward predicates... [2018-06-26 18:23:47,770 INFO ]: Checked inductivity of 449 backedges. 173 proven. 23 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-06-26 18:23:47,790 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:47,790 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6] total 7 [2018-06-26 18:23:47,790 INFO ]: Interpolant automaton has 7 states [2018-06-26 18:23:47,790 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 18:23:47,790 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 18:23:47,790 INFO ]: Start difference. First operand 511 states and 1281 transitions. Second operand 7 states. [2018-06-26 18:23:48,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:48,425 INFO ]: Finished difference Result 764 states and 2094 transitions. [2018-06-26 18:23:48,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 18:23:48,425 INFO ]: Start accepts. Automaton has 7 states. Word has length 88 [2018-06-26 18:23:48,425 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:48,445 INFO ]: With dead ends: 764 [2018-06-26 18:23:48,445 INFO ]: Without dead ends: 764 [2018-06-26 18:23:48,445 INFO ]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-06-26 18:23:48,445 INFO ]: Start minimizeSevpa. Operand 764 states. [2018-06-26 18:23:48,530 INFO ]: Finished minimizeSevpa. Reduced states from 764 to 569. [2018-06-26 18:23:48,530 INFO ]: Start removeUnreachable. Operand 569 states. [2018-06-26 18:23:48,542 INFO ]: Finished removeUnreachable. Reduced from 569 states to 569 states and 1452 transitions. [2018-06-26 18:23:48,542 INFO ]: Start accepts. Automaton has 569 states and 1452 transitions. Word has length 88 [2018-06-26 18:23:48,542 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:48,542 INFO ]: Abstraction has 569 states and 1452 transitions. [2018-06-26 18:23:48,542 INFO ]: Interpolant automaton has 7 states. [2018-06-26 18:23:48,542 INFO ]: Start isEmpty. Operand 569 states and 1452 transitions. [2018-06-26 18:23:48,560 INFO ]: Finished isEmpty. Found accepting run of length 101 [2018-06-26 18:23:48,560 INFO ]: Found error trace [2018-06-26 18:23:48,560 INFO ]: trace histogram [15, 6, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:48,560 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:48,560 INFO ]: Analyzing trace with hash -442760827, now seen corresponding path program 1 times [2018-06-26 18:23:48,560 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:48,560 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:48,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:48,561 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:48,561 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:48,575 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:48,681 INFO ]: Checked inductivity of 596 backedges. 107 proven. 54 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-06-26 18:23:48,681 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:48,681 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:23:48,697 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:48,880 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:48,886 INFO ]: Computing forward predicates... [2018-06-26 18:23:48,912 INFO ]: Checked inductivity of 596 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-06-26 18:23:48,945 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:23:48,945 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-26 18:23:48,945 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:48,945 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:48,945 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:48,945 INFO ]: Start difference. First operand 569 states and 1452 transitions. Second operand 3 states. [2018-06-26 18:23:49,400 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:49,400 INFO ]: Finished difference Result 595 states and 1517 transitions. [2018-06-26 18:23:49,401 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:49,401 INFO ]: Start accepts. Automaton has 3 states. Word has length 100 [2018-06-26 18:23:49,401 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:49,414 INFO ]: With dead ends: 595 [2018-06-26 18:23:49,414 INFO ]: Without dead ends: 595 [2018-06-26 18:23:49,414 INFO ]: 0 DeclaredPredicates, 102 GetRequests, 101 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-26 18:23:49,414 INFO ]: Start minimizeSevpa. Operand 595 states. [2018-06-26 18:23:49,470 INFO ]: Finished minimizeSevpa. Reduced states from 595 to 595. [2018-06-26 18:23:49,470 INFO ]: Start removeUnreachable. Operand 595 states. [2018-06-26 18:23:49,482 INFO ]: Finished removeUnreachable. Reduced from 595 states to 595 states and 1517 transitions. [2018-06-26 18:23:49,483 INFO ]: Start accepts. Automaton has 595 states and 1517 transitions. Word has length 100 [2018-06-26 18:23:49,483 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:49,483 INFO ]: Abstraction has 595 states and 1517 transitions. [2018-06-26 18:23:49,483 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:49,483 INFO ]: Start isEmpty. Operand 595 states and 1517 transitions. [2018-06-26 18:23:49,501 INFO ]: Finished isEmpty. Found accepting run of length 141 [2018-06-26 18:23:49,501 INFO ]: Found error trace [2018-06-26 18:23:49,501 INFO ]: trace histogram [21, 10, 10, 10, 10, 10, 8, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:49,502 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:49,504 INFO ]: Analyzing trace with hash 1636448773, now seen corresponding path program 1 times [2018-06-26 18:23:49,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:49,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:49,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:49,505 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:49,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:49,527 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:49,965 INFO ]: Checked inductivity of 1194 backedges. 167 proven. 217 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2018-06-26 18:23:49,965 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:49,965 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-26 18:23:49,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:50,156 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:50,165 INFO ]: Computing forward predicates... [2018-06-26 18:23:50,255 INFO ]: Checked inductivity of 1194 backedges. 290 proven. 201 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-06-26 18:23:50,277 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:50,277 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-26 18:23:50,277 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:23:50,277 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:23:50,277 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:23:50,278 INFO ]: Start difference. First operand 595 states and 1517 transitions. Second operand 13 states. [2018-06-26 18:23:52,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:52,589 INFO ]: Finished difference Result 1632 states and 4525 transitions. [2018-06-26 18:23:52,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 18:23:52,589 INFO ]: Start accepts. Automaton has 13 states. Word has length 140 [2018-06-26 18:23:52,590 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:52,633 INFO ]: With dead ends: 1632 [2018-06-26 18:23:52,633 INFO ]: Without dead ends: 1375 [2018-06-26 18:23:52,633 INFO ]: 0 DeclaredPredicates, 177 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2018-06-26 18:23:52,634 INFO ]: Start minimizeSevpa. Operand 1375 states. [2018-06-26 18:23:52,759 INFO ]: Finished minimizeSevpa. Reduced states from 1375 to 917. [2018-06-26 18:23:52,759 INFO ]: Start removeUnreachable. Operand 917 states. [2018-06-26 18:23:52,779 INFO ]: Finished removeUnreachable. Reduced from 917 states to 917 states and 2436 transitions. [2018-06-26 18:23:52,779 INFO ]: Start accepts. Automaton has 917 states and 2436 transitions. Word has length 140 [2018-06-26 18:23:52,781 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:52,781 INFO ]: Abstraction has 917 states and 2436 transitions. [2018-06-26 18:23:52,781 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:23:52,781 INFO ]: Start isEmpty. Operand 917 states and 2436 transitions. [2018-06-26 18:23:52,817 INFO ]: Finished isEmpty. Found accepting run of length 188 [2018-06-26 18:23:52,817 INFO ]: Found error trace [2018-06-26 18:23:52,817 INFO ]: trace histogram [28, 12, 12, 12, 12, 12, 11, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:52,817 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:52,817 INFO ]: Analyzing trace with hash 261803977, now seen corresponding path program 1 times [2018-06-26 18:23:52,818 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:52,818 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:52,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:52,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:52,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:52,874 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:53,038 INFO ]: Checked inductivity of 2139 backedges. 193 proven. 109 refuted. 0 times theorem prover too weak. 1837 trivial. 0 not checked. [2018-06-26 18:23:53,038 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:53,038 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) [2018-06-26 18:23:53,047 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:53,329 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:53,344 INFO ]: Computing forward predicates... [2018-06-26 18:23:53,375 INFO ]: Checked inductivity of 2139 backedges. 1129 proven. 0 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2018-06-26 18:23:53,411 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:23:53,412 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-26 18:23:53,412 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:53,412 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:53,412 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:53,412 INFO ]: Start difference. First operand 917 states and 2436 transitions. Second operand 3 states. [2018-06-26 18:23:53,807 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:53,807 INFO ]: Finished difference Result 947 states and 2420 transitions. [2018-06-26 18:23:53,810 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:53,810 INFO ]: Start accepts. Automaton has 3 states. Word has length 187 [2018-06-26 18:23:53,810 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:53,836 INFO ]: With dead ends: 947 [2018-06-26 18:23:53,836 INFO ]: Without dead ends: 919 [2018-06-26 18:23:53,836 INFO ]: 0 DeclaredPredicates, 189 GetRequests, 188 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-26 18:23:53,837 INFO ]: Start minimizeSevpa. Operand 919 states. [2018-06-26 18:23:53,907 INFO ]: Finished minimizeSevpa. Reduced states from 919 to 919. [2018-06-26 18:23:53,907 INFO ]: Start removeUnreachable. Operand 919 states. [2018-06-26 18:23:53,925 INFO ]: Finished removeUnreachable. Reduced from 919 states to 919 states and 2346 transitions. [2018-06-26 18:23:53,925 INFO ]: Start accepts. Automaton has 919 states and 2346 transitions. Word has length 187 [2018-06-26 18:23:53,926 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:53,926 INFO ]: Abstraction has 919 states and 2346 transitions. [2018-06-26 18:23:53,926 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:53,926 INFO ]: Start isEmpty. Operand 919 states and 2346 transitions. [2018-06-26 18:23:53,960 INFO ]: Finished isEmpty. Found accepting run of length 370 [2018-06-26 18:23:53,960 INFO ]: Found error trace [2018-06-26 18:23:53,960 INFO ]: trace histogram [56, 26, 26, 26, 26, 26, 21, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 18:23:53,960 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:53,960 INFO ]: Analyzing trace with hash 718834439, now seen corresponding path program 1 times [2018-06-26 18:23:53,960 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:53,960 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:53,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:53,961 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:53,961 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:53,994 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:54,310 INFO ]: Checked inductivity of 8642 backedges. 422 proven. 231 refuted. 0 times theorem prover too weak. 7989 trivial. 0 not checked. [2018-06-26 18:23:54,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:54,310 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:23:54,319 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:54,879 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:54,900 INFO ]: Computing forward predicates... [2018-06-26 18:23:54,986 INFO ]: Checked inductivity of 8642 backedges. 4486 proven. 0 refuted. 0 times theorem prover too weak. 4156 trivial. 0 not checked. [2018-06-26 18:23:55,009 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 18:23:55,009 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-06-26 18:23:55,010 INFO ]: Interpolant automaton has 3 states [2018-06-26 18:23:55,010 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 18:23:55,010 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 18:23:55,010 INFO ]: Start difference. First operand 919 states and 2346 transitions. Second operand 3 states. [2018-06-26 18:23:55,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:23:55,098 INFO ]: Finished difference Result 981 states and 2508 transitions. [2018-06-26 18:23:55,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 18:23:55,099 INFO ]: Start accepts. Automaton has 3 states. Word has length 369 [2018-06-26 18:23:55,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:23:55,123 INFO ]: With dead ends: 981 [2018-06-26 18:23:55,123 INFO ]: Without dead ends: 952 [2018-06-26 18:23:55,124 INFO ]: 0 DeclaredPredicates, 371 GetRequests, 370 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-26 18:23:55,124 INFO ]: Start minimizeSevpa. Operand 952 states. [2018-06-26 18:23:55,193 INFO ]: Finished minimizeSevpa. Reduced states from 952 to 952. [2018-06-26 18:23:55,193 INFO ]: Start removeUnreachable. Operand 952 states. [2018-06-26 18:23:55,214 INFO ]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2429 transitions. [2018-06-26 18:23:55,214 INFO ]: Start accepts. Automaton has 952 states and 2429 transitions. Word has length 369 [2018-06-26 18:23:55,217 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:23:55,217 INFO ]: Abstraction has 952 states and 2429 transitions. [2018-06-26 18:23:55,217 INFO ]: Interpolant automaton has 3 states. [2018-06-26 18:23:55,217 INFO ]: Start isEmpty. Operand 952 states and 2429 transitions. [2018-06-26 18:23:55,258 INFO ]: Finished isEmpty. Found accepting run of length 516 [2018-06-26 18:23:55,258 INFO ]: Found error trace [2018-06-26 18:23:55,258 INFO ]: trace histogram [78, 34, 34, 34, 34, 34, 30, 12, 12, 12, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2018-06-26 18:23:55,258 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:23:55,259 INFO ]: Analyzing trace with hash 175379977, now seen corresponding path program 1 times [2018-06-26 18:23:55,259 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:23:55,259 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:23:55,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:55,259 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:23:55,259 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:23:55,570 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:56,220 INFO ]: Checked inductivity of 16835 backedges. 640 proven. 67 refuted. 0 times theorem prover too weak. 16128 trivial. 0 not checked. [2018-06-26 18:23:56,221 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:23:56,221 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 18:23:56,231 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:23:57,064 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:23:57,102 INFO ]: Computing forward predicates... [2018-06-26 18:23:57,632 INFO ]: Checked inductivity of 16835 backedges. 7724 proven. 144 refuted. 0 times theorem prover too weak. 8967 trivial. 0 not checked. [2018-06-26 18:23:57,656 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:23:57,657 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 12] total 13 [2018-06-26 18:23:57,657 INFO ]: Interpolant automaton has 13 states [2018-06-26 18:23:57,657 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 18:23:57,657 INFO ]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-06-26 18:23:57,657 INFO ]: Start difference. First operand 952 states and 2429 transitions. Second operand 13 states. [2018-06-26 18:24:00,383 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:00,383 INFO ]: Finished difference Result 1932 states and 7522 transitions. [2018-06-26 18:24:00,383 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 18:24:00,383 INFO ]: Start accepts. Automaton has 13 states. Word has length 515 [2018-06-26 18:24:00,383 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 18:24:00,488 INFO ]: With dead ends: 1932 [2018-06-26 18:24:00,488 INFO ]: Without dead ends: 1812 [2018-06-26 18:24:00,488 INFO ]: 0 DeclaredPredicates, 570 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=432, Invalid=1920, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 18:24:00,489 INFO ]: Start minimizeSevpa. Operand 1812 states. [2018-06-26 18:24:00,717 INFO ]: Finished minimizeSevpa. Reduced states from 1812 to 1080. [2018-06-26 18:24:00,718 INFO ]: Start removeUnreachable. Operand 1080 states. [2018-06-26 18:24:00,747 INFO ]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3043 transitions. [2018-06-26 18:24:00,747 INFO ]: Start accepts. Automaton has 1080 states and 3043 transitions. Word has length 515 [2018-06-26 18:24:00,747 INFO ]: Finished accepts. word is rejected. [2018-06-26 18:24:00,747 INFO ]: Abstraction has 1080 states and 3043 transitions. [2018-06-26 18:24:00,747 INFO ]: Interpolant automaton has 13 states. [2018-06-26 18:24:00,747 INFO ]: Start isEmpty. Operand 1080 states and 3043 transitions. [2018-06-26 18:24:00,787 INFO ]: Finished isEmpty. Found accepting run of length 355 [2018-06-26 18:24:00,787 INFO ]: Found error trace [2018-06-26 18:24:00,787 INFO ]: trace histogram [53, 24, 24, 24, 24, 24, 21, 9, 9, 9, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 18:24:00,787 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 18:24:00,787 INFO ]: Analyzing trace with hash 1917636567, now seen corresponding path program 1 times [2018-06-26 18:24:00,787 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 18:24:00,787 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 18:24:00,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:00,788 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:00,788 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 18:24:00,997 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:01,709 INFO ]: Checked inductivity of 7891 backedges. 780 proven. 220 refuted. 0 times theorem prover too weak. 6891 trivial. 0 not checked. [2018-06-26 18:24:01,709 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 18:24:01,709 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 18:24:01,716 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 18:24:02,143 INFO ]: Conjunction of SSA is unsat [2018-06-26 18:24:02,171 INFO ]: Computing forward predicates... [2018-06-26 18:24:02,544 INFO ]: Checked inductivity of 7891 backedges. 924 proven. 581 refuted. 0 times theorem prover too weak. 6386 trivial. 0 not checked. [2018-06-26 18:24:02,566 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 18:24:02,566 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-26 18:24:02,567 INFO ]: Interpolant automaton has 19 states [2018-06-26 18:24:02,567 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 18:24:02,567 INFO ]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-06-26 18:24:02,567 INFO ]: Start difference. First operand 1080 states and 3043 transitions. Second operand 19 states. [2018-06-26 18:24:13,036 WARN ]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:24:14,653 WARN ]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-06-26 18:24:18,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 18:24:18,804 INFO ]: Finished difference Result 6461 states and 36103 transitions. [2018-06-26 18:24:18,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-06-26 18:24:18,804 INFO ]: Start accepts. Automaton has 19 states. Word has length 354 [2018-06-26 18:24:18,805 INFO ]: Finished accepts. some prefix is accepted. Received shutdown request... [2018-06-26 18:24:19,812 INFO ]: With dead ends: 6461 [2018-06-26 18:24:19,812 INFO ]: Without dead ends: 6076 [2018-06-26 18:24:19,820 INFO ]: 0 DeclaredPredicates, 602 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13003 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2876, Invalid=28630, Unknown=0, NotChecked=0, Total=31506 [2018-06-26 18:24:19,823 INFO ]: Start minimizeSevpa. Operand 6076 states. [2018-06-26 18:24:19,824 WARN ]: Verification canceled [2018-06-26 18:24:19,827 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 18:24:19,828 WARN ]: Timeout [2018-06-26 18:24:19,828 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 06:24:19 BasicIcfg [2018-06-26 18:24:19,828 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 18:24:19,829 INFO ]: Toolchain (without parser) took 55234.39 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 258.7 MB in the beginning and 459.4 MB in the end (delta: -200.7 MB). Peak memory consumption was 955.4 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:19,830 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 18:24:19,830 INFO ]: ChcToBoogie took 66.44 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 255.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:19,830 INFO ]: Boogie Preprocessor took 66.82 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 254.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:19,831 INFO ]: RCFGBuilder took 565.15 ms. Allocated memory is still 309.3 MB. Free memory was 254.6 MB in the beginning and 230.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:19,831 INFO ]: BlockEncodingV2 took 629.65 ms. Allocated memory is still 309.3 MB. Free memory was 230.5 MB in the beginning and 206.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:19,831 INFO ]: TraceAbstraction took 53893.29 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 205.5 MB in the beginning and 459.4 MB in the end (delta: -253.9 MB). Peak memory consumption was 902.2 MB. Max. memory is 3.6 GB. [2018-06-26 18:24:19,835 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 70 locations, 110 edges - StatisticsResult: Encoded RCFG 43 locations, 84 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 66.44 ms. Allocated memory is still 309.3 MB. Free memory was 258.7 MB in the beginning and 255.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 66.82 ms. Allocated memory is still 309.3 MB. Free memory was 255.7 MB in the beginning and 254.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 3.6 GB. * RCFGBuilder took 565.15 ms. Allocated memory is still 309.3 MB. Free memory was 254.6 MB in the beginning and 230.5 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 629.65 ms. Allocated memory is still 309.3 MB. Free memory was 230.5 MB in the beginning and 206.5 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 53893.29 ms. Allocated memory was 309.3 MB in the beginning and 1.5 GB in the end (delta: 1.2 GB). Free memory was 205.5 MB in the beginning and 459.4 MB in the end (delta: -253.9 MB). Peak memory consumption was 902.2 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing MinimizeSevpa. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. TIMEOUT Result, 53.8s OverallTime, 19 OverallIterations, 78 TraceHistogramMax, 40.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2744 SDtfs, 1593 SDslu, 7830 SDs, 0 SdLazy, 35132 SolverSat, 9096 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2518 GetRequests, 2147 SyntacticMatches, 0 SemanticMatches, 371 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14114 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1080occurred in iteration=18, 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: 1.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 2711 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 4047 NumberOfCodeBlocks, 4047 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4014 ConstructedInterpolants, 0 QuantifiedInterpolants, 1443772 SizeOfPredicates, 82 NumberOfNonLiveVariables, 22905 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 33 InterpolantComputations, 10 PerfectInterpolantSequences, 74597/76605 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_18-24-19-853.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_18-24-19-853.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_18-24-19-853.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/inc4.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_18-24-19-853.csv Completed graceful shutdown