java -Xss4m -Xmx4000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCHC_wBE.xml --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -s ../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf -i /storage/chc-comp/eldarica-misc/LIA/reve/019b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 21:05:28,856 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 21:05:28,857 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 21:05:28,871 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 21:05:28,871 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 21:05:28,872 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 21:05:28,873 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 21:05:28,877 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 21:05:28,878 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 21:05:28,878 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 21:05:28,879 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 21:05:28,879 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 21:05:28,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 21:05:28,881 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 21:05:28,882 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 21:05:28,882 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 21:05:28,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 21:05:28,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 21:05:28,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 21:05:28,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 21:05:28,890 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 21:05:28,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 21:05:28,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 21:05:28,893 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 21:05:28,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 21:05:28,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 21:05:28,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 21:05:28,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 21:05:28,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 21:05:28,898 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 21:05:28,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 21:05:28,899 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 21:05:28,899 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 21:05:28,900 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 21:05:28,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 21:05:28,901 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 21:05:28,924 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 21:05:28,924 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 21:05:28,925 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 21:05:28,925 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 21:05:28,926 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 21:05:28,926 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 21:05:28,926 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 21:05:28,926 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 21:05:28,926 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 21:05:28,927 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 21:05:28,927 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 21:05:28,927 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 21:05:28,927 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:05:28,927 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 21:05:28,928 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 21:05:28,932 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 21:05:28,932 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 21:05:28,932 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 21:05:28,932 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 21:05:28,932 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 21:05:28,933 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 21:05:28,934 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 21:05:28,934 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 21:05:28,982 INFO ]: Repository-Root is: /tmp [2018-06-24 21:05:28,995 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 21:05:28,998 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 21:05:29,000 INFO ]: Initializing SmtParser... [2018-06-24 21:05:29,000 INFO ]: SmtParser initialized [2018-06-24 21:05:29,001 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/019b-horn.smt2 [2018-06-24 21:05:29,002 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 21:05:29,100 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/019b-horn.smt2 unknown [2018-06-24 21:05:29,307 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/019b-horn.smt2 [2018-06-24 21:05:29,319 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 21:05:29,325 INFO ]: Walking toolchain with 5 elements. [2018-06-24 21:05:29,326 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 21:05:29,326 INFO ]: Initializing ChcToBoogie... [2018-06-24 21:05:29,326 INFO ]: ChcToBoogie initialized [2018-06-24 21:05:29,332 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,381 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29 Unit [2018-06-24 21:05:29,381 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 21:05:29,382 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 21:05:29,382 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 21:05:29,382 INFO ]: Boogie Preprocessor initialized [2018-06-24 21:05:29,402 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,402 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,408 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,409 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,411 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,413 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,414 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,416 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 21:05:29,417 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 21:05:29,417 INFO ]: Initializing RCFGBuilder... [2018-06-24 21:05:29,417 INFO ]: RCFGBuilder initialized [2018-06-24 21:05:29,418 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 21:05:29,434 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 21:05:29,434 INFO ]: Found specification of procedure gotoProc [2018-06-24 21:05:29,434 INFO ]: Found implementation of procedure gotoProc [2018-06-24 21:05:29,434 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 21:05:29,434 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 21:05:29,434 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 21:05:29,726 INFO ]: Using library mode [2018-06-24 21:05:29,727 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:05:29 BoogieIcfgContainer [2018-06-24 21:05:29,727 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 21:05:29,727 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 21:05:29,727 INFO ]: Initializing BlockEncodingV2... [2018-06-24 21:05:29,737 INFO ]: BlockEncodingV2 initialized [2018-06-24 21:05:29,738 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:05:29" (1/1) ... [2018-06-24 21:05:29,762 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-24 21:05:29,763 INFO ]: Using Remove infeasible edges [2018-06-24 21:05:29,764 INFO ]: Using Maximize final states [2018-06-24 21:05:29,764 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 21:05:29,764 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 21:05:29,767 INFO ]: Using Remove sink states [2018-06-24 21:05:29,768 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 21:05:29,768 INFO ]: Using Use SBE [2018-06-24 21:05:29,778 INFO ]: SBE split 0 edges [2018-06-24 21:05:29,783 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 21:05:29,784 INFO ]: 0 new accepting states [2018-06-24 21:05:29,812 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-24 21:05:29,814 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:05:29,819 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 21:05:29,819 INFO ]: 0 new accepting states [2018-06-24 21:05:29,819 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 21:05:29,819 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 21:05:29,819 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-24 21:05:29,820 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:05:29 BasicIcfg [2018-06-24 21:05:29,820 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 21:05:29,821 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 21:05:29,821 INFO ]: Initializing TraceAbstraction... [2018-06-24 21:05:29,826 INFO ]: TraceAbstraction initialized [2018-06-24 21:05:29,826 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 09:05:29" (1/4) ... [2018-06-24 21:05:29,827 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb4de7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 09:05:29, skipping insertion in model container [2018-06-24 21:05:29,827 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 09:05:29" (2/4) ... [2018-06-24 21:05:29,827 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb4de7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 09:05:29, skipping insertion in model container [2018-06-24 21:05:29,827 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 09:05:29" (3/4) ... [2018-06-24 21:05:29,827 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cb4de7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:05:29, skipping insertion in model container [2018-06-24 21:05:29,827 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 09:05:29" (4/4) ... [2018-06-24 21:05:29,829 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 21:05:29,848 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 21:05:29,854 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 21:05:29,895 INFO ]: Using default assertion order modulation [2018-06-24 21:05:29,895 INFO ]: Interprodecural is true [2018-06-24 21:05:29,895 INFO ]: Hoare is false [2018-06-24 21:05:29,895 INFO ]: Compute interpolants for FPandBP [2018-06-24 21:05:29,895 INFO ]: Backedges is TWOTRACK [2018-06-24 21:05:29,895 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 21:05:29,895 INFO ]: Difference is false [2018-06-24 21:05:29,895 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 21:05:29,895 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 21:05:29,905 INFO ]: Start isEmpty. Operand 6 states. [2018-06-24 21:05:29,913 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 21:05:29,914 INFO ]: Found error trace [2018-06-24 21:05:29,914 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 21:05:29,914 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:29,918 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-24 21:05:29,919 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:29,919 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:29,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:29,956 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:29,956 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:30,012 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:30,110 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:30,112 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:05:30,112 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:05:30,113 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:05:30,124 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:05:30,125 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:05:30,126 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-24 21:05:30,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:30,190 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-24 21:05:30,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:05:30,192 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 21:05:30,192 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:30,201 INFO ]: With dead ends: 7 [2018-06-24 21:05:30,201 INFO ]: Without dead ends: 7 [2018-06-24 21:05:30,203 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:05:30,223 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:05:30,243 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:05:30,246 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:05:30,246 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-24 21:05:30,247 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-24 21:05:30,247 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:30,247 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-24 21:05:30,247 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:05:30,248 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-24 21:05:30,248 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:05:30,248 INFO ]: Found error trace [2018-06-24 21:05:30,248 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:05:30,248 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:30,248 INFO ]: Analyzing trace with hash 1156290923, now seen corresponding path program 1 times [2018-06-24 21:05:30,248 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:30,248 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:30,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:30,250 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:30,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:30,274 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:30,596 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-24 21:05:30,598 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:30,598 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:30,598 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:30,608 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:30,642 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:30,651 INFO ]: Computing forward predicates... [2018-06-24 21:05:30,855 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:30,879 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:30,879 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 21:05:30,880 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:05:30,880 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:05:30,880 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:05:30,880 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 6 states. [2018-06-24 21:05:31,178 WARN ]: Spent 172.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 14 [2018-06-24 21:05:31,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:31,308 INFO ]: Finished difference Result 10 states and 18 transitions. [2018-06-24 21:05:31,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:05:31,308 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:05:31,309 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:31,309 INFO ]: With dead ends: 10 [2018-06-24 21:05:31,309 INFO ]: Without dead ends: 7 [2018-06-24 21:05:31,310 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:05:31,310 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 21:05:31,310 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 21:05:31,310 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 21:05:31,311 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-06-24 21:05:31,311 INFO ]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 6 [2018-06-24 21:05:31,311 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:31,311 INFO ]: Abstraction has 7 states and 8 transitions. [2018-06-24 21:05:31,311 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:05:31,311 INFO ]: Start isEmpty. Operand 7 states and 8 transitions. [2018-06-24 21:05:31,311 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 21:05:31,311 INFO ]: Found error trace [2018-06-24 21:05:31,311 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 21:05:31,311 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:31,312 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-24 21:05:31,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:31,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:31,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:31,313 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:31,313 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:31,325 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:31,487 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:31,487 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:31,487 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:31,497 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:31,518 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:31,520 INFO ]: Computing forward predicates... [2018-06-24 21:05:31,584 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:31,604 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 21:05:31,604 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-06-24 21:05:31,605 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:05:31,605 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:05:31,605 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:05:31,605 INFO ]: Start difference. First operand 7 states and 8 transitions. Second operand 6 states. [2018-06-24 21:05:31,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:31,787 INFO ]: Finished difference Result 8 states and 10 transitions. [2018-06-24 21:05:31,787 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:05:31,787 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 21:05:31,787 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:31,787 INFO ]: With dead ends: 8 [2018-06-24 21:05:31,787 INFO ]: Without dead ends: 8 [2018-06-24 21:05:31,788 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 21:05:31,788 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 21:05:31,789 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 21:05:31,789 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 21:05:31,789 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-24 21:05:31,789 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-06-24 21:05:31,789 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:31,789 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-24 21:05:31,789 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:05:31,789 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-24 21:05:31,790 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 21:05:31,790 INFO ]: Found error trace [2018-06-24 21:05:31,790 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 21:05:31,790 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:31,790 INFO ]: Analyzing trace with hash 1486771878, now seen corresponding path program 1 times [2018-06-24 21:05:31,790 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:31,790 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:31,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:31,791 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:31,791 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:31,824 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:31,909 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:31,909 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:31,909 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-24 21:05:31,915 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:31,939 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:31,940 INFO ]: Computing forward predicates... [2018-06-24 21:05:31,952 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:05:31,972 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:31,972 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-06-24 21:05:31,972 INFO ]: Interpolant automaton has 6 states [2018-06-24 21:05:31,973 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 21:05:31,973 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:05:31,973 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 6 states. [2018-06-24 21:05:32,146 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:32,146 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 21:05:32,147 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 21:05:32,147 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-24 21:05:32,147 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:32,148 INFO ]: With dead ends: 10 [2018-06-24 21:05:32,148 INFO ]: Without dead ends: 10 [2018-06-24 21:05:32,148 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 21:05:32,148 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 21:05:32,149 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 21:05:32,149 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 21:05:32,150 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2018-06-24 21:05:32,150 INFO ]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 7 [2018-06-24 21:05:32,150 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:32,150 INFO ]: Abstraction has 10 states and 14 transitions. [2018-06-24 21:05:32,150 INFO ]: Interpolant automaton has 6 states. [2018-06-24 21:05:32,150 INFO ]: Start isEmpty. Operand 10 states and 14 transitions. [2018-06-24 21:05:32,150 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:05:32,150 INFO ]: Found error trace [2018-06-24 21:05:32,150 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:05:32,150 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:32,151 INFO ]: Analyzing trace with hash -1155067447, now seen corresponding path program 2 times [2018-06-24 21:05:32,151 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:32,151 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:32,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:32,151 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:32,151 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:32,183 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:32,415 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:32,415 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:32,415 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-24 21:05:32,420 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:05:32,448 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:05:32,448 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:32,450 INFO ]: Computing forward predicates... [2018-06-24 21:05:32,562 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:32,581 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:32,581 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:05:32,582 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:05:32,582 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:05:32,582 INFO ]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:05:32,582 INFO ]: Start difference. First operand 10 states and 14 transitions. Second operand 10 states. [2018-06-24 21:05:32,828 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:32,828 INFO ]: Finished difference Result 16 states and 23 transitions. [2018-06-24 21:05:32,828 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 21:05:32,829 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:05:32,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:32,829 INFO ]: With dead ends: 16 [2018-06-24 21:05:32,829 INFO ]: Without dead ends: 9 [2018-06-24 21:05:32,829 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-06-24 21:05:32,829 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 21:05:32,830 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 21:05:32,830 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 21:05:32,831 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-24 21:05:32,831 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-24 21:05:32,831 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:32,831 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-24 21:05:32,831 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:05:32,831 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-24 21:05:32,831 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 21:05:32,831 INFO ]: Found error trace [2018-06-24 21:05:32,831 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 21:05:32,831 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:32,831 INFO ]: Analyzing trace with hash -1153220405, now seen corresponding path program 3 times [2018-06-24 21:05:32,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:32,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:32,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:32,832 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:32,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:32,844 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:32,922 INFO ]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:32,922 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:32,922 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-24 21:05:32,933 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:05:32,963 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 21:05:32,963 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:32,965 INFO ]: Computing forward predicates... [2018-06-24 21:05:33,062 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:33,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:33,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-06-24 21:05:33,082 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:05:33,082 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:05:33,082 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:05:33,082 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 10 states. [2018-06-24 21:05:33,238 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:33,238 INFO ]: Finished difference Result 15 states and 23 transitions. [2018-06-24 21:05:33,238 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:05:33,238 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-24 21:05:33,238 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:33,239 INFO ]: With dead ends: 15 [2018-06-24 21:05:33,239 INFO ]: Without dead ends: 15 [2018-06-24 21:05:33,239 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:05:33,239 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 21:05:33,241 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 21:05:33,241 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 21:05:33,242 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2018-06-24 21:05:33,242 INFO ]: Start accepts. Automaton has 15 states and 23 transitions. Word has length 8 [2018-06-24 21:05:33,242 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:33,242 INFO ]: Abstraction has 15 states and 23 transitions. [2018-06-24 21:05:33,242 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:05:33,242 INFO ]: Start isEmpty. Operand 15 states and 23 transitions. [2018-06-24 21:05:33,242 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 21:05:33,242 INFO ]: Found error trace [2018-06-24 21:05:33,242 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-06-24 21:05:33,242 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:33,242 INFO ]: Analyzing trace with hash -1390449596, now seen corresponding path program 4 times [2018-06-24 21:05:33,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:33,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:33,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:33,243 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:33,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:33,269 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:33,501 INFO ]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 21:05:33,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:33,501 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:33,508 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:05:33,542 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:05:33,542 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:33,544 INFO ]: Computing forward predicates... [2018-06-24 21:05:33,579 INFO ]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:05:33,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:33,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-06-24 21:05:33,600 INFO ]: Interpolant automaton has 8 states [2018-06-24 21:05:33,600 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 21:05:33,600 INFO ]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-06-24 21:05:33,600 INFO ]: Start difference. First operand 15 states and 23 transitions. Second operand 8 states. [2018-06-24 21:05:33,635 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:33,635 INFO ]: Finished difference Result 26 states and 45 transitions. [2018-06-24 21:05:33,635 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 21:05:33,635 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-24 21:05:33,635 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:33,636 INFO ]: With dead ends: 26 [2018-06-24 21:05:33,636 INFO ]: Without dead ends: 26 [2018-06-24 21:05:33,637 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-24 21:05:33,637 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 21:05:33,640 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 21:05:33,640 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 21:05:33,641 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2018-06-24 21:05:33,641 INFO ]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 9 [2018-06-24 21:05:33,641 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:33,641 INFO ]: Abstraction has 26 states and 45 transitions. [2018-06-24 21:05:33,641 INFO ]: Interpolant automaton has 8 states. [2018-06-24 21:05:33,641 INFO ]: Start isEmpty. Operand 26 states and 45 transitions. [2018-06-24 21:05:33,642 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 21:05:33,642 INFO ]: Found error trace [2018-06-24 21:05:33,642 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-06-24 21:05:33,642 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:33,642 INFO ]: Analyzing trace with hash -154619925, now seen corresponding path program 5 times [2018-06-24 21:05:33,642 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:33,642 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:33,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:33,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:33,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:33,658 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:33,830 INFO ]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:33,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:33,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:33,838 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:05:33,904 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 21:05:33,904 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:33,907 INFO ]: Computing forward predicates... [2018-06-24 21:05:34,303 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:34,323 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:34,323 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-06-24 21:05:34,323 INFO ]: Interpolant automaton has 14 states [2018-06-24 21:05:34,323 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 21:05:34,323 INFO ]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-06-24 21:05:34,323 INFO ]: Start difference. First operand 26 states and 45 transitions. Second operand 14 states. [2018-06-24 21:05:34,843 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:34,844 INFO ]: Finished difference Result 35 states and 55 transitions. [2018-06-24 21:05:34,844 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 21:05:34,844 INFO ]: Start accepts. Automaton has 14 states. Word has length 10 [2018-06-24 21:05:34,844 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:34,845 INFO ]: With dead ends: 35 [2018-06-24 21:05:34,845 INFO ]: Without dead ends: 16 [2018-06-24 21:05:34,845 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:05:34,845 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 21:05:34,847 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 21:05:34,847 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 21:05:34,847 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-06-24 21:05:34,848 INFO ]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 10 [2018-06-24 21:05:34,848 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:34,848 INFO ]: Abstraction has 16 states and 24 transitions. [2018-06-24 21:05:34,848 INFO ]: Interpolant automaton has 14 states. [2018-06-24 21:05:34,848 INFO ]: Start isEmpty. Operand 16 states and 24 transitions. [2018-06-24 21:05:34,848 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 21:05:34,848 INFO ]: Found error trace [2018-06-24 21:05:34,848 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-06-24 21:05:34,848 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:34,848 INFO ]: Analyzing trace with hash 1276401574, now seen corresponding path program 6 times [2018-06-24 21:05:34,848 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:34,848 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:34,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:34,849 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:34,849 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:34,878 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:34,990 INFO ]: Checked inductivity of 21 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:05:34,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:34,991 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-24 21:05:35,008 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:35,046 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 21:05:35,046 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:35,048 INFO ]: Computing forward predicates... [2018-06-24 21:05:35,072 INFO ]: Checked inductivity of 21 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:05:35,094 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:35,095 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2018-06-24 21:05:35,095 INFO ]: Interpolant automaton has 10 states [2018-06-24 21:05:35,095 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 21:05:35,095 INFO ]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-06-24 21:05:35,095 INFO ]: Start difference. First operand 16 states and 24 transitions. Second operand 10 states. [2018-06-24 21:05:35,171 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:35,171 INFO ]: Finished difference Result 35 states and 63 transitions. [2018-06-24 21:05:35,171 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 21:05:35,171 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-24 21:05:35,171 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:35,172 INFO ]: With dead ends: 35 [2018-06-24 21:05:35,172 INFO ]: Without dead ends: 35 [2018-06-24 21:05:35,172 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-24 21:05:35,172 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 21:05:35,175 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 21:05:35,176 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 21:05:35,176 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 63 transitions. [2018-06-24 21:05:35,177 INFO ]: Start accepts. Automaton has 35 states and 63 transitions. Word has length 11 [2018-06-24 21:05:35,177 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:35,177 INFO ]: Abstraction has 35 states and 63 transitions. [2018-06-24 21:05:35,177 INFO ]: Interpolant automaton has 10 states. [2018-06-24 21:05:35,177 INFO ]: Start isEmpty. Operand 35 states and 63 transitions. [2018-06-24 21:05:35,177 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:05:35,177 INFO ]: Found error trace [2018-06-24 21:05:35,177 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-06-24 21:05:35,177 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:35,177 INFO ]: Analyzing trace with hash 913387721, now seen corresponding path program 7 times [2018-06-24 21:05:35,177 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:35,177 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:35,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:35,178 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:35,178 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:35,193 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:35,717 INFO ]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:35,717 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:35,717 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:35,722 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:35,759 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:35,762 INFO ]: Computing forward predicates... [2018-06-24 21:05:36,041 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:36,060 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:36,060 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-06-24 21:05:36,061 INFO ]: Interpolant automaton has 18 states [2018-06-24 21:05:36,061 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 21:05:36,061 INFO ]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-06-24 21:05:36,061 INFO ]: Start difference. First operand 35 states and 63 transitions. Second operand 18 states. [2018-06-24 21:05:37,080 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:37,081 INFO ]: Finished difference Result 44 states and 65 transitions. [2018-06-24 21:05:37,234 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 21:05:37,234 INFO ]: Start accepts. Automaton has 18 states. Word has length 12 [2018-06-24 21:05:37,234 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:37,234 INFO ]: With dead ends: 44 [2018-06-24 21:05:37,234 INFO ]: Without dead ends: 17 [2018-06-24 21:05:37,235 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=255, Invalid=1077, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:05:37,235 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 21:05:37,236 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 21:05:37,236 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 21:05:37,237 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2018-06-24 21:05:37,237 INFO ]: Start accepts. Automaton has 17 states and 25 transitions. Word has length 12 [2018-06-24 21:05:37,237 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:37,237 INFO ]: Abstraction has 17 states and 25 transitions. [2018-06-24 21:05:37,237 INFO ]: Interpolant automaton has 18 states. [2018-06-24 21:05:37,237 INFO ]: Start isEmpty. Operand 17 states and 25 transitions. [2018-06-24 21:05:37,238 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 21:05:37,238 INFO ]: Found error trace [2018-06-24 21:05:37,238 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-06-24 21:05:37,238 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:37,238 INFO ]: Analyzing trace with hash -1606572213, now seen corresponding path program 8 times [2018-06-24 21:05:37,238 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:37,238 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:37,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:37,239 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:37,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:37,260 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:37,360 INFO ]: Checked inductivity of 28 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-06-24 21:05:37,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:37,360 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-24 21:05:37,374 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:05:37,415 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:05:37,415 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:37,419 INFO ]: Computing forward predicates... [2018-06-24 21:05:37,931 INFO ]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:37,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:37,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2018-06-24 21:05:37,951 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:05:37,951 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:05:37,951 INFO ]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:05:37,952 INFO ]: Start difference. First operand 17 states and 25 transitions. Second operand 16 states. [2018-06-24 21:05:38,549 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:38,549 INFO ]: Finished difference Result 57 states and 105 transitions. [2018-06-24 21:05:38,550 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:05:38,550 INFO ]: Start accepts. Automaton has 16 states. Word has length 12 [2018-06-24 21:05:38,550 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:38,551 INFO ]: With dead ends: 57 [2018-06-24 21:05:38,551 INFO ]: Without dead ends: 57 [2018-06-24 21:05:38,553 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=981, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:05:38,553 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-24 21:05:38,557 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 47. [2018-06-24 21:05:38,557 INFO ]: Start removeUnreachable. Operand 47 states. [2018-06-24 21:05:38,558 INFO ]: Finished removeUnreachable. Reduced from 47 states to 47 states and 85 transitions. [2018-06-24 21:05:38,558 INFO ]: Start accepts. Automaton has 47 states and 85 transitions. Word has length 12 [2018-06-24 21:05:38,559 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:38,559 INFO ]: Abstraction has 47 states and 85 transitions. [2018-06-24 21:05:38,559 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:05:38,559 INFO ]: Start isEmpty. Operand 47 states and 85 transitions. [2018-06-24 21:05:38,559 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 21:05:38,559 INFO ]: Found error trace [2018-06-24 21:05:38,559 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2018-06-24 21:05:38,559 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:38,559 INFO ]: Analyzing trace with hash 1735513540, now seen corresponding path program 9 times [2018-06-24 21:05:38,559 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:38,559 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:38,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:38,560 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:38,560 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:38,585 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:38,701 INFO ]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-24 21:05:38,701 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:38,701 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:38,707 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:05:38,746 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 21:05:38,747 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:38,749 INFO ]: Computing forward predicates... [2018-06-24 21:05:38,789 INFO ]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-06-24 21:05:38,808 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:38,808 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2018-06-24 21:05:38,808 INFO ]: Interpolant automaton has 12 states [2018-06-24 21:05:38,809 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 21:05:38,809 INFO ]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-06-24 21:05:38,809 INFO ]: Start difference. First operand 47 states and 85 transitions. Second operand 12 states. [2018-06-24 21:05:38,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:38,881 INFO ]: Finished difference Result 97 states and 185 transitions. [2018-06-24 21:05:38,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 21:05:38,881 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-24 21:05:38,882 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:38,884 INFO ]: With dead ends: 97 [2018-06-24 21:05:38,884 INFO ]: Without dead ends: 97 [2018-06-24 21:05:38,884 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-06-24 21:05:38,884 INFO ]: Start minimizeSevpa. Operand 97 states. [2018-06-24 21:05:38,894 INFO ]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-06-24 21:05:38,894 INFO ]: Start removeUnreachable. Operand 97 states. [2018-06-24 21:05:38,896 INFO ]: Finished removeUnreachable. Reduced from 97 states to 97 states and 185 transitions. [2018-06-24 21:05:38,896 INFO ]: Start accepts. Automaton has 97 states and 185 transitions. Word has length 13 [2018-06-24 21:05:38,896 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:38,896 INFO ]: Abstraction has 97 states and 185 transitions. [2018-06-24 21:05:38,896 INFO ]: Interpolant automaton has 12 states. [2018-06-24 21:05:38,896 INFO ]: Start isEmpty. Operand 97 states and 185 transitions. [2018-06-24 21:05:38,896 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 21:05:38,896 INFO ]: Found error trace [2018-06-24 21:05:38,896 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-06-24 21:05:38,896 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:38,897 INFO ]: Analyzing trace with hash -2034010517, now seen corresponding path program 10 times [2018-06-24 21:05:38,897 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:38,897 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:38,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:38,897 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:38,897 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:38,911 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:39,097 INFO ]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:39,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:39,097 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:39,104 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:05:39,132 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:05:39,132 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:39,135 INFO ]: Computing forward predicates... [2018-06-24 21:05:39,371 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:39,389 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:39,389 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-06-24 21:05:39,390 INFO ]: Interpolant automaton has 22 states [2018-06-24 21:05:39,390 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 21:05:39,390 INFO ]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-06-24 21:05:39,390 INFO ]: Start difference. First operand 97 states and 185 transitions. Second operand 22 states. [2018-06-24 21:05:40,725 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:40,725 INFO ]: Finished difference Result 115 states and 197 transitions. [2018-06-24 21:05:40,728 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 21:05:40,728 INFO ]: Start accepts. Automaton has 22 states. Word has length 14 [2018-06-24 21:05:40,728 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:40,729 INFO ]: With dead ends: 115 [2018-06-24 21:05:40,729 INFO ]: Without dead ends: 48 [2018-06-24 21:05:40,729 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=470, Invalid=2080, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 21:05:40,730 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-24 21:05:40,738 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-06-24 21:05:40,738 INFO ]: Start removeUnreachable. Operand 48 states. [2018-06-24 21:05:40,739 INFO ]: Finished removeUnreachable. Reduced from 48 states to 48 states and 86 transitions. [2018-06-24 21:05:40,739 INFO ]: Start accepts. Automaton has 48 states and 86 transitions. Word has length 14 [2018-06-24 21:05:40,739 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:40,739 INFO ]: Abstraction has 48 states and 86 transitions. [2018-06-24 21:05:40,739 INFO ]: Interpolant automaton has 22 states. [2018-06-24 21:05:40,739 INFO ]: Start isEmpty. Operand 48 states and 86 transitions. [2018-06-24 21:05:40,740 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 21:05:40,740 INFO ]: Found error trace [2018-06-24 21:05:40,740 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2018-06-24 21:05:40,740 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:40,740 INFO ]: Analyzing trace with hash 2049886374, now seen corresponding path program 11 times [2018-06-24 21:05:40,740 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:40,740 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:40,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:40,740 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:40,740 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:40,769 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:41,208 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:41,208 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:41,208 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:41,214 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:05:41,251 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 21:05:41,251 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:41,254 INFO ]: Computing forward predicates... [2018-06-24 21:05:41,394 INFO ]: Checked inductivity of 55 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:05:41,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:41,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-06-24 21:05:41,414 INFO ]: Interpolant automaton has 19 states [2018-06-24 21:05:41,415 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 21:05:41,415 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-24 21:05:41,415 INFO ]: Start difference. First operand 48 states and 86 transitions. Second operand 19 states. [2018-06-24 21:05:41,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:41,969 INFO ]: Finished difference Result 149 states and 289 transitions. [2018-06-24 21:05:41,970 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 21:05:41,970 INFO ]: Start accepts. Automaton has 19 states. Word has length 15 [2018-06-24 21:05:41,970 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:41,970 INFO ]: With dead ends: 149 [2018-06-24 21:05:41,970 INFO ]: Without dead ends: 149 [2018-06-24 21:05:41,971 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-06-24 21:05:41,971 INFO ]: Start minimizeSevpa. Operand 149 states. [2018-06-24 21:05:41,981 INFO ]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-06-24 21:05:41,981 INFO ]: Start removeUnreachable. Operand 149 states. [2018-06-24 21:05:41,982 INFO ]: Finished removeUnreachable. Reduced from 149 states to 149 states and 289 transitions. [2018-06-24 21:05:41,982 INFO ]: Start accepts. Automaton has 149 states and 289 transitions. Word has length 15 [2018-06-24 21:05:41,982 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:41,982 INFO ]: Abstraction has 149 states and 289 transitions. [2018-06-24 21:05:41,982 INFO ]: Interpolant automaton has 19 states. [2018-06-24 21:05:41,982 INFO ]: Start isEmpty. Operand 149 states and 289 transitions. [2018-06-24 21:05:41,983 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 21:05:41,983 INFO ]: Found error trace [2018-06-24 21:05:41,983 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-06-24 21:05:41,983 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:41,983 INFO ]: Analyzing trace with hash -878387255, now seen corresponding path program 12 times [2018-06-24 21:05:41,983 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:41,984 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:41,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:41,984 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:41,984 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:42,106 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:42,273 INFO ]: Checked inductivity of 66 backedges. 10 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:42,273 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:42,273 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-24 21:05:42,287 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:05:42,338 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 21:05:42,338 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:42,341 INFO ]: Computing forward predicates... [2018-06-24 21:05:42,649 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:42,669 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:42,669 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-06-24 21:05:42,670 INFO ]: Interpolant automaton has 26 states [2018-06-24 21:05:42,670 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 21:05:42,670 INFO ]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2018-06-24 21:05:42,670 INFO ]: Start difference. First operand 149 states and 289 transitions. Second operand 26 states. [2018-06-24 21:05:44,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:44,696 INFO ]: Finished difference Result 128 states and 211 transitions. [2018-06-24 21:05:44,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-06-24 21:05:44,696 INFO ]: Start accepts. Automaton has 26 states. Word has length 16 [2018-06-24 21:05:44,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:44,696 INFO ]: With dead ends: 128 [2018-06-24 21:05:44,697 INFO ]: Without dead ends: 49 [2018-06-24 21:05:44,698 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=3629, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 21:05:44,698 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 21:05:44,701 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-06-24 21:05:44,701 INFO ]: Start removeUnreachable. Operand 49 states. [2018-06-24 21:05:44,702 INFO ]: Finished removeUnreachable. Reduced from 49 states to 49 states and 87 transitions. [2018-06-24 21:05:44,702 INFO ]: Start accepts. Automaton has 49 states and 87 transitions. Word has length 16 [2018-06-24 21:05:44,702 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:44,702 INFO ]: Abstraction has 49 states and 87 transitions. [2018-06-24 21:05:44,702 INFO ]: Interpolant automaton has 26 states. [2018-06-24 21:05:44,702 INFO ]: Start isEmpty. Operand 49 states and 87 transitions. [2018-06-24 21:05:44,703 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 21:05:44,703 INFO ]: Found error trace [2018-06-24 21:05:44,703 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2018-06-24 21:05:44,703 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:44,703 INFO ]: Analyzing trace with hash -1853583548, now seen corresponding path program 13 times [2018-06-24 21:05:44,703 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:44,703 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:44,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:44,703 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:44,703 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:44,738 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:45,186 INFO ]: Checked inductivity of 78 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:05:45,186 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:45,186 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:45,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:45,245 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:45,249 INFO ]: Computing forward predicates... [2018-06-24 21:05:45,359 INFO ]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-24 21:05:45,378 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:45,378 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-06-24 21:05:45,378 INFO ]: Interpolant automaton has 16 states [2018-06-24 21:05:45,378 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 21:05:45,378 INFO ]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-06-24 21:05:45,378 INFO ]: Start difference. First operand 49 states and 87 transitions. Second operand 16 states. [2018-06-24 21:05:45,485 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:45,485 INFO ]: Finished difference Result 188 states and 367 transitions. [2018-06-24 21:05:45,485 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 21:05:45,485 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-24 21:05:45,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:45,486 INFO ]: With dead ends: 188 [2018-06-24 21:05:45,486 INFO ]: Without dead ends: 188 [2018-06-24 21:05:45,487 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-06-24 21:05:45,487 INFO ]: Start minimizeSevpa. Operand 188 states. [2018-06-24 21:05:45,497 INFO ]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-06-24 21:05:45,497 INFO ]: Start removeUnreachable. Operand 188 states. [2018-06-24 21:05:45,499 INFO ]: Finished removeUnreachable. Reduced from 188 states to 188 states and 367 transitions. [2018-06-24 21:05:45,499 INFO ]: Start accepts. Automaton has 188 states and 367 transitions. Word has length 17 [2018-06-24 21:05:45,499 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:45,499 INFO ]: Abstraction has 188 states and 367 transitions. [2018-06-24 21:05:45,500 INFO ]: Interpolant automaton has 16 states. [2018-06-24 21:05:45,500 INFO ]: Start isEmpty. Operand 188 states and 367 transitions. [2018-06-24 21:05:45,500 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:05:45,500 INFO ]: Found error trace [2018-06-24 21:05:45,500 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-06-24 21:05:45,501 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:45,501 INFO ]: Analyzing trace with hash -1626870549, now seen corresponding path program 14 times [2018-06-24 21:05:45,501 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:45,501 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:45,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:45,501 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:05:45,501 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:45,520 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:46,624 INFO ]: Checked inductivity of 91 backedges. 15 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:46,624 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:46,624 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:46,630 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:05:46,668 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:05:46,668 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:46,671 INFO ]: Computing forward predicates... [2018-06-24 21:05:47,063 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:47,083 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:47,083 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-06-24 21:05:47,083 INFO ]: Interpolant automaton has 30 states [2018-06-24 21:05:47,083 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 21:05:47,083 INFO ]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-06-24 21:05:47,084 INFO ]: Start difference. First operand 188 states and 367 transitions. Second operand 30 states. [2018-06-24 21:05:50,503 WARN ]: Spent 324.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 20 [2018-06-24 21:05:51,417 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:51,417 INFO ]: Finished difference Result 143 states and 227 transitions. [2018-06-24 21:05:51,417 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-24 21:05:51,417 INFO ]: Start accepts. Automaton has 30 states. Word has length 18 [2018-06-24 21:05:51,417 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:51,418 INFO ]: With dead ends: 143 [2018-06-24 21:05:51,418 INFO ]: Without dead ends: 50 [2018-06-24 21:05:51,420 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1253, Invalid=5887, Unknown=0, NotChecked=0, Total=7140 [2018-06-24 21:05:51,420 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 21:05:51,423 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-06-24 21:05:51,423 INFO ]: Start removeUnreachable. Operand 50 states. [2018-06-24 21:05:51,423 INFO ]: Finished removeUnreachable. Reduced from 50 states to 50 states and 88 transitions. [2018-06-24 21:05:51,423 INFO ]: Start accepts. Automaton has 50 states and 88 transitions. Word has length 18 [2018-06-24 21:05:51,423 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:51,424 INFO ]: Abstraction has 50 states and 88 transitions. [2018-06-24 21:05:51,424 INFO ]: Interpolant automaton has 30 states. [2018-06-24 21:05:51,424 INFO ]: Start isEmpty. Operand 50 states and 88 transitions. [2018-06-24 21:05:51,430 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 21:05:51,430 INFO ]: Found error trace [2018-06-24 21:05:51,430 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-06-24 21:05:51,430 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:51,430 INFO ]: Analyzing trace with hash -2019897559, now seen corresponding path program 15 times [2018-06-24 21:05:51,431 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:51,431 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:51,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:51,431 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:51,431 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:51,449 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:51,621 INFO ]: Checked inductivity of 91 backedges. 36 proven. 50 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-06-24 21:05:51,622 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:51,622 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:51,628 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:05:51,673 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 21:05:51,673 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:51,677 INFO ]: Computing forward predicates... [2018-06-24 21:05:52,314 INFO ]: Checked inductivity of 91 backedges. 28 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:52,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:52,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-06-24 21:05:52,333 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:05:52,333 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:05:52,333 INFO ]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:05:52,333 INFO ]: Start difference. First operand 50 states and 88 transitions. Second operand 25 states. [2018-06-24 21:05:53,850 WARN ]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-06-24 21:05:54,185 WARN ]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-06-24 21:05:54,597 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:54,597 INFO ]: Finished difference Result 283 states and 554 transitions. [2018-06-24 21:05:54,598 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-06-24 21:05:54,598 INFO ]: Start accepts. Automaton has 25 states. Word has length 18 [2018-06-24 21:05:54,598 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:54,600 INFO ]: With dead ends: 283 [2018-06-24 21:05:54,600 INFO ]: Without dead ends: 283 [2018-06-24 21:05:54,602 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2149 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1569, Invalid=5571, Unknown=0, NotChecked=0, Total=7140 [2018-06-24 21:05:54,603 INFO ]: Start minimizeSevpa. Operand 283 states. [2018-06-24 21:05:54,612 INFO ]: Finished minimizeSevpa. Reduced states from 283 to 221. [2018-06-24 21:05:54,612 INFO ]: Start removeUnreachable. Operand 221 states. [2018-06-24 21:05:54,618 INFO ]: Finished removeUnreachable. Reduced from 221 states to 221 states and 430 transitions. [2018-06-24 21:05:54,618 INFO ]: Start accepts. Automaton has 221 states and 430 transitions. Word has length 18 [2018-06-24 21:05:54,618 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:54,618 INFO ]: Abstraction has 221 states and 430 transitions. [2018-06-24 21:05:54,618 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:05:54,618 INFO ]: Start isEmpty. Operand 221 states and 430 transitions. [2018-06-24 21:05:54,619 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 21:05:54,619 INFO ]: Found error trace [2018-06-24 21:05:54,619 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2018-06-24 21:05:54,619 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:54,619 INFO ]: Analyzing trace with hash 1807329702, now seen corresponding path program 16 times [2018-06-24 21:05:54,619 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:54,619 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:54,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:54,620 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:54,620 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:54,663 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:55,058 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:55,058 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:55,058 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:55,065 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 21:05:55,104 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 21:05:55,104 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:55,108 INFO ]: Computing forward predicates... [2018-06-24 21:05:55,324 INFO ]: Checked inductivity of 105 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-06-24 21:05:55,356 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:55,356 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 25 [2018-06-24 21:05:55,356 INFO ]: Interpolant automaton has 25 states [2018-06-24 21:05:55,357 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 21:05:55,357 INFO ]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2018-06-24 21:05:55,357 INFO ]: Start difference. First operand 221 states and 430 transitions. Second operand 25 states. [2018-06-24 21:05:55,895 WARN ]: Spent 158.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-06-24 21:05:56,165 WARN ]: Spent 125.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2018-06-24 21:05:56,461 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2018-06-24 21:05:57,032 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:05:57,032 INFO ]: Finished difference Result 564 states and 1116 transitions. [2018-06-24 21:05:57,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:05:57,032 INFO ]: Start accepts. Automaton has 25 states. Word has length 19 [2018-06-24 21:05:57,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:05:57,035 INFO ]: With dead ends: 564 [2018-06-24 21:05:57,035 INFO ]: Without dead ends: 564 [2018-06-24 21:05:57,036 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=169, Invalid=1237, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:05:57,036 INFO ]: Start minimizeSevpa. Operand 564 states. [2018-06-24 21:05:57,061 INFO ]: Finished minimizeSevpa. Reduced states from 564 to 550. [2018-06-24 21:05:57,061 INFO ]: Start removeUnreachable. Operand 550 states. [2018-06-24 21:05:57,065 INFO ]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1088 transitions. [2018-06-24 21:05:57,065 INFO ]: Start accepts. Automaton has 550 states and 1088 transitions. Word has length 19 [2018-06-24 21:05:57,065 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:05:57,065 INFO ]: Abstraction has 550 states and 1088 transitions. [2018-06-24 21:05:57,065 INFO ]: Interpolant automaton has 25 states. [2018-06-24 21:05:57,065 INFO ]: Start isEmpty. Operand 550 states and 1088 transitions. [2018-06-24 21:05:57,066 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 21:05:57,067 INFO ]: Found error trace [2018-06-24 21:05:57,067 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-06-24 21:05:57,067 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:05:57,074 INFO ]: Analyzing trace with hash 192290505, now seen corresponding path program 17 times [2018-06-24 21:05:57,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:05:57,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:05:57,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:57,075 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:05:57,075 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:05:57,098 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:57,387 INFO ]: Checked inductivity of 120 backedges. 21 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:57,388 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:05:57,388 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:05:57,403 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:05:57,459 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 21:05:57,459 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:05:57,463 INFO ]: Computing forward predicates... [2018-06-24 21:05:57,909 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:05:57,928 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:05:57,928 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2018-06-24 21:05:57,928 INFO ]: Interpolant automaton has 34 states [2018-06-24 21:05:57,929 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 21:05:57,929 INFO ]: CoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:05:57,929 INFO ]: Start difference. First operand 550 states and 1088 transitions. Second operand 34 states. [2018-06-24 21:05:59,603 WARN ]: Spent 163.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 16 [2018-06-24 21:06:02,267 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:02,267 INFO ]: Finished difference Result 502 states and 929 transitions. [2018-06-24 21:06:02,268 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-06-24 21:06:02,268 INFO ]: Start accepts. Automaton has 34 states. Word has length 20 [2018-06-24 21:06:02,268 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:02,269 INFO ]: With dead ends: 502 [2018-06-24 21:06:02,269 INFO ]: Without dead ends: 222 [2018-06-24 21:06:02,274 INFO ]: 0 DeclaredPredicates, 108 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1882, Invalid=9038, Unknown=0, NotChecked=0, Total=10920 [2018-06-24 21:06:02,274 INFO ]: Start minimizeSevpa. Operand 222 states. [2018-06-24 21:06:02,281 INFO ]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-06-24 21:06:02,282 INFO ]: Start removeUnreachable. Operand 222 states. [2018-06-24 21:06:02,283 INFO ]: Finished removeUnreachable. Reduced from 222 states to 222 states and 431 transitions. [2018-06-24 21:06:02,283 INFO ]: Start accepts. Automaton has 222 states and 431 transitions. Word has length 20 [2018-06-24 21:06:02,283 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:02,283 INFO ]: Abstraction has 222 states and 431 transitions. [2018-06-24 21:06:02,283 INFO ]: Interpolant automaton has 34 states. [2018-06-24 21:06:02,284 INFO ]: Start isEmpty. Operand 222 states and 431 transitions. [2018-06-24 21:06:02,284 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 21:06:02,284 INFO ]: Found error trace [2018-06-24 21:06:02,284 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2018-06-24 21:06:02,284 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:02,285 INFO ]: Analyzing trace with hash 1923848388, now seen corresponding path program 18 times [2018-06-24 21:06:02,285 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:02,285 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:02,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:02,287 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:06:02,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:02,326 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:02,789 WARN ]: Spent 356.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-06-24 21:06:03,061 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:03,061 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:06:03,061 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:06:03,066 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:06:03,121 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-24 21:06:03,121 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:03,125 INFO ]: Computing forward predicates... [2018-06-24 21:06:03,330 INFO ]: Checked inductivity of 136 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-06-24 21:06:03,350 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:06:03,350 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2018-06-24 21:06:03,350 INFO ]: Interpolant automaton has 28 states [2018-06-24 21:06:03,350 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 21:06:03,351 INFO ]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2018-06-24 21:06:03,351 INFO ]: Start difference. First operand 222 states and 431 transitions. Second operand 28 states. [2018-06-24 21:06:04,000 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:04,000 INFO ]: Finished difference Result 875 states and 1738 transitions. [2018-06-24 21:06:04,005 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 21:06:04,005 INFO ]: Start accepts. Automaton has 28 states. Word has length 21 [2018-06-24 21:06:04,005 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:04,010 INFO ]: With dead ends: 875 [2018-06-24 21:06:04,010 INFO ]: Without dead ends: 875 [2018-06-24 21:06:04,010 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=1360, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 21:06:04,011 INFO ]: Start minimizeSevpa. Operand 875 states. [2018-06-24 21:06:04,038 INFO ]: Finished minimizeSevpa. Reduced states from 875 to 872. [2018-06-24 21:06:04,038 INFO ]: Start removeUnreachable. Operand 872 states. [2018-06-24 21:06:04,044 INFO ]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1732 transitions. [2018-06-24 21:06:04,044 INFO ]: Start accepts. Automaton has 872 states and 1732 transitions. Word has length 21 [2018-06-24 21:06:04,044 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:04,044 INFO ]: Abstraction has 872 states and 1732 transitions. [2018-06-24 21:06:04,044 INFO ]: Interpolant automaton has 28 states. [2018-06-24 21:06:04,044 INFO ]: Start isEmpty. Operand 872 states and 1732 transitions. [2018-06-24 21:06:04,045 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 21:06:04,045 INFO ]: Found error trace [2018-06-24 21:06:04,045 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-06-24 21:06:04,045 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:04,045 INFO ]: Analyzing trace with hash -490597525, now seen corresponding path program 19 times [2018-06-24 21:06:04,045 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:04,045 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:04,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:04,047 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:06:04,047 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:04,068 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:04,900 INFO ]: Checked inductivity of 153 backedges. 28 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:04,901 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:06:04,901 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:06:04,911 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:06:04,983 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:04,988 INFO ]: Computing forward predicates... [2018-06-24 21:06:05,768 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:05,787 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:06:05,787 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-06-24 21:06:05,787 INFO ]: Interpolant automaton has 38 states [2018-06-24 21:06:05,787 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 21:06:05,788 INFO ]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 21:06:05,788 INFO ]: Start difference. First operand 872 states and 1732 transitions. Second operand 38 states. [2018-06-24 21:06:11,834 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:11,834 INFO ]: Finished difference Result 521 states and 949 transitions. [2018-06-24 21:06:11,835 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-06-24 21:06:11,835 INFO ]: Start accepts. Automaton has 38 states. Word has length 22 [2018-06-24 21:06:11,835 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:11,836 INFO ]: With dead ends: 521 [2018-06-24 21:06:11,836 INFO ]: Without dead ends: 223 [2018-06-24 21:06:11,842 INFO ]: 0 DeclaredPredicates, 130 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4132 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2715, Invalid=13287, Unknown=0, NotChecked=0, Total=16002 [2018-06-24 21:06:11,842 INFO ]: Start minimizeSevpa. Operand 223 states. [2018-06-24 21:06:11,850 INFO ]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-06-24 21:06:11,851 INFO ]: Start removeUnreachable. Operand 223 states. [2018-06-24 21:06:11,852 INFO ]: Finished removeUnreachable. Reduced from 223 states to 223 states and 432 transitions. [2018-06-24 21:06:11,852 INFO ]: Start accepts. Automaton has 223 states and 432 transitions. Word has length 22 [2018-06-24 21:06:11,852 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:11,852 INFO ]: Abstraction has 223 states and 432 transitions. [2018-06-24 21:06:11,852 INFO ]: Interpolant automaton has 38 states. [2018-06-24 21:06:11,852 INFO ]: Start isEmpty. Operand 223 states and 432 transitions. [2018-06-24 21:06:11,852 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 21:06:11,852 INFO ]: Found error trace [2018-06-24 21:06:11,852 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2018-06-24 21:06:11,852 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:11,853 INFO ]: Analyzing trace with hash 1384184486, now seen corresponding path program 20 times [2018-06-24 21:06:11,853 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:11,853 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:11,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:11,856 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:06:11,856 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:11,926 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:12,349 WARN ]: Spent 336.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-06-24 21:06:12,830 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:12,830 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:06:12,830 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:06:12,837 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 21:06:12,893 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 21:06:12,893 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:12,897 INFO ]: Computing forward predicates... [2018-06-24 21:06:13,189 INFO ]: Checked inductivity of 171 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:06:13,210 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:06:13,210 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 31 [2018-06-24 21:06:13,210 INFO ]: Interpolant automaton has 31 states [2018-06-24 21:06:13,210 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 21:06:13,211 INFO ]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2018-06-24 21:06:13,211 INFO ]: Start difference. First operand 223 states and 432 transitions. Second operand 31 states. [2018-06-24 21:06:15,296 WARN ]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 93 [2018-06-24 21:06:18,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:18,392 INFO ]: Finished difference Result 2283 states and 4560 transitions. [2018-06-24 21:06:18,393 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-06-24 21:06:18,393 INFO ]: Start accepts. Automaton has 31 states. Word has length 23 [2018-06-24 21:06:18,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:18,404 INFO ]: With dead ends: 2283 [2018-06-24 21:06:18,404 INFO ]: Without dead ends: 2283 [2018-06-24 21:06:18,405 INFO ]: 0 DeclaredPredicates, 143 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5278 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1486, Invalid=15544, Unknown=0, NotChecked=0, Total=17030 [2018-06-24 21:06:18,406 INFO ]: Start minimizeSevpa. Operand 2283 states. [2018-06-24 21:06:18,460 INFO ]: Finished minimizeSevpa. Reduced states from 2283 to 1885. [2018-06-24 21:06:18,460 INFO ]: Start removeUnreachable. Operand 1885 states. [2018-06-24 21:06:18,467 INFO ]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 3764 transitions. [2018-06-24 21:06:18,467 INFO ]: Start accepts. Automaton has 1885 states and 3764 transitions. Word has length 23 [2018-06-24 21:06:18,468 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:18,468 INFO ]: Abstraction has 1885 states and 3764 transitions. [2018-06-24 21:06:18,468 INFO ]: Interpolant automaton has 31 states. [2018-06-24 21:06:18,468 INFO ]: Start isEmpty. Operand 1885 states and 3764 transitions. [2018-06-24 21:06:18,468 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 21:06:18,468 INFO ]: Found error trace [2018-06-24 21:06:18,469 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2018-06-24 21:06:18,469 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:18,469 INFO ]: Analyzing trace with hash 2033906244, now seen corresponding path program 21 times [2018-06-24 21:06:18,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:18,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:18,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:18,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:06:18,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:18,522 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:18,733 WARN ]: Spent 101.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-06-24 21:06:19,126 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:19,126 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:06:19,126 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:06:19,131 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 21:06:19,209 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-24 21:06:19,209 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:19,213 INFO ]: Computing forward predicates... [2018-06-24 21:06:19,518 INFO ]: Checked inductivity of 210 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-24 21:06:19,537 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:06:19,537 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 34 [2018-06-24 21:06:19,553 INFO ]: Interpolant automaton has 34 states [2018-06-24 21:06:19,553 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 21:06:19,553 INFO ]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 21:06:19,553 INFO ]: Start difference. First operand 1885 states and 3764 transitions. Second operand 34 states. [2018-06-24 21:06:20,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:20,737 INFO ]: Finished difference Result 2957 states and 5911 transitions. [2018-06-24 21:06:20,738 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 21:06:20,738 INFO ]: Start accepts. Automaton has 34 states. Word has length 25 [2018-06-24 21:06:20,738 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:20,750 INFO ]: With dead ends: 2957 [2018-06-24 21:06:20,750 INFO ]: Without dead ends: 2957 [2018-06-24 21:06:20,751 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 10 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 744 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=318, Invalid=2874, Unknown=0, NotChecked=0, Total=3192 [2018-06-24 21:06:20,752 INFO ]: Start minimizeSevpa. Operand 2957 states. [2018-06-24 21:06:20,817 INFO ]: Finished minimizeSevpa. Reduced states from 2957 to 2094. [2018-06-24 21:06:20,817 INFO ]: Start removeUnreachable. Operand 2094 states. [2018-06-24 21:06:20,823 INFO ]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4183 transitions. [2018-06-24 21:06:20,824 INFO ]: Start accepts. Automaton has 2094 states and 4183 transitions. Word has length 25 [2018-06-24 21:06:20,824 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:20,824 INFO ]: Abstraction has 2094 states and 4183 transitions. [2018-06-24 21:06:20,824 INFO ]: Interpolant automaton has 34 states. [2018-06-24 21:06:20,824 INFO ]: Start isEmpty. Operand 2094 states and 4183 transitions. [2018-06-24 21:06:20,825 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:06:20,825 INFO ]: Found error trace [2018-06-24 21:06:20,825 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-06-24 21:06:20,825 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:20,825 INFO ]: Analyzing trace with hash -92060565, now seen corresponding path program 22 times [2018-06-24 21:06:20,825 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:20,825 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:20,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:20,825 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:06:20,825 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:20,841 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:20,875 INFO ]: Checked inductivity of 231 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-06-24 21:06:20,875 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 21:06:20,875 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 21:06:20,875 INFO ]: Interpolant automaton has 3 states [2018-06-24 21:06:20,875 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 21:06:20,875 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:06:20,876 INFO ]: Start difference. First operand 2094 states and 4183 transitions. Second operand 3 states. [2018-06-24 21:06:20,879 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:20,880 INFO ]: Finished difference Result 47 states and 50 transitions. [2018-06-24 21:06:20,880 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 21:06:20,880 INFO ]: Start accepts. Automaton has 3 states. Word has length 26 [2018-06-24 21:06:20,880 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:20,880 INFO ]: With dead ends: 47 [2018-06-24 21:06:20,880 INFO ]: Without dead ends: 37 [2018-06-24 21:06:20,880 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 21:06:20,880 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 21:06:20,881 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-06-24 21:06:20,881 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 21:06:20,881 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 21:06:20,881 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-06-24 21:06:20,881 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:20,881 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 21:06:20,881 INFO ]: Interpolant automaton has 3 states. [2018-06-24 21:06:20,881 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 21:06:20,881 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:06:20,881 INFO ]: Found error trace [2018-06-24 21:06:20,881 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-06-24 21:06:20,881 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:20,881 INFO ]: Analyzing trace with hash -1373771285, now seen corresponding path program 23 times [2018-06-24 21:06:20,881 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:20,881 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:20,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:20,882 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:06:20,882 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:20,910 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:21,468 INFO ]: Checked inductivity of 231 backedges. 45 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:21,468 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:06:21,468 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:06:21,487 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 21:06:21,562 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-06-24 21:06:21,562 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:21,566 INFO ]: Computing forward predicates... [2018-06-24 21:06:22,283 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:22,302 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:06:22,302 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2018-06-24 21:06:22,302 INFO ]: Interpolant automaton has 46 states [2018-06-24 21:06:22,303 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-24 21:06:22,303 INFO ]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 21:06:22,303 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 46 states. [2018-06-24 21:06:23,047 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:23,047 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-24 21:06:23,047 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 21:06:23,047 INFO ]: Start accepts. Automaton has 46 states. Word has length 26 [2018-06-24 21:06:23,048 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:23,048 INFO ]: With dead ends: 39 [2018-06-24 21:06:23,048 INFO ]: Without dead ends: 27 [2018-06-24 21:06:23,048 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=423, Invalid=2883, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 21:06:23,048 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 21:06:23,049 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 21:06:23,049 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 21:06:23,049 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-24 21:06:23,049 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-24 21:06:23,049 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:23,049 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-24 21:06:23,049 INFO ]: Interpolant automaton has 46 states. [2018-06-24 21:06:23,049 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-24 21:06:23,049 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 21:06:23,049 INFO ]: Found error trace [2018-06-24 21:06:23,049 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-06-24 21:06:23,049 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:23,049 INFO ]: Analyzing trace with hash 1910078761, now seen corresponding path program 24 times [2018-06-24 21:06:23,049 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:23,049 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:23,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:23,050 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:06:23,050 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:23,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:23,534 INFO ]: Checked inductivity of 231 backedges. 100 proven. 122 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-06-24 21:06:23,534 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:06:23,534 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:06:23,540 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 21:06:23,608 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-06-24 21:06:23,608 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:23,614 INFO ]: Computing forward predicates... [2018-06-24 21:06:24,290 INFO ]: Checked inductivity of 231 backedges. 176 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:24,309 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:06:24,309 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23] total 36 [2018-06-24 21:06:24,309 INFO ]: Interpolant automaton has 36 states [2018-06-24 21:06:24,310 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 21:06:24,310 INFO ]: CoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 21:06:24,310 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 36 states. [2018-06-24 21:06:28,157 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 21:06:28,157 INFO ]: Finished difference Result 103 states and 114 transitions. [2018-06-24 21:06:28,157 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-06-24 21:06:28,157 INFO ]: Start accepts. Automaton has 36 states. Word has length 26 [2018-06-24 21:06:28,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 21:06:28,158 INFO ]: With dead ends: 103 [2018-06-24 21:06:28,158 INFO ]: Without dead ends: 103 [2018-06-24 21:06:28,159 INFO ]: 0 DeclaredPredicates, 145 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4453 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4380, Invalid=12912, Unknown=0, NotChecked=0, Total=17292 [2018-06-24 21:06:28,159 INFO ]: Start minimizeSevpa. Operand 103 states. [2018-06-24 21:06:28,160 INFO ]: Finished minimizeSevpa. Reduced states from 103 to 38. [2018-06-24 21:06:28,160 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 21:06:28,160 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2018-06-24 21:06:28,160 INFO ]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 26 [2018-06-24 21:06:28,161 INFO ]: Finished accepts. word is rejected. [2018-06-24 21:06:28,161 INFO ]: Abstraction has 38 states and 44 transitions. [2018-06-24 21:06:28,161 INFO ]: Interpolant automaton has 36 states. [2018-06-24 21:06:28,161 INFO ]: Start isEmpty. Operand 38 states and 44 transitions. [2018-06-24 21:06:28,162 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 21:06:28,162 INFO ]: Found error trace [2018-06-24 21:06:28,162 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1] [2018-06-24 21:06:28,162 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 21:06:28,162 INFO ]: Analyzing trace with hash -917455962, now seen corresponding path program 25 times [2018-06-24 21:06:28,162 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 21:06:28,162 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 21:06:28,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:28,163 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 21:06:28,163 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 21:06:28,212 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:28,638 WARN ]: Spent 334.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 18 [2018-06-24 21:06:29,184 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 21:06:29,184 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 21:06:29,184 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 21:06:29,191 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 21:06:29,250 INFO ]: Conjunction of SSA is unsat [2018-06-24 21:06:29,255 INFO ]: Computing forward predicates... [2018-06-24 21:06:30,140 INFO ]: Checked inductivity of 253 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-06-24 21:06:30,159 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 21:06:30,169 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 37 [2018-06-24 21:06:30,169 INFO ]: Interpolant automaton has 37 states [2018-06-24 21:06:30,170 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 21:06:30,170 INFO ]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 21:06:30,170 INFO ]: Start difference. First operand 38 states and 44 transitions. Second operand 37 states. Received shutdown request... [2018-06-24 21:06:31,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 21:06:31,232 WARN ]: Verification canceled [2018-06-24 21:06:31,233 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 21:06:31,234 WARN ]: Timeout [2018-06-24 21:06:31,234 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 09:06:31 BasicIcfg [2018-06-24 21:06:31,234 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 21:06:31,235 INFO ]: Toolchain (without parser) took 61915.43 ms. Allocated memory was 301.5 MB in the beginning and 896.5 MB in the end (delta: 595.1 MB). Free memory was 255.9 MB in the beginning and 679.5 MB in the end (delta: -423.6 MB). Peak memory consumption was 171.4 MB. Max. memory is 3.6 GB. [2018-06-24 21:06:31,236 INFO ]: SmtParser took 0.08 ms. Allocated memory is still 301.5 MB. Free memory is still 265.0 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 21:06:31,236 INFO ]: ChcToBoogie took 55.64 ms. Allocated memory is still 301.5 MB. Free memory was 255.9 MB in the beginning and 252.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:06:31,236 INFO ]: Boogie Preprocessor took 34.80 ms. Allocated memory is still 301.5 MB. Free memory was 252.9 MB in the beginning and 251.9 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. [2018-06-24 21:06:31,237 INFO ]: RCFGBuilder took 309.59 ms. Allocated memory is still 301.5 MB. Free memory was 251.9 MB in the beginning and 243.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:06:31,237 INFO ]: BlockEncodingV2 took 92.62 ms. Allocated memory is still 301.5 MB. Free memory was 243.9 MB in the beginning and 240.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-24 21:06:31,237 INFO ]: TraceAbstraction took 61413.53 ms. Allocated memory was 301.5 MB in the beginning and 896.5 MB in the end (delta: 595.1 MB). Free memory was 240.9 MB in the beginning and 679.5 MB in the end (delta: -438.6 MB). Peak memory consumption was 156.5 MB. Max. memory is 3.6 GB. [2018-06-24 21:06:31,240 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 10 locations, 12 edges - StatisticsResult: Encoded RCFG 6 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.08 ms. Allocated memory is still 301.5 MB. Free memory is still 265.0 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 55.64 ms. Allocated memory is still 301.5 MB. Free memory was 255.9 MB in the beginning and 252.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 34.80 ms. Allocated memory is still 301.5 MB. Free memory was 252.9 MB in the beginning and 251.9 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 3.6 GB. * RCFGBuilder took 309.59 ms. Allocated memory is still 301.5 MB. Free memory was 251.9 MB in the beginning and 243.9 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 92.62 ms. Allocated memory is still 301.5 MB. Free memory was 243.9 MB in the beginning and 240.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 61413.53 ms. Allocated memory was 301.5 MB in the beginning and 896.5 MB in the end (delta: 595.1 MB). Free memory was 240.9 MB in the beginning and 679.5 MB in the end (delta: -438.6 MB). Peak memory consumption was 156.5 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 BasicCegarLoop was constructing difference of abstraction (38states) and interpolant automaton (currently 22 states, 37 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 57 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 61.3s OverallTime, 28 OverallIterations, 11 TraceHistogramMax, 39.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 137 SDtfs, 9 SDslu, 1003 SDs, 0 SdLazy, 7542 SolverSat, 1266 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1447 GetRequests, 193 SyntacticMatches, 40 SemanticMatches, 1213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24978 ImplicationChecksByTransitivity, 47.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2094occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 1424 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 18.7s InterpolantComputationTime, 849 NumberOfCodeBlocks, 849 NumberOfCodeBlocksAsserted, 136 NumberOfCheckSat, 795 ConstructedInterpolants, 157 QuantifiedInterpolants, 181372 SizeOfPredicates, 82 NumberOfNonLiveVariables, 8850 ConjunctsInSsa, 1810 ConjunctsInUnsatCore, 54 InterpolantComputations, 3 PerfectInterpolantSequences, 817/4613 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/019b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_21-06-31-251.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/019b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_21-06-31-251.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/019b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_21-06-31-251.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/019b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_21-06-31-251.csv Completed graceful shutdown