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/003b-horn.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:57:23,138 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:57:23,140 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:57:23,152 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:57:23,152 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:57:23,153 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:57:23,154 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:57:23,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:57:23,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:57:23,166 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:57:23,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:57:23,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:57:23,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:57:23,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:57:23,171 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:57:23,172 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:57:23,173 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:57:23,174 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:57:23,184 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:57:23,185 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:57:23,186 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:57:23,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:57:23,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:57:23,192 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:57:23,192 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:57:23,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:57:23,197 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:57:23,198 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:57:23,198 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:57:23,199 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:57:23,199 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:57:23,201 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:57:23,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:57:23,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:57:23,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:57:23,203 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:57:23,203 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:57:23,226 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:57:23,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:57:23,226 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:57:23,226 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:57:23,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:57:23,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:57:23,230 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:57:23,231 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:57:23,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:57:23,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:57:23,231 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:57:23,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:57:23,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:57:23,232 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:57:23,232 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:57:23,232 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:57:23,232 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:57:23,233 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:57:23,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:57:23,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:57:23,233 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:57:23,235 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:57:23,235 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:57:23,273 INFO ]: Repository-Root is: /tmp [2018-06-26 17:57:23,284 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:57:23,287 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:57:23,288 INFO ]: Initializing SmtParser... [2018-06-26 17:57:23,288 INFO ]: SmtParser initialized [2018-06-26 17:57:23,289 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/reve/003b-horn.smt2 [2018-06-26 17:57:23,290 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:57:23,375 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003b-horn.smt2 unknown [2018-06-26 17:57:23,545 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/reve/003b-horn.smt2 [2018-06-26 17:57:23,550 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:57:23,556 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:57:23,557 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:57:23,557 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:57:23,557 INFO ]: ChcToBoogie initialized [2018-06-26 17:57:23,561 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,615 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23 Unit [2018-06-26 17:57:23,615 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:57:23,616 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:57:23,616 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:57:23,616 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:57:23,640 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,640 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,646 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,646 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,650 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,652 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,660 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:23,662 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:57:23,662 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:57:23,662 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:57:23,662 INFO ]: RCFGBuilder initialized [2018-06-26 17:57:23,663 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (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-26 17:57:23,686 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:57:23,687 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:57:23,687 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:57:23,687 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:57:23,687 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:57:23,687 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-26 17:57:23,999 INFO ]: Using library mode [2018-06-26 17:57:23,999 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:57:23 BoogieIcfgContainer [2018-06-26 17:57:23,999 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:57:24,000 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:57:24,000 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:57:24,001 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:57:24,001 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:57:23" (1/1) ... [2018-06-26 17:57:24,018 INFO ]: Initial Icfg 10 locations, 12 edges [2018-06-26 17:57:24,020 INFO ]: Using Remove infeasible edges [2018-06-26 17:57:24,020 INFO ]: Using Maximize final states [2018-06-26 17:57:24,021 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:57:24,021 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:57:24,025 INFO ]: Using Remove sink states [2018-06-26 17:57:24,025 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:57:24,025 INFO ]: Using Use SBE [2018-06-26 17:57:24,033 INFO ]: SBE split 0 edges [2018-06-26 17:57:24,043 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:57:24,045 INFO ]: 0 new accepting states [2018-06-26 17:57:24,093 INFO ]: Removed 4 edges and 2 locations by large block encoding [2018-06-26 17:57:24,095 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:57:24,100 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:57:24,100 INFO ]: 0 new accepting states [2018-06-26 17:57:24,100 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:57:24,100 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:57:24,100 INFO ]: Encoded RCFG 6 locations, 8 edges [2018-06-26 17:57:24,101 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:57:24 BasicIcfg [2018-06-26 17:57:24,101 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:57:24,101 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:57:24,101 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:57:24,103 INFO ]: TraceAbstraction initialized [2018-06-26 17:57:24,104 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:57:23" (1/4) ... [2018-06-26 17:57:24,104 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4573d9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:57:24, skipping insertion in model container [2018-06-26 17:57:24,104 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:57:23" (2/4) ... [2018-06-26 17:57:24,105 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4573d9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:57:24, skipping insertion in model container [2018-06-26 17:57:24,105 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:57:23" (3/4) ... [2018-06-26 17:57:24,105 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4573d9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:57:24, skipping insertion in model container [2018-06-26 17:57:24,105 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:57:24" (4/4) ... [2018-06-26 17:57:24,107 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:57:24,122 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:57:24,127 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:57:24,158 INFO ]: Using default assertion order modulation [2018-06-26 17:57:24,158 INFO ]: Interprodecural is true [2018-06-26 17:57:24,158 INFO ]: Hoare is false [2018-06-26 17:57:24,158 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:57:24,158 INFO ]: Backedges is TWOTRACK [2018-06-26 17:57:24,158 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:57:24,158 INFO ]: Difference is false [2018-06-26 17:57:24,158 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:57:24,158 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:57:24,167 INFO ]: Start isEmpty. Operand 6 states. [2018-06-26 17:57:24,175 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-26 17:57:24,175 INFO ]: Found error trace [2018-06-26 17:57:24,176 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-26 17:57:24,176 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:24,181 INFO ]: Analyzing trace with hash 37311172, now seen corresponding path program 1 times [2018-06-26 17:57:24,182 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:24,183 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:24,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:24,213 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:24,213 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:24,272 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:24,370 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:24,372 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:57:24,372 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:57:24,373 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:57:24,382 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:57:24,383 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:24,384 INFO ]: Start difference. First operand 6 states. Second operand 3 states. [2018-06-26 17:57:24,491 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:24,491 INFO ]: Finished difference Result 7 states and 11 transitions. [2018-06-26 17:57:24,491 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:57:24,492 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-26 17:57:24,493 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:24,499 INFO ]: With dead ends: 7 [2018-06-26 17:57:24,499 INFO ]: Without dead ends: 7 [2018-06-26 17:57:24,501 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:24,514 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-26 17:57:24,525 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-26 17:57:24,526 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-26 17:57:24,526 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-06-26 17:57:24,527 INFO ]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-06-26 17:57:24,527 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:24,527 INFO ]: Abstraction has 7 states and 11 transitions. [2018-06-26 17:57:24,527 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:57:24,527 INFO ]: Start isEmpty. Operand 7 states and 11 transitions. [2018-06-26 17:57:24,527 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:57:24,527 INFO ]: Found error trace [2018-06-26 17:57:24,527 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:57:24,527 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:24,527 INFO ]: Analyzing trace with hash 1156261132, now seen corresponding path program 1 times [2018-06-26 17:57:24,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:24,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:24,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:24,528 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:24,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:24,557 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:24,732 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:24,733 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:24,733 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:24,742 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:24,810 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:24,823 INFO ]: Computing forward predicates... [2018-06-26 17:57:24,893 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:24,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:24,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-06-26 17:57:24,913 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:57:24,914 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:57:24,914 INFO ]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:57:24,914 INFO ]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-06-26 17:57:24,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:24,976 INFO ]: Finished difference Result 8 states and 14 transitions. [2018-06-26 17:57:24,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:57:24,976 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 17:57:24,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:24,977 INFO ]: With dead ends: 8 [2018-06-26 17:57:24,977 INFO ]: Without dead ends: 8 [2018-06-26 17:57:24,978 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:57:24,978 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:57:24,979 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:57:24,979 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:57:24,979 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2018-06-26 17:57:24,979 INFO ]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 6 [2018-06-26 17:57:24,979 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:24,979 INFO ]: Abstraction has 8 states and 14 transitions. [2018-06-26 17:57:24,979 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:57:24,979 INFO ]: Start isEmpty. Operand 8 states and 14 transitions. [2018-06-26 17:57:24,980 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:57:24,980 INFO ]: Found error trace [2018-06-26 17:57:24,980 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:57:24,980 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:24,980 INFO ]: Analyzing trace with hash 1156320714, now seen corresponding path program 1 times [2018-06-26 17:57:24,980 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:24,980 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:24,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:24,981 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:24,981 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:25,000 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:25,036 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:25,036 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:57:25,036 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:57:25,036 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:57:25,036 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:57:25,036 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:25,037 INFO ]: Start difference. First operand 8 states and 14 transitions. Second operand 3 states. [2018-06-26 17:57:25,128 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:25,128 INFO ]: Finished difference Result 9 states and 16 transitions. [2018-06-26 17:57:25,128 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:57:25,128 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 17:57:25,128 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:25,129 INFO ]: With dead ends: 9 [2018-06-26 17:57:25,129 INFO ]: Without dead ends: 8 [2018-06-26 17:57:25,129 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:57:25,129 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:57:25,130 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:57:25,130 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:57:25,131 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-26 17:57:25,131 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-26 17:57:25,131 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:25,131 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-26 17:57:25,131 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:57:25,131 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-26 17:57:25,131 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:57:25,131 INFO ]: Found error trace [2018-06-26 17:57:25,131 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:57:25,131 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:25,131 INFO ]: Analyzing trace with hash 1156350505, now seen corresponding path program 1 times [2018-06-26 17:57:25,132 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:25,132 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:25,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:25,132 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:25,132 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:25,146 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:25,290 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:25,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:25,291 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:57:25,307 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:25,363 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:25,366 INFO ]: Computing forward predicates... [2018-06-26 17:57:25,496 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:25,532 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:57:25,532 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-06-26 17:57:25,533 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:57:25,533 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:57:25,533 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:57:25,533 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 5 states. [2018-06-26 17:57:25,618 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:25,618 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-26 17:57:25,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:57:25,619 INFO ]: Start accepts. Automaton has 5 states. Word has length 6 [2018-06-26 17:57:25,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:25,620 INFO ]: With dead ends: 10 [2018-06-26 17:57:25,620 INFO ]: Without dead ends: 8 [2018-06-26 17:57:25,620 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:57:25,620 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:57:25,621 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:57:25,621 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:57:25,621 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-06-26 17:57:25,621 INFO ]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-06-26 17:57:25,621 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:25,621 INFO ]: Abstraction has 8 states and 8 transitions. [2018-06-26 17:57:25,621 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:57:25,621 INFO ]: Start isEmpty. Operand 8 states and 8 transitions. [2018-06-26 17:57:25,622 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:57:25,622 INFO ]: Found error trace [2018-06-26 17:57:25,622 INFO ]: trace histogram [2, 1, 1, 1, 1, 1] [2018-06-26 17:57:25,622 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:25,622 INFO ]: Analyzing trace with hash 1483971524, now seen corresponding path program 2 times [2018-06-26 17:57:25,622 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:25,622 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:25,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:25,623 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:25,623 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:25,696 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:25,931 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:25,931 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:25,931 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:25,937 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:57:25,994 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:57:25,994 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:25,997 INFO ]: Computing forward predicates... [2018-06-26 17:57:26,235 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:26,257 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:26,257 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 17:57:26,257 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:57:26,257 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:57:26,257 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:57:26,257 INFO ]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-06-26 17:57:26,307 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:26,307 INFO ]: Finished difference Result 9 states and 9 transitions. [2018-06-26 17:57:26,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:57:26,308 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 17:57:26,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:26,308 INFO ]: With dead ends: 9 [2018-06-26 17:57:26,308 INFO ]: Without dead ends: 9 [2018-06-26 17:57:26,309 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:57:26,309 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:57:26,310 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:57:26,310 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:57:26,310 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-06-26 17:57:26,310 INFO ]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-06-26 17:57:26,310 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:26,310 INFO ]: Abstraction has 9 states and 9 transitions. [2018-06-26 17:57:26,310 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:57:26,310 INFO ]: Start isEmpty. Operand 9 states and 9 transitions. [2018-06-26 17:57:26,310 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:57:26,310 INFO ]: Found error trace [2018-06-26 17:57:26,310 INFO ]: trace histogram [3, 1, 1, 1, 1, 1] [2018-06-26 17:57:26,311 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:26,311 INFO ]: Analyzing trace with hash -1241908212, now seen corresponding path program 3 times [2018-06-26 17:57:26,311 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:26,311 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:26,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:26,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:26,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:26,349 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:26,713 WARN ]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-06-26 17:57:26,714 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:26,714 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:26,714 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:57:26,727 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:26,792 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:57:26,792 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:26,795 INFO ]: Computing forward predicates... [2018-06-26 17:57:26,879 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:26,898 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:26,899 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-06-26 17:57:26,899 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:57:26,899 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:57:26,899 INFO ]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:57:26,899 INFO ]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-06-26 17:57:26,938 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:26,938 INFO ]: Finished difference Result 10 states and 10 transitions. [2018-06-26 17:57:26,938 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:57:26,938 INFO ]: Start accepts. Automaton has 8 states. Word has length 8 [2018-06-26 17:57:26,938 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:26,939 INFO ]: With dead ends: 10 [2018-06-26 17:57:26,939 INFO ]: Without dead ends: 10 [2018-06-26 17:57:26,939 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:57:26,939 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:57:26,940 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:57:26,940 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:57:26,940 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-06-26 17:57:26,941 INFO ]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-06-26 17:57:26,941 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:26,941 INFO ]: Abstraction has 10 states and 10 transitions. [2018-06-26 17:57:26,941 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:57:26,941 INFO ]: Start isEmpty. Operand 10 states and 10 transitions. [2018-06-26 17:57:26,948 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:57:26,948 INFO ]: Found error trace [2018-06-26 17:57:26,948 INFO ]: trace histogram [4, 1, 1, 1, 1, 1] [2018-06-26 17:57:26,948 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:26,948 INFO ]: Analyzing trace with hash 155165892, now seen corresponding path program 4 times [2018-06-26 17:57:26,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:26,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:26,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:26,949 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:26,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:26,989 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:27,726 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:27,727 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:27,727 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:27,733 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:57:27,772 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:57:27,772 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:27,776 INFO ]: Computing forward predicates... [2018-06-26 17:57:27,946 INFO ]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:27,976 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:27,976 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-26 17:57:27,976 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:57:27,976 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:57:27,976 INFO ]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:57:27,976 INFO ]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-06-26 17:57:28,012 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:28,012 INFO ]: Finished difference Result 11 states and 11 transitions. [2018-06-26 17:57:28,013 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:57:28,013 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-26 17:57:28,013 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:28,013 INFO ]: With dead ends: 11 [2018-06-26 17:57:28,013 INFO ]: Without dead ends: 11 [2018-06-26 17:57:28,013 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:57:28,013 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:57:28,015 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:57:28,015 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:57:28,015 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-06-26 17:57:28,015 INFO ]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-06-26 17:57:28,015 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:28,015 INFO ]: Abstraction has 11 states and 11 transitions. [2018-06-26 17:57:28,015 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:57:28,015 INFO ]: Start isEmpty. Operand 11 states and 11 transitions. [2018-06-26 17:57:28,015 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:57:28,015 INFO ]: Found error trace [2018-06-26 17:57:28,015 INFO ]: trace histogram [5, 1, 1, 1, 1, 1] [2018-06-26 17:57:28,016 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:28,016 INFO ]: Analyzing trace with hash 514790156, now seen corresponding path program 5 times [2018-06-26 17:57:28,016 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:28,016 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:28,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:28,016 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:28,016 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:28,044 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:28,230 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:28,230 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:28,230 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-26 17:57:28,246 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:57:28,319 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:57:28,319 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:28,323 INFO ]: Computing forward predicates... [2018-06-26 17:57:28,455 INFO ]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:28,488 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:28,488 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 17:57:28,488 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:57:28,488 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:57:28,488 INFO ]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:57:28,489 INFO ]: Start difference. First operand 11 states and 11 transitions. Second operand 9 states. [2018-06-26 17:57:28,539 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:28,539 INFO ]: Finished difference Result 12 states and 12 transitions. [2018-06-26 17:57:28,540 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:57:28,540 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-26 17:57:28,540 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:28,540 INFO ]: With dead ends: 12 [2018-06-26 17:57:28,540 INFO ]: Without dead ends: 12 [2018-06-26 17:57:28,541 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:57:28,541 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:57:28,542 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 17:57:28,542 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:57:28,543 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-06-26 17:57:28,543 INFO ]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-06-26 17:57:28,543 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:28,543 INFO ]: Abstraction has 12 states and 12 transitions. [2018-06-26 17:57:28,543 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:57:28,543 INFO ]: Start isEmpty. Operand 12 states and 12 transitions. [2018-06-26 17:57:28,543 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:57:28,543 INFO ]: Found error trace [2018-06-26 17:57:28,543 INFO ]: trace histogram [6, 1, 1, 1, 1, 1] [2018-06-26 17:57:28,543 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:28,543 INFO ]: Analyzing trace with hash -1221759548, now seen corresponding path program 6 times [2018-06-26 17:57:28,543 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:28,543 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:28,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:28,544 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:28,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:28,575 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:28,715 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:28,715 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:28,715 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-26 17:57:28,729 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:57:28,803 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:57:28,803 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:28,808 INFO ]: Computing forward predicates... [2018-06-26 17:57:29,019 INFO ]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:29,039 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:29,039 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-26 17:57:29,039 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:57:29,039 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:57:29,039 INFO ]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:57:29,040 INFO ]: Start difference. First operand 12 states and 12 transitions. Second operand 10 states. [2018-06-26 17:57:29,098 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:29,098 INFO ]: Finished difference Result 13 states and 13 transitions. [2018-06-26 17:57:29,099 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:57:29,099 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 17:57:29,099 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:29,099 INFO ]: With dead ends: 13 [2018-06-26 17:57:29,099 INFO ]: Without dead ends: 13 [2018-06-26 17:57:29,100 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:57:29,100 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:57:29,101 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:57:29,101 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:57:29,101 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-06-26 17:57:29,101 INFO ]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-06-26 17:57:29,101 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:29,101 INFO ]: Abstraction has 13 states and 13 transitions. [2018-06-26 17:57:29,101 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:57:29,102 INFO ]: Start isEmpty. Operand 13 states and 13 transitions. [2018-06-26 17:57:29,102 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:57:29,102 INFO ]: Found error trace [2018-06-26 17:57:29,102 INFO ]: trace histogram [7, 1, 1, 1, 1, 1] [2018-06-26 17:57:29,102 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:29,102 INFO ]: Analyzing trace with hash 779774476, now seen corresponding path program 7 times [2018-06-26 17:57:29,102 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:29,102 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:29,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:29,103 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:29,103 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:29,130 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:29,429 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:29,429 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:29,429 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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:29,439 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:29,496 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:29,502 INFO ]: Computing forward predicates... [2018-06-26 17:57:29,653 INFO ]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:29,673 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:29,673 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2018-06-26 17:57:29,673 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:57:29,673 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:57:29,673 INFO ]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:57:29,673 INFO ]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-06-26 17:57:29,782 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:29,782 INFO ]: Finished difference Result 14 states and 14 transitions. [2018-06-26 17:57:29,783 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:57:29,783 INFO ]: Start accepts. Automaton has 12 states. Word has length 12 [2018-06-26 17:57:29,783 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:29,783 INFO ]: With dead ends: 14 [2018-06-26 17:57:29,783 INFO ]: Without dead ends: 14 [2018-06-26 17:57:29,783 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:57:29,784 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:57:29,785 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:57:29,785 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:57:29,785 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-06-26 17:57:29,785 INFO ]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-06-26 17:57:29,785 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:29,785 INFO ]: Abstraction has 14 states and 14 transitions. [2018-06-26 17:57:29,785 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:57:29,785 INFO ]: Start isEmpty. Operand 14 states and 14 transitions. [2018-06-26 17:57:29,786 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:57:29,786 INFO ]: Found error trace [2018-06-26 17:57:29,786 INFO ]: trace histogram [8, 1, 1, 1, 1, 1] [2018-06-26 17:57:29,786 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:29,786 INFO ]: Analyzing trace with hash -1597180220, now seen corresponding path program 8 times [2018-06-26 17:57:29,786 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:29,786 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:29,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:29,787 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:29,787 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:29,855 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:30,272 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:30,272 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:30,272 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-26 17:57:30,278 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:57:30,340 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:57:30,340 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:30,345 INFO ]: Computing forward predicates... [2018-06-26 17:57:30,415 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:30,435 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:30,435 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-26 17:57:30,435 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:57:30,435 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:57:30,435 INFO ]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:57:30,435 INFO ]: Start difference. First operand 14 states and 14 transitions. Second operand 12 states. [2018-06-26 17:57:30,520 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:30,520 INFO ]: Finished difference Result 15 states and 15 transitions. [2018-06-26 17:57:30,520 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:57:30,520 INFO ]: Start accepts. Automaton has 12 states. Word has length 13 [2018-06-26 17:57:30,520 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:30,520 INFO ]: With dead ends: 15 [2018-06-26 17:57:30,520 INFO ]: Without dead ends: 15 [2018-06-26 17:57:30,520 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:57:30,521 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:57:30,522 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:57:30,522 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:57:30,522 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-06-26 17:57:30,522 INFO ]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-06-26 17:57:30,522 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:30,522 INFO ]: Abstraction has 15 states and 15 transitions. [2018-06-26 17:57:30,522 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:57:30,522 INFO ]: Start isEmpty. Operand 15 states and 15 transitions. [2018-06-26 17:57:30,523 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:57:30,523 INFO ]: Found error trace [2018-06-26 17:57:30,523 INFO ]: trace histogram [9, 1, 1, 1, 1, 1] [2018-06-26 17:57:30,523 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:30,523 INFO ]: Analyzing trace with hash 2026635532, now seen corresponding path program 9 times [2018-06-26 17:57:30,523 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:30,523 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:30,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:30,523 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:30,523 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:30,581 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:30,788 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:30,788 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:30,788 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:30,794 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:57:30,883 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:57:30,883 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:30,888 INFO ]: Computing forward predicates... [2018-06-26 17:57:31,051 INFO ]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:31,071 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:31,071 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 14 [2018-06-26 17:57:31,071 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:57:31,071 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:57:31,071 INFO ]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:57:31,071 INFO ]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-06-26 17:57:31,180 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:31,180 INFO ]: Finished difference Result 16 states and 16 transitions. [2018-06-26 17:57:31,180 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:57:31,180 INFO ]: Start accepts. Automaton has 14 states. Word has length 14 [2018-06-26 17:57:31,181 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:31,181 INFO ]: With dead ends: 16 [2018-06-26 17:57:31,181 INFO ]: Without dead ends: 16 [2018-06-26 17:57:31,181 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:57:31,181 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:57:31,183 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 17:57:31,183 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:57:31,183 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-06-26 17:57:31,183 INFO ]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-06-26 17:57:31,183 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:31,183 INFO ]: Abstraction has 16 states and 16 transitions. [2018-06-26 17:57:31,183 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:57:31,183 INFO ]: Start isEmpty. Operand 16 states and 16 transitions. [2018-06-26 17:57:31,184 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:57:31,184 INFO ]: Found error trace [2018-06-26 17:57:31,184 INFO ]: trace histogram [10, 1, 1, 1, 1, 1] [2018-06-26 17:57:31,184 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:31,184 INFO ]: Analyzing trace with hash -1599193148, now seen corresponding path program 10 times [2018-06-26 17:57:31,184 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:31,184 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:31,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:31,184 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:31,184 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:31,222 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:32,078 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:32,078 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:32,078 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-26 17:57:32,083 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:57:32,142 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:57:32,142 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:32,148 INFO ]: Computing forward predicates... [2018-06-26 17:57:32,290 INFO ]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:32,310 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:32,310 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-06-26 17:57:32,311 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:57:32,311 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:57:32,311 INFO ]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:57:32,311 INFO ]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-06-26 17:57:32,440 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:32,440 INFO ]: Finished difference Result 17 states and 17 transitions. [2018-06-26 17:57:32,440 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:57:32,440 INFO ]: Start accepts. Automaton has 15 states. Word has length 15 [2018-06-26 17:57:32,441 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:32,441 INFO ]: With dead ends: 17 [2018-06-26 17:57:32,441 INFO ]: Without dead ends: 17 [2018-06-26 17:57:32,441 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:57:32,441 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:57:32,442 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:57:32,442 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:57:32,443 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-06-26 17:57:32,443 INFO ]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-06-26 17:57:32,443 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:32,443 INFO ]: Abstraction has 17 states and 17 transitions. [2018-06-26 17:57:32,443 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:57:32,443 INFO ]: Start isEmpty. Operand 17 states and 17 transitions. [2018-06-26 17:57:32,443 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:57:32,443 INFO ]: Found error trace [2018-06-26 17:57:32,443 INFO ]: trace histogram [11, 1, 1, 1, 1, 1] [2018-06-26 17:57:32,443 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:32,444 INFO ]: Analyzing trace with hash 1964234764, now seen corresponding path program 11 times [2018-06-26 17:57:32,444 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:32,444 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:32,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:32,444 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:32,444 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:32,486 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:32,843 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:32,843 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:32,843 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-26 17:57:32,850 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:57:32,943 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:57:32,943 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:32,951 INFO ]: Computing forward predicates... [2018-06-26 17:57:33,056 INFO ]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:33,076 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:33,076 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 16 [2018-06-26 17:57:33,076 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:57:33,076 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:57:33,076 INFO ]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:57:33,076 INFO ]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-06-26 17:57:33,268 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:33,268 INFO ]: Finished difference Result 18 states and 18 transitions. [2018-06-26 17:57:33,269 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:57:33,269 INFO ]: Start accepts. Automaton has 16 states. Word has length 16 [2018-06-26 17:57:33,269 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:33,269 INFO ]: With dead ends: 18 [2018-06-26 17:57:33,269 INFO ]: Without dead ends: 18 [2018-06-26 17:57:33,270 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:57:33,270 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:57:33,271 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:57:33,271 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:57:33,271 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-06-26 17:57:33,272 INFO ]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-06-26 17:57:33,272 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:33,272 INFO ]: Abstraction has 18 states and 18 transitions. [2018-06-26 17:57:33,272 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:57:33,272 INFO ]: Start isEmpty. Operand 18 states and 18 transitions. [2018-06-26 17:57:33,272 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:57:33,272 INFO ]: Found error trace [2018-06-26 17:57:33,272 INFO ]: trace histogram [12, 1, 1, 1, 1, 1] [2018-06-26 17:57:33,272 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:33,272 INFO ]: Analyzing trace with hash 761350340, now seen corresponding path program 12 times [2018-06-26 17:57:33,272 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:33,272 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:33,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:33,273 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:33,273 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:33,315 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:33,577 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:33,577 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:33,577 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-26 17:57:33,583 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:57:33,654 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:57:33,654 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:33,660 INFO ]: Computing forward predicates... [2018-06-26 17:57:34,265 INFO ]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:34,284 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:34,284 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-26 17:57:34,285 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:57:34,285 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:57:34,285 INFO ]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:57:34,285 INFO ]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2018-06-26 17:57:34,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:34,484 INFO ]: Finished difference Result 19 states and 19 transitions. [2018-06-26 17:57:34,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:57:34,484 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-26 17:57:34,485 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:34,485 INFO ]: With dead ends: 19 [2018-06-26 17:57:34,485 INFO ]: Without dead ends: 19 [2018-06-26 17:57:34,485 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:57:34,485 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:57:34,487 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:57:34,487 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:57:34,487 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-06-26 17:57:34,487 INFO ]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-06-26 17:57:34,487 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:34,487 INFO ]: Abstraction has 19 states and 19 transitions. [2018-06-26 17:57:34,487 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:57:34,488 INFO ]: Start isEmpty. Operand 19 states and 19 transitions. [2018-06-26 17:57:34,488 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:57:34,488 INFO ]: Found error trace [2018-06-26 17:57:34,488 INFO ]: trace histogram [13, 1, 1, 1, 1, 1] [2018-06-26 17:57:34,488 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:34,488 INFO ]: Analyzing trace with hash 2126638860, now seen corresponding path program 13 times [2018-06-26 17:57:34,488 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:34,488 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:34,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:34,489 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:34,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:34,578 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:35,689 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:35,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:35,689 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:35,695 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:35,802 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:35,811 INFO ]: Computing forward predicates... [2018-06-26 17:57:36,114 INFO ]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:36,133 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:36,133 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 18 [2018-06-26 17:57:36,134 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:57:36,134 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:57:36,134 INFO ]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:57:36,134 INFO ]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-06-26 17:57:36,516 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:36,516 INFO ]: Finished difference Result 20 states and 20 transitions. [2018-06-26 17:57:36,517 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:57:36,517 INFO ]: Start accepts. Automaton has 18 states. Word has length 18 [2018-06-26 17:57:36,517 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:36,517 INFO ]: With dead ends: 20 [2018-06-26 17:57:36,517 INFO ]: Without dead ends: 20 [2018-06-26 17:57:36,517 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:57:36,517 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:57:36,518 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:57:36,518 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:57:36,519 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-06-26 17:57:36,519 INFO ]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-06-26 17:57:36,519 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:36,519 INFO ]: Abstraction has 20 states and 20 transitions. [2018-06-26 17:57:36,519 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:57:36,519 INFO ]: Start isEmpty. Operand 20 states and 20 transitions. [2018-06-26 17:57:36,520 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:57:36,520 INFO ]: Found error trace [2018-06-26 17:57:36,520 INFO ]: trace histogram [14, 1, 1, 1, 1, 1] [2018-06-26 17:57:36,520 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:36,520 INFO ]: Analyzing trace with hash 1500910020, now seen corresponding path program 14 times [2018-06-26 17:57:36,520 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:36,520 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:36,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:36,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:36,520 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:36,578 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:37,094 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:37,094 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:37,094 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-26 17:57:37,101 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:57:37,192 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:57:37,192 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:37,199 INFO ]: Computing forward predicates... [2018-06-26 17:57:37,498 INFO ]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:37,518 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:37,518 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2018-06-26 17:57:37,518 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:57:37,518 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:57:37,518 INFO ]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:57:37,518 INFO ]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-06-26 17:57:37,747 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:37,747 INFO ]: Finished difference Result 21 states and 21 transitions. [2018-06-26 17:57:37,748 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:57:37,748 INFO ]: Start accepts. Automaton has 19 states. Word has length 19 [2018-06-26 17:57:37,748 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:37,748 INFO ]: With dead ends: 21 [2018-06-26 17:57:37,748 INFO ]: Without dead ends: 21 [2018-06-26 17:57:37,748 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:57:37,748 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:57:37,749 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 17:57:37,749 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:57:37,750 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-06-26 17:57:37,750 INFO ]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-06-26 17:57:37,750 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:37,750 INFO ]: Abstraction has 21 states and 21 transitions. [2018-06-26 17:57:37,750 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:57:37,750 INFO ]: Start isEmpty. Operand 21 states and 21 transitions. [2018-06-26 17:57:37,750 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:57:37,750 INFO ]: Found error trace [2018-06-26 17:57:37,750 INFO ]: trace histogram [15, 1, 1, 1, 1, 1] [2018-06-26 17:57:37,750 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:37,750 INFO ]: Analyzing trace with hash -716814836, now seen corresponding path program 15 times [2018-06-26 17:57:37,751 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:37,751 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:37,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:37,751 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:37,751 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:37,837 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:38,282 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:38,282 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:38,282 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-26 17:57:38,288 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:57:38,394 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 17:57:38,394 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:38,402 INFO ]: Computing forward predicates... [2018-06-26 17:57:38,846 INFO ]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:38,866 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:38,866 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 20 [2018-06-26 17:57:38,866 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:57:38,866 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:57:38,867 INFO ]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:57:38,867 INFO ]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-06-26 17:57:39,051 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:39,051 INFO ]: Finished difference Result 22 states and 22 transitions. [2018-06-26 17:57:39,051 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:57:39,051 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-26 17:57:39,051 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:39,052 INFO ]: With dead ends: 22 [2018-06-26 17:57:39,052 INFO ]: Without dead ends: 22 [2018-06-26 17:57:39,052 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:57:39,052 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:57:39,054 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:57:39,054 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:57:39,055 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-06-26 17:57:39,055 INFO ]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-06-26 17:57:39,055 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:39,055 INFO ]: Abstraction has 22 states and 22 transitions. [2018-06-26 17:57:39,055 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:57:39,055 INFO ]: Start isEmpty. Operand 22 states and 22 transitions. [2018-06-26 17:57:39,055 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:57:39,055 INFO ]: Found error trace [2018-06-26 17:57:39,055 INFO ]: trace histogram [16, 1, 1, 1, 1, 1] [2018-06-26 17:57:39,055 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:39,055 INFO ]: Analyzing trace with hash -746808636, now seen corresponding path program 16 times [2018-06-26 17:57:39,055 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:39,055 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:39,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:39,056 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:39,056 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:39,147 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:39,557 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:39,557 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:39,557 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-26 17:57:39,563 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:57:39,658 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:57:39,658 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:39,667 INFO ]: Computing forward predicates... [2018-06-26 17:57:39,793 INFO ]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:39,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:39,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2018-06-26 17:57:39,824 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:57:39,824 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:57:39,825 INFO ]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:57:39,825 INFO ]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-06-26 17:57:40,058 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:40,058 INFO ]: Finished difference Result 23 states and 23 transitions. [2018-06-26 17:57:40,059 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:57:40,059 INFO ]: Start accepts. Automaton has 21 states. Word has length 21 [2018-06-26 17:57:40,059 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:40,060 INFO ]: With dead ends: 23 [2018-06-26 17:57:40,060 INFO ]: Without dead ends: 23 [2018-06-26 17:57:40,060 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:57:40,060 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:57:40,062 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:57:40,062 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:57:40,062 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-06-26 17:57:40,062 INFO ]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-06-26 17:57:40,062 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:40,062 INFO ]: Abstraction has 23 states and 23 transitions. [2018-06-26 17:57:40,062 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:57:40,062 INFO ]: Start isEmpty. Operand 23 states and 23 transitions. [2018-06-26 17:57:40,063 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:57:40,063 INFO ]: Found error trace [2018-06-26 17:57:40,063 INFO ]: trace histogram [17, 1, 1, 1, 1, 1] [2018-06-26 17:57:40,063 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:40,063 INFO ]: Analyzing trace with hash -1676616436, now seen corresponding path program 17 times [2018-06-26 17:57:40,063 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:40,063 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:40,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:40,064 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:40,064 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:40,159 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:41,118 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:41,118 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:41,118 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-26 17:57:41,124 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:57:41,296 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 17:57:41,296 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:41,305 INFO ]: Computing forward predicates... [2018-06-26 17:57:41,500 INFO ]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:41,522 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:41,522 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 22 [2018-06-26 17:57:41,522 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:57:41,522 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:57:41,522 INFO ]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:57:41,522 INFO ]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-06-26 17:57:41,768 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:41,768 INFO ]: Finished difference Result 24 states and 24 transitions. [2018-06-26 17:57:41,768 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:57:41,768 INFO ]: Start accepts. Automaton has 22 states. Word has length 22 [2018-06-26 17:57:41,768 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:41,769 INFO ]: With dead ends: 24 [2018-06-26 17:57:41,769 INFO ]: Without dead ends: 24 [2018-06-26 17:57:41,769 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:57:41,769 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:57:41,771 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:57:41,771 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:57:41,771 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-06-26 17:57:41,771 INFO ]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-06-26 17:57:41,771 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:41,771 INFO ]: Abstraction has 24 states and 24 transitions. [2018-06-26 17:57:41,771 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:57:41,771 INFO ]: Start isEmpty. Operand 24 states and 24 transitions. [2018-06-26 17:57:41,772 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:57:41,772 INFO ]: Found error trace [2018-06-26 17:57:41,772 INFO ]: trace histogram [18, 1, 1, 1, 1, 1] [2018-06-26 17:57:41,772 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:41,772 INFO ]: Analyzing trace with hash -435887164, now seen corresponding path program 18 times [2018-06-26 17:57:41,772 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:41,772 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:41,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:41,773 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:41,773 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:41,920 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:42,351 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:42,351 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:42,351 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-26 17:57:42,357 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:57:42,462 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-26 17:57:42,462 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:42,471 INFO ]: Computing forward predicates... [2018-06-26 17:57:42,662 INFO ]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:42,682 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:42,682 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2018-06-26 17:57:42,682 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:57:42,682 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:57:42,682 INFO ]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:57:42,682 INFO ]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-06-26 17:57:42,969 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:42,969 INFO ]: Finished difference Result 25 states and 25 transitions. [2018-06-26 17:57:42,969 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:57:42,969 INFO ]: Start accepts. Automaton has 23 states. Word has length 23 [2018-06-26 17:57:42,969 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:42,971 INFO ]: With dead ends: 25 [2018-06-26 17:57:42,971 INFO ]: Without dead ends: 25 [2018-06-26 17:57:42,971 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:57:42,971 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:57:42,972 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 17:57:42,972 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:57:42,973 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-06-26 17:57:42,973 INFO ]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-06-26 17:57:42,973 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:42,973 INFO ]: Abstraction has 25 states and 25 transitions. [2018-06-26 17:57:42,973 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:57:42,973 INFO ]: Start isEmpty. Operand 25 states and 25 transitions. [2018-06-26 17:57:42,974 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:57:42,974 INFO ]: Found error trace [2018-06-26 17:57:42,974 INFO ]: trace histogram [19, 1, 1, 1, 1, 1] [2018-06-26 17:57:42,974 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:42,974 INFO ]: Analyzing trace with hash -627985396, now seen corresponding path program 19 times [2018-06-26 17:57:42,974 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:42,974 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:42,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:42,974 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:42,974 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:43,083 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:44,046 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:44,046 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:44,046 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-26 17:57:44,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:44,170 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:44,178 INFO ]: Computing forward predicates... [2018-06-26 17:57:44,413 INFO ]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:44,434 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:44,434 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2018-06-26 17:57:44,434 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:57:44,434 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:57:44,434 INFO ]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:57:44,434 INFO ]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-06-26 17:57:44,787 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:44,787 INFO ]: Finished difference Result 26 states and 26 transitions. [2018-06-26 17:57:44,789 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:57:44,789 INFO ]: Start accepts. Automaton has 24 states. Word has length 24 [2018-06-26 17:57:44,789 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:44,789 INFO ]: With dead ends: 26 [2018-06-26 17:57:44,789 INFO ]: Without dead ends: 26 [2018-06-26 17:57:44,789 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:57:44,789 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:57:44,791 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:57:44,791 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:57:44,791 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-06-26 17:57:44,792 INFO ]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-06-26 17:57:44,792 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:44,792 INFO ]: Abstraction has 26 states and 26 transitions. [2018-06-26 17:57:44,792 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:57:44,792 INFO ]: Start isEmpty. Operand 26 states and 26 transitions. [2018-06-26 17:57:44,792 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:57:44,792 INFO ]: Found error trace [2018-06-26 17:57:44,792 INFO ]: trace histogram [20, 1, 1, 1, 1, 1] [2018-06-26 17:57:44,792 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:44,792 INFO ]: Analyzing trace with hash 2006904004, now seen corresponding path program 20 times [2018-06-26 17:57:44,792 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:44,792 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:44,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:44,793 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:44,793 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:45,025 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:45,526 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:45,526 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:45,526 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-26 17:57:45,534 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:57:45,663 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:57:45,663 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:45,672 INFO ]: Computing forward predicates... [2018-06-26 17:57:45,951 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:45,973 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:45,973 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 25 [2018-06-26 17:57:45,973 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:57:45,974 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:57:45,974 INFO ]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:57:45,974 INFO ]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-06-26 17:57:46,275 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:46,275 INFO ]: Finished difference Result 27 states and 27 transitions. [2018-06-26 17:57:46,276 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:57:46,276 INFO ]: Start accepts. Automaton has 25 states. Word has length 25 [2018-06-26 17:57:46,276 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:46,276 INFO ]: With dead ends: 27 [2018-06-26 17:57:46,276 INFO ]: Without dead ends: 27 [2018-06-26 17:57:46,277 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 10 SyntacticMatches, 14 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:57:46,277 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:57:46,278 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:57:46,278 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:57:46,279 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-06-26 17:57:46,279 INFO ]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-06-26 17:57:46,279 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:46,279 INFO ]: Abstraction has 27 states and 27 transitions. [2018-06-26 17:57:46,279 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:57:46,279 INFO ]: Start isEmpty. Operand 27 states and 27 transitions. [2018-06-26 17:57:46,279 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:57:46,279 INFO ]: Found error trace [2018-06-26 17:57:46,279 INFO ]: trace histogram [21, 1, 1, 1, 1, 1] [2018-06-26 17:57:46,279 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:46,279 INFO ]: Analyzing trace with hash 2084096780, now seen corresponding path program 21 times [2018-06-26 17:57:46,279 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:46,279 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:46,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:46,280 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:46,280 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:46,510 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:47,419 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:47,419 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:47,419 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-26 17:57:47,426 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:57:47,554 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-06-26 17:57:47,554 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:47,563 INFO ]: Computing forward predicates... [2018-06-26 17:57:47,814 INFO ]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:47,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:47,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 26 [2018-06-26 17:57:47,834 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:57:47,834 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:57:47,834 INFO ]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:57:47,834 INFO ]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-06-26 17:57:49,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:49,019 INFO ]: Finished difference Result 28 states and 28 transitions. [2018-06-26 17:57:49,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:57:49,020 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-26 17:57:49,021 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:49,021 INFO ]: With dead ends: 28 [2018-06-26 17:57:49,021 INFO ]: Without dead ends: 28 [2018-06-26 17:57:49,021 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:57:49,021 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:57:49,023 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 17:57:49,023 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:57:49,023 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-06-26 17:57:49,023 INFO ]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-06-26 17:57:49,023 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:49,023 INFO ]: Abstraction has 28 states and 28 transitions. [2018-06-26 17:57:49,023 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:57:49,023 INFO ]: Start isEmpty. Operand 28 states and 28 transitions. [2018-06-26 17:57:49,024 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:57:49,024 INFO ]: Found error trace [2018-06-26 17:57:49,024 INFO ]: trace histogram [22, 1, 1, 1, 1, 1] [2018-06-26 17:57:49,024 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:49,024 INFO ]: Analyzing trace with hash 182105540, now seen corresponding path program 22 times [2018-06-26 17:57:49,024 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:49,024 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:49,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:49,024 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:49,024 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:49,267 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:49,987 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:49,987 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:49,987 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-26 17:57:49,992 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:57:50,138 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:57:50,138 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:50,147 INFO ]: Computing forward predicates... [2018-06-26 17:57:50,454 INFO ]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:50,474 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:50,474 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 27 [2018-06-26 17:57:50,474 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:57:50,474 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:57:50,474 INFO ]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:57:50,474 INFO ]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-06-26 17:57:50,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:50,818 INFO ]: Finished difference Result 29 states and 29 transitions. [2018-06-26 17:57:50,819 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:57:50,819 INFO ]: Start accepts. Automaton has 27 states. Word has length 27 [2018-06-26 17:57:50,819 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:50,819 INFO ]: With dead ends: 29 [2018-06-26 17:57:50,819 INFO ]: Without dead ends: 29 [2018-06-26 17:57:50,820 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 15 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:57:50,820 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:57:50,821 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:57:50,821 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:57:50,822 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-06-26 17:57:50,822 INFO ]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-06-26 17:57:50,822 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:50,822 INFO ]: Abstraction has 29 states and 29 transitions. [2018-06-26 17:57:50,822 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:57:50,822 INFO ]: Start isEmpty. Operand 29 states and 29 transitions. [2018-06-26 17:57:50,823 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:57:50,823 INFO ]: Found error trace [2018-06-26 17:57:50,823 INFO ]: trace histogram [23, 1, 1, 1, 1, 1] [2018-06-26 17:57:50,823 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:50,823 INFO ]: Analyzing trace with hash 1349919244, now seen corresponding path program 23 times [2018-06-26 17:57:50,823 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:50,823 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:50,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:50,823 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:50,823 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:51,007 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:51,590 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:51,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:51,590 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-26 17:57:51,599 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:57:51,754 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-06-26 17:57:51,754 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:51,768 INFO ]: Computing forward predicates... [2018-06-26 17:57:52,010 INFO ]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:52,030 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:52,030 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 28 [2018-06-26 17:57:52,030 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:57:52,030 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:57:52,030 INFO ]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:57:52,030 INFO ]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-06-26 17:57:52,538 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:52,538 INFO ]: Finished difference Result 30 states and 30 transitions. [2018-06-26 17:57:52,539 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:57:52,539 INFO ]: Start accepts. Automaton has 28 states. Word has length 28 [2018-06-26 17:57:52,539 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:52,539 INFO ]: With dead ends: 30 [2018-06-26 17:57:52,539 INFO ]: Without dead ends: 30 [2018-06-26 17:57:52,539 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:57:52,539 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:57:52,541 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:57:52,541 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:57:52,541 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-06-26 17:57:52,541 INFO ]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-06-26 17:57:52,541 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:52,541 INFO ]: Abstraction has 30 states and 30 transitions. [2018-06-26 17:57:52,541 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:57:52,542 INFO ]: Start isEmpty. Operand 30 states and 30 transitions. [2018-06-26 17:57:52,542 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:57:52,542 INFO ]: Found error trace [2018-06-26 17:57:52,542 INFO ]: trace histogram [24, 1, 1, 1, 1, 1] [2018-06-26 17:57:52,542 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:52,542 INFO ]: Analyzing trace with hash -1102561596, now seen corresponding path program 24 times [2018-06-26 17:57:52,542 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:52,542 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:52,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:52,543 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:52,543 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:52,729 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:53,392 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:53,393 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:53,393 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-26 17:57:53,399 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:57:53,545 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-06-26 17:57:53,546 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:53,559 INFO ]: Computing forward predicates... [2018-06-26 17:57:53,849 INFO ]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:53,869 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:53,869 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2018-06-26 17:57:53,869 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:57:53,869 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:57:53,869 INFO ]: CoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:57:53,869 INFO ]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-06-26 17:57:54,263 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:54,263 INFO ]: Finished difference Result 31 states and 31 transitions. [2018-06-26 17:57:54,263 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:57:54,263 INFO ]: Start accepts. Automaton has 29 states. Word has length 29 [2018-06-26 17:57:54,263 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:54,263 INFO ]: With dead ends: 31 [2018-06-26 17:57:54,263 INFO ]: Without dead ends: 31 [2018-06-26 17:57:54,263 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:57:54,263 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:57:54,265 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:57:54,265 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:57:54,266 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-06-26 17:57:54,266 INFO ]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-06-26 17:57:54,266 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:54,266 INFO ]: Abstraction has 31 states and 31 transitions. [2018-06-26 17:57:54,266 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:57:54,266 INFO ]: Start isEmpty. Operand 31 states and 31 transitions. [2018-06-26 17:57:54,266 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:57:54,266 INFO ]: Found error trace [2018-06-26 17:57:54,266 INFO ]: trace histogram [25, 1, 1, 1, 1, 1] [2018-06-26 17:57:54,266 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:54,266 INFO ]: Analyzing trace with hash 179943692, now seen corresponding path program 25 times [2018-06-26 17:57:54,266 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:54,266 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:54,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:54,269 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:54,269 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:54,511 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:55,611 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:55,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:55,611 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-26 17:57:55,617 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:55,789 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:55,800 INFO ]: Computing forward predicates... [2018-06-26 17:57:56,161 INFO ]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:56,181 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:56,181 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 30 [2018-06-26 17:57:56,181 INFO ]: Interpolant automaton has 30 states [2018-06-26 17:57:56,181 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-26 17:57:56,181 INFO ]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:57:56,181 INFO ]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-06-26 17:57:56,605 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:56,605 INFO ]: Finished difference Result 32 states and 32 transitions. [2018-06-26 17:57:56,608 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:57:56,608 INFO ]: Start accepts. Automaton has 30 states. Word has length 30 [2018-06-26 17:57:56,608 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:56,608 INFO ]: With dead ends: 32 [2018-06-26 17:57:56,608 INFO ]: Without dead ends: 32 [2018-06-26 17:57:56,608 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 16 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:57:56,608 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:57:56,610 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:57:56,610 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:57:56,611 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-06-26 17:57:56,611 INFO ]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-06-26 17:57:56,611 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:56,611 INFO ]: Abstraction has 32 states and 32 transitions. [2018-06-26 17:57:56,611 INFO ]: Interpolant automaton has 30 states. [2018-06-26 17:57:56,611 INFO ]: Start isEmpty. Operand 32 states and 32 transitions. [2018-06-26 17:57:56,611 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:57:56,611 INFO ]: Found error trace [2018-06-26 17:57:56,611 INFO ]: trace histogram [26, 1, 1, 1, 1, 1] [2018-06-26 17:57:56,611 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:56,612 INFO ]: Analyzing trace with hash 1282901956, now seen corresponding path program 26 times [2018-06-26 17:57:56,612 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:56,612 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:56,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:56,613 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:57:56,613 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:56,810 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:57,546 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:57,546 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:57:57,546 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:57:57,557 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:57:57,756 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:57:57,756 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:57:57,768 INFO ]: Computing forward predicates... [2018-06-26 17:57:58,163 INFO ]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:57:58,183 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:57:58,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 31 [2018-06-26 17:57:58,183 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:57:58,183 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:57:58,183 INFO ]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:57:58,184 INFO ]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-06-26 17:57:58,675 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:57:58,675 INFO ]: Finished difference Result 33 states and 33 transitions. [2018-06-26 17:57:58,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:57:58,675 INFO ]: Start accepts. Automaton has 31 states. Word has length 31 [2018-06-26 17:57:58,676 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:57:58,676 INFO ]: With dead ends: 33 [2018-06-26 17:57:58,676 INFO ]: Without dead ends: 33 [2018-06-26 17:57:58,676 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 14 SyntacticMatches, 16 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:57:58,676 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:57:58,678 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:57:58,678 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:57:58,678 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-06-26 17:57:58,678 INFO ]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-06-26 17:57:58,679 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:57:58,679 INFO ]: Abstraction has 33 states and 33 transitions. [2018-06-26 17:57:58,679 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:57:58,679 INFO ]: Start isEmpty. Operand 33 states and 33 transitions. [2018-06-26 17:57:58,679 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:57:58,679 INFO ]: Found error trace [2018-06-26 17:57:58,679 INFO ]: trace histogram [27, 1, 1, 1, 1, 1] [2018-06-26 17:57:58,679 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:57:58,679 INFO ]: Analyzing trace with hash 1114869772, now seen corresponding path program 27 times [2018-06-26 17:57:58,679 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:57:58,679 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:57:58,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:58,680 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:57:58,680 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:57:58,935 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:00,130 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:00,130 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:00,130 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:00,136 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:58:00,308 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-06-26 17:58:00,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:00,320 INFO ]: Computing forward predicates... [2018-06-26 17:58:00,898 INFO ]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:00,920 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:00,920 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 32 [2018-06-26 17:58:00,920 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:58:00,921 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:58:00,921 INFO ]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:58:00,921 INFO ]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-06-26 17:58:01,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:01,430 INFO ]: Finished difference Result 34 states and 34 transitions. [2018-06-26 17:58:01,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:58:01,432 INFO ]: Start accepts. Automaton has 32 states. Word has length 32 [2018-06-26 17:58:01,432 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:01,432 INFO ]: With dead ends: 34 [2018-06-26 17:58:01,432 INFO ]: Without dead ends: 34 [2018-06-26 17:58:01,433 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:58:01,433 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:58:01,434 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:58:01,434 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:58:01,435 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-06-26 17:58:01,435 INFO ]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-06-26 17:58:01,435 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:01,435 INFO ]: Abstraction has 34 states and 34 transitions. [2018-06-26 17:58:01,435 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:58:01,435 INFO ]: Start isEmpty. Operand 34 states and 34 transitions. [2018-06-26 17:58:01,435 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:58:01,435 INFO ]: Found error trace [2018-06-26 17:58:01,436 INFO ]: trace histogram [28, 1, 1, 1, 1, 1] [2018-06-26 17:58:01,436 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:01,436 INFO ]: Analyzing trace with hash 200839364, now seen corresponding path program 28 times [2018-06-26 17:58:01,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:01,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:01,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:01,436 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:01,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:01,553 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:02,763 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:02,763 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:02,763 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:02,769 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:58:03,013 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:03,013 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:03,025 INFO ]: Computing forward predicates... [2018-06-26 17:58:03,367 INFO ]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:03,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:03,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-26 17:58:03,387 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:58:03,387 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:58:03,387 INFO ]: CoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:58:03,388 INFO ]: Start difference. First operand 34 states and 34 transitions. Second operand 32 states. [2018-06-26 17:58:03,931 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:03,931 INFO ]: Finished difference Result 35 states and 35 transitions. [2018-06-26 17:58:03,935 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:58:03,935 INFO ]: Start accepts. Automaton has 32 states. Word has length 33 [2018-06-26 17:58:03,935 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:03,935 INFO ]: With dead ends: 35 [2018-06-26 17:58:03,935 INFO ]: Without dead ends: 35 [2018-06-26 17:58:03,936 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 16 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=62, Invalid=930, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:58:03,936 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:58:03,937 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:58:03,937 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:58:03,938 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-06-26 17:58:03,938 INFO ]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-06-26 17:58:03,938 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:03,938 INFO ]: Abstraction has 35 states and 35 transitions. [2018-06-26 17:58:03,938 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:58:03,938 INFO ]: Start isEmpty. Operand 35 states and 35 transitions. [2018-06-26 17:58:03,938 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:58:03,938 INFO ]: Found error trace [2018-06-26 17:58:03,939 INFO ]: trace histogram [29, 1, 1, 1, 1, 1] [2018-06-26 17:58:03,939 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:03,940 INFO ]: Analyzing trace with hash 1930667788, now seen corresponding path program 29 times [2018-06-26 17:58:03,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:03,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:03,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:03,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:03,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:04,188 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:05,293 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:05,305 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:05,305 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:05,310 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:58:05,505 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-06-26 17:58:05,505 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:05,521 INFO ]: Computing forward predicates... [2018-06-26 17:58:05,946 INFO ]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:05,966 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:05,966 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-26 17:58:05,966 INFO ]: Interpolant automaton has 33 states [2018-06-26 17:58:05,967 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 17:58:05,967 INFO ]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:58:05,967 INFO ]: Start difference. First operand 35 states and 35 transitions. Second operand 33 states. [2018-06-26 17:58:06,590 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:06,590 INFO ]: Finished difference Result 36 states and 36 transitions. [2018-06-26 17:58:06,591 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:58:06,591 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-26 17:58:06,591 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:06,591 INFO ]: With dead ends: 36 [2018-06-26 17:58:06,591 INFO ]: Without dead ends: 36 [2018-06-26 17:58:06,591 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 17 SyntacticMatches, 17 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:58:06,592 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:58:06,593 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:58:06,593 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:58:06,593 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-06-26 17:58:06,593 INFO ]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-06-26 17:58:06,593 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:06,593 INFO ]: Abstraction has 36 states and 36 transitions. [2018-06-26 17:58:06,593 INFO ]: Interpolant automaton has 33 states. [2018-06-26 17:58:06,593 INFO ]: Start isEmpty. Operand 36 states and 36 transitions. [2018-06-26 17:58:06,593 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:58:06,593 INFO ]: Found error trace [2018-06-26 17:58:06,593 INFO ]: trace histogram [30, 1, 1, 1, 1, 1] [2018-06-26 17:58:06,594 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:06,594 INFO ]: Analyzing trace with hash -279225916, now seen corresponding path program 30 times [2018-06-26 17:58:06,594 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:06,594 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:06,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:06,594 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:06,594 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:06,859 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:08,219 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:08,219 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:08,219 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:08,225 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:58:08,423 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-06-26 17:58:08,423 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:08,438 INFO ]: Computing forward predicates... [2018-06-26 17:58:09,084 INFO ]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:09,104 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:09,104 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-26 17:58:09,105 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:58:09,105 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:58:09,105 INFO ]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:58:09,105 INFO ]: Start difference. First operand 36 states and 36 transitions. Second operand 34 states. [2018-06-26 17:58:09,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:09,726 INFO ]: Finished difference Result 37 states and 37 transitions. [2018-06-26 17:58:09,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:58:09,726 INFO ]: Start accepts. Automaton has 34 states. Word has length 35 [2018-06-26 17:58:09,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:09,726 INFO ]: With dead ends: 37 [2018-06-26 17:58:09,726 INFO ]: Without dead ends: 37 [2018-06-26 17:58:09,727 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 16 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:58:09,727 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:58:09,728 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 17:58:09,728 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:58:09,729 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-06-26 17:58:09,729 INFO ]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-06-26 17:58:09,729 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:09,729 INFO ]: Abstraction has 37 states and 37 transitions. [2018-06-26 17:58:09,729 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:58:09,729 INFO ]: Start isEmpty. Operand 37 states and 37 transitions. [2018-06-26 17:58:09,729 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:58:09,729 INFO ]: Found error trace [2018-06-26 17:58:09,729 INFO ]: trace histogram [31, 1, 1, 1, 1, 1] [2018-06-26 17:58:09,729 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:09,730 INFO ]: Analyzing trace with hash -66454004, now seen corresponding path program 31 times [2018-06-26 17:58:09,730 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:09,730 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:09,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:09,732 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:09,732 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:10,020 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:10,865 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:10,865 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:10,865 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:10,870 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:11,129 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:11,144 INFO ]: Computing forward predicates... [2018-06-26 17:58:11,676 INFO ]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:11,696 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:11,696 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-26 17:58:11,696 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:58:11,696 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:58:11,697 INFO ]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:58:11,697 INFO ]: Start difference. First operand 37 states and 37 transitions. Second operand 35 states. [2018-06-26 17:58:12,380 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:12,380 INFO ]: Finished difference Result 38 states and 38 transitions. [2018-06-26 17:58:12,380 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-26 17:58:12,380 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-26 17:58:12,380 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:12,380 INFO ]: With dead ends: 38 [2018-06-26 17:58:12,380 INFO ]: Without dead ends: 38 [2018-06-26 17:58:12,381 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 20 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:58:12,381 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:58:12,382 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:58:12,382 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:58:12,382 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-06-26 17:58:12,382 INFO ]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-06-26 17:58:12,382 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:12,382 INFO ]: Abstraction has 38 states and 38 transitions. [2018-06-26 17:58:12,382 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:58:12,382 INFO ]: Start isEmpty. Operand 38 states and 38 transitions. [2018-06-26 17:58:12,383 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:58:12,383 INFO ]: Found error trace [2018-06-26 17:58:12,383 INFO ]: trace histogram [32, 1, 1, 1, 1, 1] [2018-06-26 17:58:12,383 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:12,383 INFO ]: Analyzing trace with hash -2060459324, now seen corresponding path program 32 times [2018-06-26 17:58:12,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:12,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:12,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:12,383 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:58:12,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:12,624 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:13,494 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:13,494 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:13,494 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:13,500 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:58:13,778 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:58:13,778 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:13,793 INFO ]: Computing forward predicates... [2018-06-26 17:58:14,332 INFO ]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:14,352 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:14,352 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-26 17:58:14,353 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:58:14,353 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:58:14,353 INFO ]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:58:14,353 INFO ]: Start difference. First operand 38 states and 38 transitions. Second operand 36 states. [2018-06-26 17:58:15,120 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:15,120 INFO ]: Finished difference Result 39 states and 39 transitions. [2018-06-26 17:58:15,120 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:58:15,120 INFO ]: Start accepts. Automaton has 36 states. Word has length 37 [2018-06-26 17:58:15,120 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:15,120 INFO ]: With dead ends: 39 [2018-06-26 17:58:15,120 INFO ]: Without dead ends: 39 [2018-06-26 17:58:15,121 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 20 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:58:15,121 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:58:15,123 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 17:58:15,123 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:58:15,123 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-06-26 17:58:15,123 INFO ]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-06-26 17:58:15,123 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:15,123 INFO ]: Abstraction has 39 states and 39 transitions. [2018-06-26 17:58:15,123 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:58:15,123 INFO ]: Start isEmpty. Operand 39 states and 39 transitions. [2018-06-26 17:58:15,123 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:58:15,123 INFO ]: Found error trace [2018-06-26 17:58:15,123 INFO ]: trace histogram [33, 1, 1, 1, 1, 1] [2018-06-26 17:58:15,123 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:15,124 INFO ]: Analyzing trace with hash 549885196, now seen corresponding path program 33 times [2018-06-26 17:58:15,124 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:15,124 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:15,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:15,124 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:15,124 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:15,491 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:16,502 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:16,502 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:16,502 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:16,507 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:58:16,724 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-06-26 17:58:16,724 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:16,738 INFO ]: Computing forward predicates... [2018-06-26 17:58:17,269 INFO ]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:17,290 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:17,290 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 38 [2018-06-26 17:58:17,290 INFO ]: Interpolant automaton has 38 states [2018-06-26 17:58:17,290 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 17:58:17,290 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:58:17,290 INFO ]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-06-26 17:58:18,112 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:18,112 INFO ]: Finished difference Result 40 states and 40 transitions. [2018-06-26 17:58:18,112 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-26 17:58:18,113 INFO ]: Start accepts. Automaton has 38 states. Word has length 38 [2018-06-26 17:58:18,113 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:18,113 INFO ]: With dead ends: 40 [2018-06-26 17:58:18,113 INFO ]: Without dead ends: 40 [2018-06-26 17:58:18,113 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 19 SyntacticMatches, 18 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:58:18,113 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:58:18,114 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 17:58:18,114 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:58:18,114 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-06-26 17:58:18,115 INFO ]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-06-26 17:58:18,115 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:18,115 INFO ]: Abstraction has 40 states and 40 transitions. [2018-06-26 17:58:18,115 INFO ]: Interpolant automaton has 38 states. [2018-06-26 17:58:18,115 INFO ]: Start isEmpty. Operand 40 states and 40 transitions. [2018-06-26 17:58:18,115 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:58:18,115 INFO ]: Found error trace [2018-06-26 17:58:18,115 INFO ]: trace histogram [34, 1, 1, 1, 1, 1] [2018-06-26 17:58:18,115 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:18,115 INFO ]: Analyzing trace with hash -133813308, now seen corresponding path program 34 times [2018-06-26 17:58:18,115 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:18,115 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:18,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:18,116 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:18,116 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:18,510 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:19,633 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:19,634 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:58:19,634 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:58:19,640 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:58:19,947 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:58:19,947 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:58:19,963 INFO ]: Computing forward predicates... [2018-06-26 17:58:20,929 INFO ]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:58:20,951 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:58:20,951 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 39 [2018-06-26 17:58:20,951 INFO ]: Interpolant automaton has 39 states [2018-06-26 17:58:20,951 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 17:58:20,951 INFO ]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:58:20,952 INFO ]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-06-26 17:58:21,881 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:58:21,881 INFO ]: Finished difference Result 41 states and 41 transitions. [2018-06-26 17:58:21,881 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:58:21,881 INFO ]: Start accepts. Automaton has 39 states. Word has length 39 [2018-06-26 17:58:21,881 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:58:21,882 INFO ]: With dead ends: 41 [2018-06-26 17:58:21,882 INFO ]: Without dead ends: 41 [2018-06-26 17:58:21,882 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 22 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:58:21,882 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:58:21,883 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:58:21,883 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:58:21,883 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-06-26 17:58:21,883 INFO ]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-06-26 17:58:21,883 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:58:21,883 INFO ]: Abstraction has 41 states and 41 transitions. [2018-06-26 17:58:21,883 INFO ]: Interpolant automaton has 39 states. [2018-06-26 17:58:21,883 INFO ]: Start isEmpty. Operand 41 states and 41 transitions. [2018-06-26 17:58:21,884 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:58:21,884 INFO ]: Found error trace [2018-06-26 17:58:21,884 INFO ]: trace histogram [35, 1, 1, 1, 1, 1] [2018-06-26 17:58:21,884 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:58:21,884 INFO ]: Analyzing trace with hash 146369548, now seen corresponding path program 35 times [2018-06-26 17:58:21,884 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:58:21,884 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:58:21,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:21,884 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:58:21,884 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:58:22,152 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-26 17:58:22,437 WARN ]: Removed 1 from assertion stack [2018-06-26 17:58:22,438 WARN ]: Verification canceled [2018-06-26 17:58:22,440 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:58:22,441 WARN ]: Timeout [2018-06-26 17:58:22,442 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:58:22 BasicIcfg [2018-06-26 17:58:22,442 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:58:22,442 INFO ]: Toolchain (without parser) took 58891.98 ms. Allocated memory was 304.6 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 259.9 MB in the beginning and 1.2 GB in the end (delta: -915.6 MB). Peak memory consumption was 127.7 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:22,443 INFO ]: SmtParser took 0.05 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:58:22,443 INFO ]: ChcToBoogie took 58.60 ms. Allocated memory is still 304.6 MB. Free memory was 259.9 MB in the beginning and 257.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:22,444 INFO ]: Boogie Preprocessor took 46.45 ms. Allocated memory is still 304.6 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:22,444 INFO ]: RCFGBuilder took 337.00 ms. Allocated memory is still 304.6 MB. Free memory was 255.9 MB in the beginning and 245.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:22,444 INFO ]: BlockEncodingV2 took 100.84 ms. Allocated memory is still 304.6 MB. Free memory was 245.8 MB in the beginning and 242.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:22,445 INFO ]: TraceAbstraction took 58340.45 ms. Allocated memory was 304.6 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 241.8 MB in the beginning and 1.2 GB in the end (delta: -933.8 MB). Peak memory consumption was 109.6 MB. Max. memory is 3.6 GB. [2018-06-26 17:58:22,452 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.05 ms. Allocated memory is still 304.6 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.60 ms. Allocated memory is still 304.6 MB. Free memory was 259.9 MB in the beginning and 257.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 46.45 ms. Allocated memory is still 304.6 MB. Free memory was 257.9 MB in the beginning and 255.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 337.00 ms. Allocated memory is still 304.6 MB. Free memory was 255.9 MB in the beginning and 245.8 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 100.84 ms. Allocated memory is still 304.6 MB. Free memory was 245.8 MB in the beginning and 242.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58340.45 ms. Allocated memory was 304.6 MB in the beginning and 1.3 GB in the end (delta: 1.0 GB). Free memory was 241.8 MB in the beginning and 1.2 GB in the end (delta: -933.8 MB). Peak memory consumption was 109.6 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 analyzing trace of length 41 with TraceHistMax 35, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 4. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 6 locations, 1 error locations. TIMEOUT Result, 58.2s OverallTime, 38 OverallIterations, 35 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 188 SDtfs, 0 SDslu, 1971 SDs, 0 SdLazy, 16652 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1443 GetRequests, 432 SyntacticMatches, 320 SemanticMatches, 691 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 29.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 37 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 34.2s InterpolantComputationTime, 1553 NumberOfCodeBlocks, 1553 NumberOfCodeBlocksAsserted, 225 NumberOfCheckSat, 1481 ConstructedInterpolants, 0 QuantifiedInterpolants, 997019 SizeOfPredicates, 208 NumberOfNonLiveVariables, 30805 ConjunctsInSsa, 11095 ConjunctsInUnsatCore, 72 InterpolantComputations, 3 PerfectInterpolantSequences, 2/14283 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/003b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-58-22-465.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-58-22-465.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-58-22-465.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/003b-horn.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-58-22-465.csv Completed graceful shutdown