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/llreve/break_single_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:48:27,125 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:48:27,127 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:48:27,140 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:48:27,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:48:27,141 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:48:27,143 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:48:27,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:48:27,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:48:27,148 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:48:27,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:48:27,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:48:27,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:48:27,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:48:27,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:48:27,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:48:27,154 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:48:27,158 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:48:27,160 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:48:27,173 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:48:27,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:48:27,175 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:48:27,177 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:48:27,177 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:48:27,177 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:48:27,178 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:48:27,179 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:48:27,179 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:48:27,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:48:27,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:48:27,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:48:27,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:48:27,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:48:27,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:48:27,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:48:27,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:48:27,189 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:48:27,203 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:48:27,203 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:48:27,204 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:48:27,204 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:48:27,205 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:48:27,205 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:48:27,205 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:48:27,205 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:48:27,205 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:48:27,206 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:48:27,206 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:48:27,206 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:48:27,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:48:27,207 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:48:27,207 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:48:27,207 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:48:27,207 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:48:27,207 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:48:27,207 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:48:27,208 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:48:27,208 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:48:27,209 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:48:27,210 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:48:27,243 INFO ]: Repository-Root is: /tmp [2018-06-26 17:48:27,260 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:48:27,264 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:48:27,265 INFO ]: Initializing SmtParser... [2018-06-26 17:48:27,265 INFO ]: SmtParser initialized [2018-06-26 17:48:27,266 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-26 17:48:27,267 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:48:27,353 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 unknown [2018-06-26 17:48:27,523 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/break_single_merged_safe.c-1.smt2 [2018-06-26 17:48:27,527 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:48:27,534 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:48:27,534 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:48:27,535 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:48:27,535 INFO ]: ChcToBoogie initialized [2018-06-26 17:48:27,538 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,585 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27 Unit [2018-06-26 17:48:27,585 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:48:27,586 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:48:27,586 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:48:27,586 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:48:27,607 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,607 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,616 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,616 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,619 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,620 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,621 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,623 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:48:27,624 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:48:27,624 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:48:27,624 INFO ]: RCFGBuilder initialized [2018-06-26 17:48:27,625 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (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:48:27,639 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:48:27,639 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:48:27,639 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:48:27,639 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:48:27,639 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:48:27,639 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:48:27,790 INFO ]: Using library mode [2018-06-26 17:48:27,790 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:48:27 BoogieIcfgContainer [2018-06-26 17:48:27,790 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:48:27,791 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:48:27,791 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:48:27,791 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:48:27,792 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:48:27" (1/1) ... [2018-06-26 17:48:27,805 INFO ]: Initial Icfg 12 locations, 14 edges [2018-06-26 17:48:27,806 INFO ]: Using Remove infeasible edges [2018-06-26 17:48:27,807 INFO ]: Using Maximize final states [2018-06-26 17:48:27,807 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:48:27,807 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:48:27,812 INFO ]: Using Remove sink states [2018-06-26 17:48:27,813 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:48:27,813 INFO ]: Using Use SBE [2018-06-26 17:48:27,831 INFO ]: SBE split 1 edges [2018-06-26 17:48:27,835 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:48:27,837 INFO ]: 0 new accepting states [2018-06-26 17:48:27,900 INFO ]: Removed 7 edges and 3 locations by large block encoding [2018-06-26 17:48:27,903 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:48:27,904 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:48:27,904 INFO ]: 0 new accepting states [2018-06-26 17:48:27,904 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:48:27,905 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:48:27,905 INFO ]: Encoded RCFG 7 locations, 10 edges [2018-06-26 17:48:27,905 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:48:27 BasicIcfg [2018-06-26 17:48:27,905 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:48:27,906 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:48:27,906 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:48:27,917 INFO ]: TraceAbstraction initialized [2018-06-26 17:48:27,917 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:48:27" (1/4) ... [2018-06-26 17:48:27,918 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cefb625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:48:27, skipping insertion in model container [2018-06-26 17:48:27,918 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:48:27" (2/4) ... [2018-06-26 17:48:27,918 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cefb625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:48:27, skipping insertion in model container [2018-06-26 17:48:27,918 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:48:27" (3/4) ... [2018-06-26 17:48:27,919 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cefb625 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:48:27, skipping insertion in model container [2018-06-26 17:48:27,919 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:48:27" (4/4) ... [2018-06-26 17:48:27,920 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:48:27,929 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:48:27,937 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:48:27,995 INFO ]: Using default assertion order modulation [2018-06-26 17:48:27,996 INFO ]: Interprodecural is true [2018-06-26 17:48:27,996 INFO ]: Hoare is false [2018-06-26 17:48:27,996 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:48:27,996 INFO ]: Backedges is TWOTRACK [2018-06-26 17:48:27,996 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:48:27,996 INFO ]: Difference is false [2018-06-26 17:48:27,996 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:48:27,996 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:48:28,005 INFO ]: Start isEmpty. Operand 7 states. [2018-06-26 17:48:28,013 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:48:28,013 INFO ]: Found error trace [2018-06-26 17:48:28,014 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:48:28,014 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:28,019 INFO ]: Analyzing trace with hash 1189513717, now seen corresponding path program 1 times [2018-06-26 17:48:28,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:28,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:28,058 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:28,059 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:28,059 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:28,092 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:28,136 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:48:28,137 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:48:28,137 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:48:28,139 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:48:28,150 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:48:28,151 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:48:28,153 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-26 17:48:28,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:28,230 INFO ]: Finished difference Result 10 states and 15 transitions. [2018-06-26 17:48:28,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:48:28,231 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-26 17:48:28,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:28,241 INFO ]: With dead ends: 10 [2018-06-26 17:48:28,241 INFO ]: Without dead ends: 10 [2018-06-26 17:48:28,243 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:48:28,258 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:48:28,281 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-06-26 17:48:28,282 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:48:28,283 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-26 17:48:28,284 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 6 [2018-06-26 17:48:28,284 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:28,284 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-26 17:48:28,284 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:48:28,284 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-26 17:48:28,285 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:48:28,285 INFO ]: Found error trace [2018-06-26 17:48:28,285 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:48:28,285 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:28,286 INFO ]: Analyzing trace with hash 1189573299, now seen corresponding path program 1 times [2018-06-26 17:48:28,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:28,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:28,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:28,287 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:28,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:28,297 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:28,436 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:48:28,437 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:48:28,437 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:48:28,438 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:48:28,438 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:48:28,438 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:48:28,438 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2018-06-26 17:48:28,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:28,640 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-26 17:48:28,641 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:48:28,641 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:48:28,641 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:28,643 INFO ]: With dead ends: 13 [2018-06-26 17:48:28,643 INFO ]: Without dead ends: 13 [2018-06-26 17:48:28,643 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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:48:28,643 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:48:28,646 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 17:48:28,646 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:48:28,647 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2018-06-26 17:48:28,647 INFO ]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 6 [2018-06-26 17:48:28,647 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:28,647 INFO ]: Abstraction has 10 states and 16 transitions. [2018-06-26 17:48:28,647 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:48:28,647 INFO ]: Start isEmpty. Operand 10 states and 16 transitions. [2018-06-26 17:48:28,647 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:48:28,647 INFO ]: Found error trace [2018-06-26 17:48:28,647 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:28,647 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:28,648 INFO ]: Analyzing trace with hash -1778344510, now seen corresponding path program 1 times [2018-06-26 17:48:28,648 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:28,648 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:28,648 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:28,648 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:28,649 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:28,657 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:28,739 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:48:28,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:28,739 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:48:28,745 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:28,763 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:28,770 INFO ]: Computing forward predicates... [2018-06-26 17:48:28,853 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:48:28,872 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:28,872 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-06-26 17:48:28,872 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:48:28,873 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:48:28,873 INFO ]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:28,873 INFO ]: Start difference. First operand 10 states and 16 transitions. Second operand 7 states. [2018-06-26 17:48:29,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:29,184 INFO ]: Finished difference Result 17 states and 24 transitions. [2018-06-26 17:48:29,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:48:29,185 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-26 17:48:29,185 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:29,185 INFO ]: With dead ends: 17 [2018-06-26 17:48:29,185 INFO ]: Without dead ends: 14 [2018-06-26 17:48:29,186 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:48:29,186 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:48:29,188 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-06-26 17:48:29,188 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:48:29,188 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-06-26 17:48:29,188 INFO ]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 [2018-06-26 17:48:29,188 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:29,188 INFO ]: Abstraction has 13 states and 19 transitions. [2018-06-26 17:48:29,188 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:48:29,188 INFO ]: Start isEmpty. Operand 13 states and 19 transitions. [2018-06-26 17:48:29,189 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:48:29,189 INFO ]: Found error trace [2018-06-26 17:48:29,189 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:29,189 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:29,189 INFO ]: Analyzing trace with hash -1751562401, now seen corresponding path program 1 times [2018-06-26 17:48:29,189 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:29,189 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:29,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,190 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:29,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,195 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:29,225 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:29,225 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:48:29,225 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-26 17:48:29,225 INFO ]: Interpolant automaton has 3 states [2018-06-26 17:48:29,225 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-26 17:48:29,225 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-26 17:48:29,226 INFO ]: Start difference. First operand 13 states and 19 transitions. Second operand 3 states. [2018-06-26 17:48:29,235 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:29,236 INFO ]: Finished difference Result 13 states and 17 transitions. [2018-06-26 17:48:29,236 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-26 17:48:29,236 INFO ]: Start accepts. Automaton has 3 states. Word has length 7 [2018-06-26 17:48:29,236 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:29,236 INFO ]: With dead ends: 13 [2018-06-26 17:48:29,236 INFO ]: Without dead ends: 13 [2018-06-26 17:48:29,237 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:48:29,237 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:48:29,238 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:48:29,238 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:48:29,239 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-06-26 17:48:29,239 INFO ]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2018-06-26 17:48:29,239 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:29,239 INFO ]: Abstraction has 13 states and 17 transitions. [2018-06-26 17:48:29,239 INFO ]: Interpolant automaton has 3 states. [2018-06-26 17:48:29,239 INFO ]: Start isEmpty. Operand 13 states and 17 transitions. [2018-06-26 17:48:29,239 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:48:29,239 INFO ]: Found error trace [2018-06-26 17:48:29,239 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:29,239 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:29,240 INFO ]: Analyzing trace with hash -1750787835, now seen corresponding path program 1 times [2018-06-26 17:48:29,240 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:29,240 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:29,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,240 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:29,240 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,248 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:29,291 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:48:29,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:29,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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:29,297 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:29,318 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:29,319 INFO ]: Computing forward predicates... [2018-06-26 17:48:29,325 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:48:29,344 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:29,344 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-06-26 17:48:29,344 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:48:29,344 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:48:29,344 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:48:29,345 INFO ]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-06-26 17:48:29,452 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:29,452 INFO ]: Finished difference Result 14 states and 18 transitions. [2018-06-26 17:48:29,452 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:48:29,452 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 17:48:29,452 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:29,453 INFO ]: With dead ends: 14 [2018-06-26 17:48:29,453 INFO ]: Without dead ends: 14 [2018-06-26 17:48:29,453 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:48:29,453 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:48:29,454 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:48:29,455 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:48:29,455 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2018-06-26 17:48:29,455 INFO ]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2018-06-26 17:48:29,455 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:29,455 INFO ]: Abstraction has 14 states and 18 transitions. [2018-06-26 17:48:29,455 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:48:29,455 INFO ]: Start isEmpty. Operand 14 states and 18 transitions. [2018-06-26 17:48:29,456 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:48:29,456 INFO ]: Found error trace [2018-06-26 17:48:29,456 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:29,456 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:29,456 INFO ]: Analyzing trace with hash 1560515414, now seen corresponding path program 2 times [2018-06-26 17:48:29,456 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:29,456 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:29,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,457 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:29,457 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,472 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:29,548 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:48:29,549 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:29,549 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:48:29,557 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:29,599 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:29,599 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:29,600 INFO ]: Computing forward predicates... [2018-06-26 17:48:29,610 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:48:29,639 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:29,639 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-06-26 17:48:29,639 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:48:29,639 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:48:29,639 INFO ]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:29,640 INFO ]: Start difference. First operand 14 states and 18 transitions. Second operand 5 states. [2018-06-26 17:48:29,665 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:29,665 INFO ]: Finished difference Result 15 states and 19 transitions. [2018-06-26 17:48:29,665 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:48:29,665 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 17:48:29,665 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:29,666 INFO ]: With dead ends: 15 [2018-06-26 17:48:29,666 INFO ]: Without dead ends: 15 [2018-06-26 17:48:29,666 INFO ]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:48:29,666 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:48:29,667 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:48:29,667 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:48:29,668 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2018-06-26 17:48:29,668 INFO ]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 8 [2018-06-26 17:48:29,668 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:29,668 INFO ]: Abstraction has 15 states and 19 transitions. [2018-06-26 17:48:29,668 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:48:29,668 INFO ]: Start isEmpty. Operand 15 states and 19 transitions. [2018-06-26 17:48:29,668 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:48:29,668 INFO ]: Found error trace [2018-06-26 17:48:29,669 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:29,669 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:29,670 INFO ]: Analyzing trace with hash 1131701029, now seen corresponding path program 3 times [2018-06-26 17:48:29,670 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:29,670 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:29,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,671 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:29,671 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:29,680 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:29,793 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:48:29,793 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:29,793 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:29,799 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:29,817 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-26 17:48:29,817 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:29,818 INFO ]: Computing forward predicates... [2018-06-26 17:48:29,838 INFO ]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:29,858 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:48:29,858 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-06-26 17:48:29,858 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:48:29,858 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:48:29,858 INFO ]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:48:29,859 INFO ]: Start difference. First operand 15 states and 19 transitions. Second operand 8 states. [2018-06-26 17:48:30,259 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:30,260 INFO ]: Finished difference Result 17 states and 21 transitions. [2018-06-26 17:48:30,260 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:48:30,260 INFO ]: Start accepts. Automaton has 8 states. Word has length 9 [2018-06-26 17:48:30,260 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:30,260 INFO ]: With dead ends: 17 [2018-06-26 17:48:30,260 INFO ]: Without dead ends: 17 [2018-06-26 17:48:30,261 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:48:30,261 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:48:30,262 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-06-26 17:48:30,262 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:48:30,263 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-06-26 17:48:30,263 INFO ]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2018-06-26 17:48:30,263 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:30,263 INFO ]: Abstraction has 16 states and 20 transitions. [2018-06-26 17:48:30,263 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:48:30,263 INFO ]: Start isEmpty. Operand 16 states and 20 transitions. [2018-06-26 17:48:30,263 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:48:30,263 INFO ]: Found error trace [2018-06-26 17:48:30,263 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:30,263 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:30,263 INFO ]: Analyzing trace with hash -758292527, now seen corresponding path program 1 times [2018-06-26 17:48:30,263 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:30,264 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:30,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,264 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:30,264 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,277 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,334 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:30,334 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:30,334 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:48:30,340 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:30,366 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,368 INFO ]: Computing forward predicates... [2018-06-26 17:48:30,426 INFO ]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:30,447 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:30,447 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-26 17:48:30,447 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:48:30,447 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:48:30,447 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:30,448 INFO ]: Start difference. First operand 16 states and 20 transitions. Second operand 7 states. [2018-06-26 17:48:30,467 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:30,467 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-26 17:48:30,467 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:48:30,467 INFO ]: Start accepts. Automaton has 7 states. Word has length 10 [2018-06-26 17:48:30,467 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:30,467 INFO ]: With dead ends: 19 [2018-06-26 17:48:30,467 INFO ]: Without dead ends: 19 [2018-06-26 17:48:30,468 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:30,468 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:48:30,469 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-06-26 17:48:30,469 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:48:30,470 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2018-06-26 17:48:30,470 INFO ]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2018-06-26 17:48:30,470 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:30,470 INFO ]: Abstraction has 18 states and 22 transitions. [2018-06-26 17:48:30,470 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:48:30,470 INFO ]: Start isEmpty. Operand 18 states and 22 transitions. [2018-06-26 17:48:30,470 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:48:30,470 INFO ]: Found error trace [2018-06-26 17:48:30,470 INFO ]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:30,471 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:30,471 INFO ]: Analyzing trace with hash 948818847, now seen corresponding path program 1 times [2018-06-26 17:48:30,471 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:30,471 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:30,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,471 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:30,471 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,488 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,527 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:30,527 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:30,527 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:48:30,536 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:30,563 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,564 INFO ]: Computing forward predicates... [2018-06-26 17:48:30,571 INFO ]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:30,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:30,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 17:48:30,602 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:48:30,602 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:48:30,602 INFO ]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:30,602 INFO ]: Start difference. First operand 18 states and 22 transitions. Second operand 7 states. [2018-06-26 17:48:30,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:30,674 INFO ]: Finished difference Result 19 states and 23 transitions. [2018-06-26 17:48:30,674 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:48:30,674 INFO ]: Start accepts. Automaton has 7 states. Word has length 11 [2018-06-26 17:48:30,674 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:30,675 INFO ]: With dead ends: 19 [2018-06-26 17:48:30,675 INFO ]: Without dead ends: 19 [2018-06-26 17:48:30,675 INFO ]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:30,675 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:48:30,677 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:48:30,677 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:48:30,677 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-06-26 17:48:30,677 INFO ]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2018-06-26 17:48:30,677 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:30,677 INFO ]: Abstraction has 19 states and 23 transitions. [2018-06-26 17:48:30,677 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:48:30,677 INFO ]: Start isEmpty. Operand 19 states and 23 transitions. [2018-06-26 17:48:30,678 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:48:30,678 INFO ]: Found error trace [2018-06-26 17:48:30,678 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:30,678 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:30,678 INFO ]: Analyzing trace with hash 1412166193, now seen corresponding path program 2 times [2018-06-26 17:48:30,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:30,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:30,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,679 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:30,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,687 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,740 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:30,740 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:30,740 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:48:30,746 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:30,784 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:30,784 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,786 INFO ]: Computing forward predicates... [2018-06-26 17:48:30,804 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:30,824 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:30,824 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-26 17:48:30,824 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:48:30,824 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:48:30,824 INFO ]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:48:30,824 INFO ]: Start difference. First operand 19 states and 23 transitions. Second operand 9 states. [2018-06-26 17:48:30,858 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:30,858 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-26 17:48:30,860 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:48:30,860 INFO ]: Start accepts. Automaton has 9 states. Word has length 12 [2018-06-26 17:48:30,860 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:30,861 INFO ]: With dead ends: 22 [2018-06-26 17:48:30,861 INFO ]: Without dead ends: 22 [2018-06-26 17:48:30,861 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:48:30,861 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:48:30,863 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-06-26 17:48:30,863 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:48:30,863 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-06-26 17:48:30,863 INFO ]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2018-06-26 17:48:30,863 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:30,863 INFO ]: Abstraction has 21 states and 25 transitions. [2018-06-26 17:48:30,863 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:48:30,863 INFO ]: Start isEmpty. Operand 21 states and 25 transitions. [2018-06-26 17:48:30,864 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:48:30,864 INFO ]: Found error trace [2018-06-26 17:48:30,864 INFO ]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:30,864 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:30,864 INFO ]: Analyzing trace with hash -627786384, now seen corresponding path program 2 times [2018-06-26 17:48:30,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:30,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:30,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,865 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:30,865 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:30,875 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,937 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:30,938 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:30,938 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:48:30,943 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:30,967 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:30,967 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:30,968 INFO ]: Computing forward predicates... [2018-06-26 17:48:30,978 INFO ]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:31,001 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:31,001 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-26 17:48:31,001 INFO ]: Interpolant automaton has 8 states [2018-06-26 17:48:31,001 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-26 17:48:31,001 INFO ]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:48:31,001 INFO ]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2018-06-26 17:48:31,038 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:31,038 INFO ]: Finished difference Result 22 states and 26 transitions. [2018-06-26 17:48:31,039 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:48:31,039 INFO ]: Start accepts. Automaton has 8 states. Word has length 12 [2018-06-26 17:48:31,039 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:31,039 INFO ]: With dead ends: 22 [2018-06-26 17:48:31,039 INFO ]: Without dead ends: 22 [2018-06-26 17:48:31,039 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:48:31,039 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:48:31,041 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:48:31,041 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:48:31,042 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2018-06-26 17:48:31,042 INFO ]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 12 [2018-06-26 17:48:31,042 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:31,042 INFO ]: Abstraction has 22 states and 26 transitions. [2018-06-26 17:48:31,042 INFO ]: Interpolant automaton has 8 states. [2018-06-26 17:48:31,042 INFO ]: Start isEmpty. Operand 22 states and 26 transitions. [2018-06-26 17:48:31,042 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:48:31,042 INFO ]: Found error trace [2018-06-26 17:48:31,042 INFO ]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:31,042 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:31,043 INFO ]: Analyzing trace with hash 2037059007, now seen corresponding path program 3 times [2018-06-26 17:48:31,043 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:31,043 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:31,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:31,043 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:31,043 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:31,053 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:31,256 INFO ]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:31,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:31,256 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:48:31,265 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:31,299 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:48:31,299 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:31,301 INFO ]: Computing forward predicates... [2018-06-26 17:48:31,394 INFO ]: Checked inductivity of 22 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:48:31,414 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:31,414 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2018-06-26 17:48:31,414 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:48:31,414 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:48:31,414 INFO ]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:48:31,414 INFO ]: Start difference. First operand 22 states and 26 transitions. Second operand 13 states. [2018-06-26 17:48:31,667 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:31,667 INFO ]: Finished difference Result 35 states and 41 transitions. [2018-06-26 17:48:31,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:48:31,667 INFO ]: Start accepts. Automaton has 13 states. Word has length 13 [2018-06-26 17:48:31,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:31,667 INFO ]: With dead ends: 35 [2018-06-26 17:48:31,667 INFO ]: Without dead ends: 35 [2018-06-26 17:48:31,668 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:31,668 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:48:31,671 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-06-26 17:48:31,671 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:48:31,671 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-06-26 17:48:31,672 INFO ]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2018-06-26 17:48:31,672 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:31,672 INFO ]: Abstraction has 23 states and 27 transitions. [2018-06-26 17:48:31,672 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:48:31,672 INFO ]: Start isEmpty. Operand 23 states and 27 transitions. [2018-06-26 17:48:31,672 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:48:31,672 INFO ]: Found error trace [2018-06-26 17:48:31,672 INFO ]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:31,672 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:31,672 INFO ]: Analyzing trace with hash -131109743, now seen corresponding path program 3 times [2018-06-26 17:48:31,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:31,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:31,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:31,673 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:31,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:31,681 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:31,752 INFO ]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:31,753 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:31,753 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:48:31,758 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:31,777 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:48:31,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:31,779 INFO ]: Computing forward predicates... [2018-06-26 17:48:31,804 INFO ]: Checked inductivity of 29 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:31,823 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:31,823 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 17:48:31,823 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:48:31,823 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:48:31,823 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:48:31,824 INFO ]: Start difference. First operand 23 states and 27 transitions. Second operand 11 states. [2018-06-26 17:48:31,840 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:31,840 INFO ]: Finished difference Result 27 states and 31 transitions. [2018-06-26 17:48:31,842 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:48:31,842 INFO ]: Start accepts. Automaton has 11 states. Word has length 14 [2018-06-26 17:48:31,842 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:31,842 INFO ]: With dead ends: 27 [2018-06-26 17:48:31,842 INFO ]: Without dead ends: 27 [2018-06-26 17:48:31,842 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:48:31,842 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:48:31,844 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-06-26 17:48:31,844 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:48:31,845 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-06-26 17:48:31,845 INFO ]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2018-06-26 17:48:31,845 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:31,845 INFO ]: Abstraction has 25 states and 29 transitions. [2018-06-26 17:48:31,845 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:48:31,845 INFO ]: Start isEmpty. Operand 25 states and 29 transitions. [2018-06-26 17:48:31,845 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:48:31,845 INFO ]: Found error trace [2018-06-26 17:48:31,846 INFO ]: trace histogram [7, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:31,849 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:31,849 INFO ]: Analyzing trace with hash -160179003, now seen corresponding path program 4 times [2018-06-26 17:48:31,849 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:31,849 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:31,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:31,850 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:31,850 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:31,870 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:32,256 INFO ]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:32,256 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:32,256 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:48:32,262 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:32,275 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:32,275 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:32,276 INFO ]: Computing forward predicates... [2018-06-26 17:48:32,285 INFO ]: Checked inductivity of 31 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:32,304 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:32,304 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-26 17:48:32,304 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:48:32,305 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:48:32,305 INFO ]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:48:32,305 INFO ]: Start difference. First operand 25 states and 29 transitions. Second operand 10 states. [2018-06-26 17:48:32,346 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:32,346 INFO ]: Finished difference Result 26 states and 30 transitions. [2018-06-26 17:48:32,349 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:48:32,349 INFO ]: Start accepts. Automaton has 10 states. Word has length 15 [2018-06-26 17:48:32,349 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:32,350 INFO ]: With dead ends: 26 [2018-06-26 17:48:32,350 INFO ]: Without dead ends: 26 [2018-06-26 17:48:32,350 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:48:32,350 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:48:32,352 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:48:32,352 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:48:32,353 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-06-26 17:48:32,353 INFO ]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 15 [2018-06-26 17:48:32,353 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:32,353 INFO ]: Abstraction has 26 states and 30 transitions. [2018-06-26 17:48:32,353 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:48:32,353 INFO ]: Start isEmpty. Operand 26 states and 30 transitions. [2018-06-26 17:48:32,353 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:48:32,353 INFO ]: Found error trace [2018-06-26 17:48:32,353 INFO ]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:32,353 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:32,354 INFO ]: Analyzing trace with hash -1455567119, now seen corresponding path program 4 times [2018-06-26 17:48:32,354 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:32,354 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:32,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:32,354 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:32,354 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:32,363 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:32,578 INFO ]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:32,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:32,578 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:48:32,584 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:32,597 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:32,597 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:32,599 INFO ]: Computing forward predicates... [2018-06-26 17:48:32,679 INFO ]: Checked inductivity of 46 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:48:32,704 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:32,704 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-26 17:48:32,704 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:48:32,705 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:48:32,705 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:48:32,705 INFO ]: Start difference. First operand 26 states and 30 transitions. Second operand 13 states. [2018-06-26 17:48:32,721 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:32,721 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-26 17:48:32,721 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:48:32,721 INFO ]: Start accepts. Automaton has 13 states. Word has length 16 [2018-06-26 17:48:32,721 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:32,721 INFO ]: With dead ends: 30 [2018-06-26 17:48:32,721 INFO ]: Without dead ends: 30 [2018-06-26 17:48:32,722 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:48:32,722 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:48:32,724 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-06-26 17:48:32,724 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:48:32,725 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-06-26 17:48:32,725 INFO ]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 16 [2018-06-26 17:48:32,725 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:32,725 INFO ]: Abstraction has 28 states and 32 transitions. [2018-06-26 17:48:32,725 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:48:32,725 INFO ]: Start isEmpty. Operand 28 states and 32 transitions. [2018-06-26 17:48:32,726 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:48:32,726 INFO ]: Found error trace [2018-06-26 17:48:32,726 INFO ]: trace histogram [8, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:32,726 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:32,726 INFO ]: Analyzing trace with hash 73365014, now seen corresponding path program 5 times [2018-06-26 17:48:32,726 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:32,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:32,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:32,727 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:32,727 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:32,735 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:32,823 INFO ]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:32,823 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:32,823 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:48:32,829 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:32,845 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 17:48:32,845 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:32,846 INFO ]: Computing forward predicates... [2018-06-26 17:48:32,855 INFO ]: Checked inductivity of 39 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:32,879 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:32,879 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 17:48:32,880 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:48:32,880 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:48:32,880 INFO ]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:48:32,880 INFO ]: Start difference. First operand 28 states and 32 transitions. Second operand 11 states. [2018-06-26 17:48:32,908 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:32,908 INFO ]: Finished difference Result 29 states and 33 transitions. [2018-06-26 17:48:32,909 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:48:32,909 INFO ]: Start accepts. Automaton has 11 states. Word has length 16 [2018-06-26 17:48:32,909 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:32,909 INFO ]: With dead ends: 29 [2018-06-26 17:48:32,909 INFO ]: Without dead ends: 29 [2018-06-26 17:48:32,910 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:48:32,910 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:48:32,911 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:48:32,911 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:48:32,912 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-06-26 17:48:32,912 INFO ]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 16 [2018-06-26 17:48:32,912 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:32,912 INFO ]: Abstraction has 29 states and 33 transitions. [2018-06-26 17:48:32,912 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:48:32,912 INFO ]: Start isEmpty. Operand 29 states and 33 transitions. [2018-06-26 17:48:32,912 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:48:32,912 INFO ]: Found error trace [2018-06-26 17:48:32,912 INFO ]: trace histogram [9, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:32,912 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:32,913 INFO ]: Analyzing trace with hash -1276705051, now seen corresponding path program 6 times [2018-06-26 17:48:32,913 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:32,913 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:32,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:32,913 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:32,913 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:32,922 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,005 INFO ]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:33,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:33,005 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:48:33,011 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:48:33,043 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 17:48:33,043 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,044 INFO ]: Computing forward predicates... [2018-06-26 17:48:33,056 INFO ]: Checked inductivity of 48 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:33,082 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:33,082 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-26 17:48:33,083 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:48:33,083 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:48:33,083 INFO ]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:48:33,083 INFO ]: Start difference. First operand 29 states and 33 transitions. Second operand 12 states. [2018-06-26 17:48:33,108 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:33,108 INFO ]: Finished difference Result 30 states and 34 transitions. [2018-06-26 17:48:33,108 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:48:33,108 INFO ]: Start accepts. Automaton has 12 states. Word has length 17 [2018-06-26 17:48:33,108 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:33,109 INFO ]: With dead ends: 30 [2018-06-26 17:48:33,109 INFO ]: Without dead ends: 30 [2018-06-26 17:48:33,109 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:48:33,109 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:48:33,111 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:48:33,111 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:48:33,111 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-06-26 17:48:33,111 INFO ]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2018-06-26 17:48:33,112 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:33,112 INFO ]: Abstraction has 30 states and 34 transitions. [2018-06-26 17:48:33,112 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:48:33,112 INFO ]: Start isEmpty. Operand 30 states and 34 transitions. [2018-06-26 17:48:33,112 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:48:33,112 INFO ]: Found error trace [2018-06-26 17:48:33,112 INFO ]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:33,112 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:33,112 INFO ]: Analyzing trace with hash 1346181457, now seen corresponding path program 5 times [2018-06-26 17:48:33,112 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:33,112 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:33,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:33,113 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:33,113 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:33,132 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,310 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:48:33,310 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:33,310 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:48:33,316 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:33,342 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:48:33,342 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,345 INFO ]: Computing forward predicates... [2018-06-26 17:48:33,356 INFO ]: Checked inductivity of 67 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:48:33,374 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:33,374 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 17:48:33,374 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:48:33,374 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:48:33,375 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:48:33,375 INFO ]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2018-06-26 17:48:33,418 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:33,418 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-26 17:48:33,418 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:48:33,418 INFO ]: Start accepts. Automaton has 7 states. Word has length 18 [2018-06-26 17:48:33,418 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:33,419 INFO ]: With dead ends: 43 [2018-06-26 17:48:33,419 INFO ]: Without dead ends: 31 [2018-06-26 17:48:33,419 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:48:33,419 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:48:33,421 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:48:33,421 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:48:33,421 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-06-26 17:48:33,421 INFO ]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 18 [2018-06-26 17:48:33,421 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:33,421 INFO ]: Abstraction has 31 states and 35 transitions. [2018-06-26 17:48:33,421 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:48:33,421 INFO ]: Start isEmpty. Operand 31 states and 35 transitions. [2018-06-26 17:48:33,422 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:48:33,422 INFO ]: Found error trace [2018-06-26 17:48:33,422 INFO ]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:33,422 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:33,422 INFO ]: Analyzing trace with hash -179204106, now seen corresponding path program 7 times [2018-06-26 17:48:33,422 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:33,422 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:33,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:33,426 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:33,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:33,434 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,560 INFO ]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:33,561 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:33,561 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:48:33,567 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:33,598 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,600 INFO ]: Computing forward predicates... [2018-06-26 17:48:33,610 INFO ]: Checked inductivity of 58 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:33,642 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:33,642 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 17:48:33,642 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:48:33,642 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:48:33,642 INFO ]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:48:33,642 INFO ]: Start difference. First operand 31 states and 35 transitions. Second operand 13 states. [2018-06-26 17:48:33,762 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:33,762 INFO ]: Finished difference Result 32 states and 36 transitions. [2018-06-26 17:48:33,762 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:48:33,762 INFO ]: Start accepts. Automaton has 13 states. Word has length 18 [2018-06-26 17:48:33,762 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:33,763 INFO ]: With dead ends: 32 [2018-06-26 17:48:33,763 INFO ]: Without dead ends: 32 [2018-06-26 17:48:33,763 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:48:33,763 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:48:33,767 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:48:33,767 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:48:33,768 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-06-26 17:48:33,768 INFO ]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 18 [2018-06-26 17:48:33,768 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:33,768 INFO ]: Abstraction has 32 states and 36 transitions. [2018-06-26 17:48:33,768 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:48:33,768 INFO ]: Start isEmpty. Operand 32 states and 36 transitions. [2018-06-26 17:48:33,769 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:48:33,769 INFO ]: Found error trace [2018-06-26 17:48:33,769 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:33,769 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:33,769 INFO ]: Analyzing trace with hash -935612862, now seen corresponding path program 6 times [2018-06-26 17:48:33,769 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:33,769 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:33,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:33,770 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:33,770 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:33,778 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,872 INFO ]: Checked inductivity of 69 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:48:33,872 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:33,872 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:48:33,878 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:48:33,900 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:48:33,900 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:33,903 INFO ]: Computing forward predicates... [2018-06-26 17:48:34,214 INFO ]: Checked inductivity of 69 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:34,245 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:34,245 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14] total 18 [2018-06-26 17:48:34,246 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:48:34,246 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:48:34,246 INFO ]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:48:34,246 INFO ]: Start difference. First operand 32 states and 36 transitions. Second operand 18 states. [2018-06-26 17:48:34,505 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:34,505 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-26 17:48:34,505 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:48:34,505 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-26 17:48:34,505 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:34,505 INFO ]: With dead ends: 42 [2018-06-26 17:48:34,505 INFO ]: Without dead ends: 33 [2018-06-26 17:48:34,506 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=660, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:48:34,506 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:48:34,508 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:48:34,508 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:48:34,509 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-06-26 17:48:34,509 INFO ]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-06-26 17:48:34,509 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:34,509 INFO ]: Abstraction has 33 states and 37 transitions. [2018-06-26 17:48:34,509 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:48:34,509 INFO ]: Start isEmpty. Operand 33 states and 37 transitions. [2018-06-26 17:48:34,509 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:48:34,509 INFO ]: Found error trace [2018-06-26 17:48:34,509 INFO ]: trace histogram [11, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:34,510 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:34,510 INFO ]: Analyzing trace with hash -516413179, now seen corresponding path program 8 times [2018-06-26 17:48:34,510 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:34,510 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:34,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:34,510 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:34,510 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:34,521 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:35,232 INFO ]: Checked inductivity of 69 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:48:35,232 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:35,232 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:48:35,247 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:35,263 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:35,263 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:35,265 INFO ]: Computing forward predicates... [2018-06-26 17:48:35,556 INFO ]: Checked inductivity of 69 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:48:35,576 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:35,576 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15] total 18 [2018-06-26 17:48:35,576 INFO ]: Interpolant automaton has 18 states [2018-06-26 17:48:35,576 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-26 17:48:35,576 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:48:35,576 INFO ]: Start difference. First operand 33 states and 37 transitions. Second operand 18 states. [2018-06-26 17:48:36,545 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:36,545 INFO ]: Finished difference Result 49 states and 54 transitions. [2018-06-26 17:48:36,545 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:48:36,545 INFO ]: Start accepts. Automaton has 18 states. Word has length 19 [2018-06-26 17:48:36,545 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:36,545 INFO ]: With dead ends: 49 [2018-06-26 17:48:36,545 INFO ]: Without dead ends: 49 [2018-06-26 17:48:36,546 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=1237, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:48:36,546 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 17:48:36,548 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-06-26 17:48:36,548 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:48:36,549 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-06-26 17:48:36,549 INFO ]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 19 [2018-06-26 17:48:36,549 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:36,549 INFO ]: Abstraction has 33 states and 37 transitions. [2018-06-26 17:48:36,549 INFO ]: Interpolant automaton has 18 states. [2018-06-26 17:48:36,549 INFO ]: Start isEmpty. Operand 33 states and 37 transitions. [2018-06-26 17:48:36,550 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:48:36,550 INFO ]: Found error trace [2018-06-26 17:48:36,550 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:36,550 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:36,550 INFO ]: Analyzing trace with hash 1343207281, now seen corresponding path program 7 times [2018-06-26 17:48:36,550 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:36,550 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:36,550 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:36,551 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:36,551 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:36,559 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:36,712 INFO ]: Checked inductivity of 72 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:48:36,712 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:36,712 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) [2018-06-26 17:48:36,726 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:36,746 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:36,748 INFO ]: Computing forward predicates... [2018-06-26 17:48:36,893 INFO ]: Checked inductivity of 72 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:48:36,913 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:36,913 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2018-06-26 17:48:36,913 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:48:36,913 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:48:36,913 INFO ]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:48:36,913 INFO ]: Start difference. First operand 33 states and 37 transitions. Second operand 19 states. [2018-06-26 17:48:37,469 WARN ]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-06-26 17:48:37,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:37,470 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-26 17:48:37,470 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:48:37,470 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-26 17:48:37,470 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:37,470 INFO ]: With dead ends: 42 [2018-06-26 17:48:37,470 INFO ]: Without dead ends: 34 [2018-06-26 17:48:37,471 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:48:37,471 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:48:37,473 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:48:37,473 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:48:37,473 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-26 17:48:37,473 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2018-06-26 17:48:37,473 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:37,473 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-26 17:48:37,473 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:48:37,474 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-26 17:48:37,474 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:48:37,474 INFO ]: Found error trace [2018-06-26 17:48:37,474 INFO ]: trace histogram [11, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:37,474 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:37,474 INFO ]: Analyzing trace with hash 1170649520, now seen corresponding path program 9 times [2018-06-26 17:48:37,474 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:37,474 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:37,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:37,475 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:37,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:37,483 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:37,761 INFO ]: Checked inductivity of 72 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:48:37,761 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:37,761 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:48:37,769 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:37,817 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:48:37,817 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:37,819 INFO ]: Computing forward predicates... [2018-06-26 17:48:37,966 INFO ]: Checked inductivity of 72 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:48:37,986 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:37,986 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-26 17:48:37,986 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:48:37,986 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:48:37,986 INFO ]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:48:37,986 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 11 states. [2018-06-26 17:48:38,143 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:38,143 INFO ]: Finished difference Result 38 states and 42 transitions. [2018-06-26 17:48:38,143 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:48:38,144 INFO ]: Start accepts. Automaton has 11 states. Word has length 20 [2018-06-26 17:48:38,144 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:38,144 INFO ]: With dead ends: 38 [2018-06-26 17:48:38,144 INFO ]: Without dead ends: 38 [2018-06-26 17:48:38,144 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=316, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:48:38,144 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:48:38,146 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-06-26 17:48:38,146 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:48:38,147 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-06-26 17:48:38,147 INFO ]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2018-06-26 17:48:38,147 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:38,147 INFO ]: Abstraction has 34 states and 38 transitions. [2018-06-26 17:48:38,147 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:48:38,147 INFO ]: Start isEmpty. Operand 34 states and 38 transitions. [2018-06-26 17:48:38,147 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:48:38,147 INFO ]: Found error trace [2018-06-26 17:48:38,147 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:38,148 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:38,148 INFO ]: Analyzing trace with hash -1027812318, now seen corresponding path program 8 times [2018-06-26 17:48:38,148 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:38,148 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:38,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:38,148 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:38,148 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:38,156 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:38,293 INFO ]: Checked inductivity of 76 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:48:38,294 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:38,294 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:48:38,300 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:38,320 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:38,320 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:38,322 INFO ]: Computing forward predicates... [2018-06-26 17:48:38,480 INFO ]: Checked inductivity of 76 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:48:38,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:38,508 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 20 [2018-06-26 17:48:38,508 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:48:38,508 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:48:38,508 INFO ]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:48:38,508 INFO ]: Start difference. First operand 34 states and 38 transitions. Second operand 20 states. [2018-06-26 17:48:38,776 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:38,776 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-26 17:48:38,776 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-26 17:48:38,776 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-26 17:48:38,776 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:38,777 INFO ]: With dead ends: 42 [2018-06-26 17:48:38,777 INFO ]: Without dead ends: 35 [2018-06-26 17:48:38,777 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=738, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:48:38,777 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:48:38,779 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:48:38,779 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:48:38,779 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-26 17:48:38,779 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-06-26 17:48:38,779 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:38,779 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-26 17:48:38,779 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:48:38,780 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-26 17:48:38,780 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:48:38,780 INFO ]: Found error trace [2018-06-26 17:48:38,780 INFO ]: trace histogram [11, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:38,780 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:38,780 INFO ]: Analyzing trace with hash 1929985637, now seen corresponding path program 10 times [2018-06-26 17:48:38,780 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:38,780 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:38,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:38,783 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:38,783 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:38,791 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:39,165 INFO ]: Checked inductivity of 76 backedges. 35 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:48:39,165 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:39,165 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:48:39,171 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:39,189 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:39,189 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:39,192 INFO ]: Computing forward predicates... [2018-06-26 17:48:39,362 INFO ]: Checked inductivity of 76 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:48:39,381 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:39,381 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 20 [2018-06-26 17:48:39,382 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:48:39,382 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:48:39,382 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:48:39,382 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 20 states. [2018-06-26 17:48:40,271 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:40,272 INFO ]: Finished difference Result 53 states and 58 transitions. [2018-06-26 17:48:40,272 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:48:40,272 INFO ]: Start accepts. Automaton has 20 states. Word has length 21 [2018-06-26 17:48:40,272 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:40,272 INFO ]: With dead ends: 53 [2018-06-26 17:48:40,272 INFO ]: Without dead ends: 53 [2018-06-26 17:48:40,273 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=389, Invalid=1591, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:48:40,273 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 17:48:40,275 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 35. [2018-06-26 17:48:40,275 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:48:40,279 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-06-26 17:48:40,279 INFO ]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 21 [2018-06-26 17:48:40,279 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:40,279 INFO ]: Abstraction has 35 states and 39 transitions. [2018-06-26 17:48:40,279 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:48:40,280 INFO ]: Start isEmpty. Operand 35 states and 39 transitions. [2018-06-26 17:48:40,280 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:48:40,280 INFO ]: Found error trace [2018-06-26 17:48:40,280 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:40,280 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:40,280 INFO ]: Analyzing trace with hash -1514975855, now seen corresponding path program 9 times [2018-06-26 17:48:40,280 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:40,280 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:40,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:40,281 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:40,281 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:40,290 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:40,475 INFO ]: Checked inductivity of 81 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:48:40,475 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:40,475 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:48:40,483 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:40,525 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:48:40,525 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:40,528 INFO ]: Computing forward predicates... [2018-06-26 17:48:40,650 INFO ]: Checked inductivity of 81 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:48:40,668 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:40,668 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 21 [2018-06-26 17:48:40,668 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:48:40,668 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:48:40,669 INFO ]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:48:40,669 INFO ]: Start difference. First operand 35 states and 39 transitions. Second operand 21 states. [2018-06-26 17:48:40,948 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:40,948 INFO ]: Finished difference Result 42 states and 46 transitions. [2018-06-26 17:48:40,948 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:48:40,948 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-26 17:48:40,948 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:40,949 INFO ]: With dead ends: 42 [2018-06-26 17:48:40,949 INFO ]: Without dead ends: 36 [2018-06-26 17:48:40,949 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=267, Invalid=789, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:48:40,949 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:48:40,951 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:48:40,951 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:48:40,951 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-26 17:48:40,951 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-06-26 17:48:40,951 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:40,951 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-26 17:48:40,951 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:48:40,951 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-26 17:48:40,952 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:48:40,952 INFO ]: Found error trace [2018-06-26 17:48:40,952 INFO ]: trace histogram [11, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:40,952 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:40,952 INFO ]: Analyzing trace with hash -300398512, now seen corresponding path program 11 times [2018-06-26 17:48:40,952 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:40,952 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:40,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:40,953 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:40,953 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:40,961 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:41,182 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:41,182 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:41,182 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:48:41,188 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:41,210 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:48:41,210 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:41,213 INFO ]: Computing forward predicates... [2018-06-26 17:48:41,339 INFO ]: Checked inductivity of 81 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:48:41,358 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:41,358 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 26 [2018-06-26 17:48:41,358 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:41,358 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:41,358 INFO ]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:41,358 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 26 states. [2018-06-26 17:48:42,589 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:42,589 INFO ]: Finished difference Result 43 states and 49 transitions. [2018-06-26 17:48:42,589 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:48:42,589 INFO ]: Start accepts. Automaton has 26 states. Word has length 22 [2018-06-26 17:48:42,589 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:42,589 INFO ]: With dead ends: 43 [2018-06-26 17:48:42,589 INFO ]: Without dead ends: 43 [2018-06-26 17:48:42,590 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=529, Invalid=2021, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 17:48:42,590 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 17:48:42,591 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-06-26 17:48:42,591 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:48:42,592 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-06-26 17:48:42,592 INFO ]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 22 [2018-06-26 17:48:42,592 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:42,592 INFO ]: Abstraction has 36 states and 40 transitions. [2018-06-26 17:48:42,592 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:42,592 INFO ]: Start isEmpty. Operand 36 states and 40 transitions. [2018-06-26 17:48:42,593 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:48:42,593 INFO ]: Found error trace [2018-06-26 17:48:42,593 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:42,593 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:42,593 INFO ]: Analyzing trace with hash 562823682, now seen corresponding path program 10 times [2018-06-26 17:48:42,593 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:42,593 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:42,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:42,593 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:42,593 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:42,610 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:43,005 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:43,005 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:43,005 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:48:43,011 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:43,028 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:43,028 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:43,030 INFO ]: Computing forward predicates... [2018-06-26 17:48:43,131 INFO ]: Checked inductivity of 87 backedges. 35 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:48:43,149 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:43,149 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 26 [2018-06-26 17:48:43,150 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:43,150 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:43,150 INFO ]: CoverageRelationStatistics Valid=155, Invalid=495, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:43,150 INFO ]: Start difference. First operand 36 states and 40 transitions. Second operand 26 states. [2018-06-26 17:48:43,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:43,689 INFO ]: Finished difference Result 48 states and 52 transitions. [2018-06-26 17:48:43,689 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:48:43,689 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-26 17:48:43,689 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:43,689 INFO ]: With dead ends: 48 [2018-06-26 17:48:43,689 INFO ]: Without dead ends: 43 [2018-06-26 17:48:43,690 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=345, Invalid=915, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:48:43,690 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 17:48:43,691 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-06-26 17:48:43,691 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:48:43,692 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-06-26 17:48:43,692 INFO ]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2018-06-26 17:48:43,692 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:43,692 INFO ]: Abstraction has 37 states and 41 transitions. [2018-06-26 17:48:43,692 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:43,692 INFO ]: Start isEmpty. Operand 37 states and 41 transitions. [2018-06-26 17:48:43,692 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:48:43,692 INFO ]: Found error trace [2018-06-26 17:48:43,692 INFO ]: trace histogram [11, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:43,692 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:43,693 INFO ]: Analyzing trace with hash -722830395, now seen corresponding path program 12 times [2018-06-26 17:48:43,693 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:43,693 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:43,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:43,693 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:43,693 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:43,701 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:43,930 INFO ]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:43,930 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:43,930 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:48:43,936 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:48:43,959 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:48:43,959 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:43,960 INFO ]: Computing forward predicates... [2018-06-26 17:48:44,050 INFO ]: Checked inductivity of 87 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:48:44,068 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:44,069 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 26 [2018-06-26 17:48:44,069 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:44,069 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:44,069 INFO ]: CoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:44,069 INFO ]: Start difference. First operand 37 states and 41 transitions. Second operand 26 states. [2018-06-26 17:48:45,150 WARN ]: Spent 179.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-06-26 17:48:45,249 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:45,249 INFO ]: Finished difference Result 58 states and 65 transitions. [2018-06-26 17:48:45,249 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:48:45,249 INFO ]: Start accepts. Automaton has 26 states. Word has length 23 [2018-06-26 17:48:45,249 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:45,249 INFO ]: With dead ends: 58 [2018-06-26 17:48:45,249 INFO ]: Without dead ends: 58 [2018-06-26 17:48:45,250 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=468, Invalid=2394, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 17:48:45,250 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 17:48:45,255 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 37. [2018-06-26 17:48:45,255 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:48:45,256 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-06-26 17:48:45,256 INFO ]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2018-06-26 17:48:45,256 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:45,256 INFO ]: Abstraction has 37 states and 41 transitions. [2018-06-26 17:48:45,256 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:45,256 INFO ]: Start isEmpty. Operand 37 states and 41 transitions. [2018-06-26 17:48:45,256 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:48:45,256 INFO ]: Found error trace [2018-06-26 17:48:45,256 INFO ]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:45,256 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:45,257 INFO ]: Analyzing trace with hash 550099889, now seen corresponding path program 11 times [2018-06-26 17:48:45,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:45,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:45,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:45,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:45,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:45,265 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:45,560 INFO ]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:45,560 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:45,560 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:48:45,568 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:48:45,601 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:48:45,601 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:45,604 INFO ]: Computing forward predicates... [2018-06-26 17:48:45,736 INFO ]: Checked inductivity of 94 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:48:45,755 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:45,755 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 26 [2018-06-26 17:48:45,755 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:45,756 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:45,756 INFO ]: CoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:45,756 INFO ]: Start difference. First operand 37 states and 41 transitions. Second operand 26 states. [2018-06-26 17:48:46,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:46,019 INFO ]: Finished difference Result 57 states and 62 transitions. [2018-06-26 17:48:46,019 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:48:46,019 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-26 17:48:46,019 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:46,019 INFO ]: With dead ends: 57 [2018-06-26 17:48:46,019 INFO ]: Without dead ends: 45 [2018-06-26 17:48:46,020 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:48:46,020 INFO ]: Start minimizeSevpa. Operand 45 states. [2018-06-26 17:48:46,021 INFO ]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-06-26 17:48:46,021 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:48:46,021 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-26 17:48:46,021 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2018-06-26 17:48:46,021 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:46,021 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-26 17:48:46,021 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:46,022 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-26 17:48:46,022 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:48:46,022 INFO ]: Found error trace [2018-06-26 17:48:46,022 INFO ]: trace histogram [11, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:46,022 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:46,022 INFO ]: Analyzing trace with hash -933316880, now seen corresponding path program 13 times [2018-06-26 17:48:46,022 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:46,022 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:46,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:46,023 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:46,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:46,037 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:46,341 INFO ]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:46,341 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:46,341 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:48:46,347 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:46,366 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:46,368 INFO ]: Computing forward predicates... [2018-06-26 17:48:46,734 INFO ]: Checked inductivity of 94 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:48:46,753 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:46,753 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15] total 26 [2018-06-26 17:48:46,753 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:46,753 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:46,753 INFO ]: CoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:46,753 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 26 states. [2018-06-26 17:48:48,290 WARN ]: Spent 302.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-06-26 17:48:48,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:48,486 INFO ]: Finished difference Result 60 states and 67 transitions. [2018-06-26 17:48:48,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-06-26 17:48:48,486 INFO ]: Start accepts. Automaton has 26 states. Word has length 24 [2018-06-26 17:48:48,486 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:48,487 INFO ]: With dead ends: 60 [2018-06-26 17:48:48,487 INFO ]: Without dead ends: 60 [2018-06-26 17:48:48,488 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=537, Invalid=2769, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 17:48:48,488 INFO ]: Start minimizeSevpa. Operand 60 states. [2018-06-26 17:48:48,489 INFO ]: Finished minimizeSevpa. Reduced states from 60 to 38. [2018-06-26 17:48:48,489 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:48:48,490 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-06-26 17:48:48,490 INFO ]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 24 [2018-06-26 17:48:48,490 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:48,490 INFO ]: Abstraction has 38 states and 42 transitions. [2018-06-26 17:48:48,490 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:48,490 INFO ]: Start isEmpty. Operand 38 states and 42 transitions. [2018-06-26 17:48:48,490 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:48:48,490 INFO ]: Found error trace [2018-06-26 17:48:48,490 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:48,490 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:48,490 INFO ]: Analyzing trace with hash 155662306, now seen corresponding path program 12 times [2018-06-26 17:48:48,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:48,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:48,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:48,491 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:48,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:48,499 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:48,972 INFO ]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:48,972 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:48,972 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:48:48,977 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:48:49,000 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:48:49,000 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:49,002 INFO ]: Computing forward predicates... [2018-06-26 17:48:49,224 INFO ]: Checked inductivity of 102 backedges. 27 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:48:49,242 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:49,243 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 14] total 26 [2018-06-26 17:48:49,243 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:49,243 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:49,243 INFO ]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:49,243 INFO ]: Start difference. First operand 38 states and 42 transitions. Second operand 26 states. [2018-06-26 17:48:49,466 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:49,466 INFO ]: Finished difference Result 50 states and 54 transitions. [2018-06-26 17:48:49,466 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:48:49,466 INFO ]: Start accepts. Automaton has 26 states. Word has length 25 [2018-06-26 17:48:49,466 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:49,466 INFO ]: With dead ends: 50 [2018-06-26 17:48:49,466 INFO ]: Without dead ends: 47 [2018-06-26 17:48:49,467 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=839, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:48:49,467 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-26 17:48:49,468 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-06-26 17:48:49,468 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:48:49,468 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-26 17:48:49,468 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-06-26 17:48:49,468 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:49,468 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-26 17:48:49,468 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:49,468 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-26 17:48:49,469 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:48:49,469 INFO ]: Found error trace [2018-06-26 17:48:49,469 INFO ]: trace histogram [11, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:49,469 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:49,469 INFO ]: Analyzing trace with hash 1131536677, now seen corresponding path program 14 times [2018-06-26 17:48:49,469 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:49,469 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:49,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:49,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:49,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:49,477 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:49,907 INFO ]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:49,907 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:49,907 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:48:49,912 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:49,933 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:49,933 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:49,935 INFO ]: Computing forward predicates... [2018-06-26 17:48:50,006 INFO ]: Checked inductivity of 102 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:48:50,025 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:50,025 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15] total 26 [2018-06-26 17:48:50,025 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:50,025 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:50,025 INFO ]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:50,026 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-06-26 17:48:50,462 WARN ]: Spent 106.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2018-06-26 17:48:51,214 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:51,214 INFO ]: Finished difference Result 62 states and 69 transitions. [2018-06-26 17:48:51,214 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-26 17:48:51,214 INFO ]: Start accepts. Automaton has 26 states. Word has length 25 [2018-06-26 17:48:51,214 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:51,214 INFO ]: With dead ends: 62 [2018-06-26 17:48:51,214 INFO ]: Without dead ends: 62 [2018-06-26 17:48:51,215 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=613, Invalid=3169, Unknown=0, NotChecked=0, Total=3782 [2018-06-26 17:48:51,215 INFO ]: Start minimizeSevpa. Operand 62 states. [2018-06-26 17:48:51,216 INFO ]: Finished minimizeSevpa. Reduced states from 62 to 39. [2018-06-26 17:48:51,216 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:48:51,216 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-06-26 17:48:51,216 INFO ]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 25 [2018-06-26 17:48:51,216 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:51,216 INFO ]: Abstraction has 39 states and 43 transitions. [2018-06-26 17:48:51,216 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:51,216 INFO ]: Start isEmpty. Operand 39 states and 43 transitions. [2018-06-26 17:48:51,217 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:48:51,217 INFO ]: Found error trace [2018-06-26 17:48:51,217 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:51,217 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:51,217 INFO ]: Analyzing trace with hash 812999121, now seen corresponding path program 13 times [2018-06-26 17:48:51,217 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:51,217 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:51,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:51,217 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:51,217 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:51,224 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:51,501 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:51,501 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:51,501 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:48:51,511 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:51,531 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:51,533 INFO ]: Computing forward predicates... [2018-06-26 17:48:51,696 INFO ]: Checked inductivity of 111 backedges. 20 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:48:51,715 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:51,715 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 26 [2018-06-26 17:48:51,715 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:51,715 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:51,716 INFO ]: CoverageRelationStatistics Valid=128, Invalid=522, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:51,716 INFO ]: Start difference. First operand 39 states and 43 transitions. Second operand 26 states. [2018-06-26 17:48:51,976 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:51,976 INFO ]: Finished difference Result 51 states and 55 transitions. [2018-06-26 17:48:51,976 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:48:51,976 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-26 17:48:51,976 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:51,976 INFO ]: With dead ends: 51 [2018-06-26 17:48:51,976 INFO ]: Without dead ends: 49 [2018-06-26 17:48:51,977 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=807, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:48:51,977 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 17:48:51,978 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 40. [2018-06-26 17:48:51,978 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:48:51,978 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-26 17:48:51,979 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2018-06-26 17:48:51,979 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:51,979 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-26 17:48:51,979 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:51,979 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-26 17:48:51,979 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:48:51,979 INFO ]: Found error trace [2018-06-26 17:48:51,979 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:51,979 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:51,979 INFO ]: Analyzing trace with hash 717487504, now seen corresponding path program 15 times [2018-06-26 17:48:51,979 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:51,979 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:51,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:51,980 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:48:51,980 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:51,988 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:52,331 WARN ]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 17:48:52,658 INFO ]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:52,658 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:52,658 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) [2018-06-26 17:48:52,673 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:48:52,701 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:48:52,701 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:52,703 INFO ]: Computing forward predicates... [2018-06-26 17:48:52,758 INFO ]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:48:52,776 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:52,777 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15] total 26 [2018-06-26 17:48:52,777 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:52,777 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:52,777 INFO ]: CoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:52,777 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 26 states. [2018-06-26 17:48:54,159 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:54,159 INFO ]: Finished difference Result 64 states and 71 transitions. [2018-06-26 17:48:54,159 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 17:48:54,159 INFO ]: Start accepts. Automaton has 26 states. Word has length 26 [2018-06-26 17:48:54,159 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:54,160 INFO ]: With dead ends: 64 [2018-06-26 17:48:54,160 INFO ]: Without dead ends: 64 [2018-06-26 17:48:54,161 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=696, Invalid=3594, Unknown=0, NotChecked=0, Total=4290 [2018-06-26 17:48:54,161 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-26 17:48:54,162 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 40. [2018-06-26 17:48:54,162 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:48:54,162 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-06-26 17:48:54,163 INFO ]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2018-06-26 17:48:54,163 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:54,163 INFO ]: Abstraction has 40 states and 44 transitions. [2018-06-26 17:48:54,163 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:54,163 INFO ]: Start isEmpty. Operand 40 states and 44 transitions. [2018-06-26 17:48:54,163 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:48:54,163 INFO ]: Found error trace [2018-06-26 17:48:54,163 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:54,163 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:54,163 INFO ]: Analyzing trace with hash -284396094, now seen corresponding path program 14 times [2018-06-26 17:48:54,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:54,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:54,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:54,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:54,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:54,173 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:54,498 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:54,498 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:54,498 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:48:54,504 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:48:54,530 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:48:54,530 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:54,532 INFO ]: Computing forward predicates... [2018-06-26 17:48:54,585 INFO ]: Checked inductivity of 121 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:48:54,605 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:54,605 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14] total 26 [2018-06-26 17:48:54,605 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:54,605 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:54,605 INFO ]: CoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:54,605 INFO ]: Start difference. First operand 40 states and 44 transitions. Second operand 26 states. [2018-06-26 17:48:54,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:54,849 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-26 17:48:54,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:48:54,849 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-26 17:48:54,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:54,849 INFO ]: With dead ends: 52 [2018-06-26 17:48:54,849 INFO ]: Without dead ends: 51 [2018-06-26 17:48:54,849 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:48:54,849 INFO ]: Start minimizeSevpa. Operand 51 states. [2018-06-26 17:48:54,850 INFO ]: Finished minimizeSevpa. Reduced states from 51 to 41. [2018-06-26 17:48:54,851 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:48:54,851 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-06-26 17:48:54,851 INFO ]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2018-06-26 17:48:54,851 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:54,851 INFO ]: Abstraction has 41 states and 45 transitions. [2018-06-26 17:48:54,851 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:54,851 INFO ]: Start isEmpty. Operand 41 states and 45 transitions. [2018-06-26 17:48:54,851 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:48:54,851 INFO ]: Found error trace [2018-06-26 17:48:54,851 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:54,851 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:54,851 INFO ]: Analyzing trace with hash 766865029, now seen corresponding path program 16 times [2018-06-26 17:48:54,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:54,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:54,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:54,852 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:54,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:54,861 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:55,283 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:55,283 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:55,283 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:48:55,288 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:48:55,309 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:48:55,309 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:55,311 INFO ]: Computing forward predicates... [2018-06-26 17:48:55,361 INFO ]: Checked inductivity of 121 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:48:55,380 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:55,380 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15] total 26 [2018-06-26 17:48:55,380 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:48:55,380 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:48:55,380 INFO ]: CoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:48:55,380 INFO ]: Start difference. First operand 41 states and 45 transitions. Second operand 26 states. [2018-06-26 17:48:57,184 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:48:57,184 INFO ]: Finished difference Result 66 states and 73 transitions. [2018-06-26 17:48:57,184 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-06-26 17:48:57,184 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-26 17:48:57,184 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:48:57,185 INFO ]: With dead ends: 66 [2018-06-26 17:48:57,185 INFO ]: Without dead ends: 66 [2018-06-26 17:48:57,186 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=786, Invalid=4044, Unknown=0, NotChecked=0, Total=4830 [2018-06-26 17:48:57,186 INFO ]: Start minimizeSevpa. Operand 66 states. [2018-06-26 17:48:57,187 INFO ]: Finished minimizeSevpa. Reduced states from 66 to 41. [2018-06-26 17:48:57,187 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:48:57,188 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-06-26 17:48:57,188 INFO ]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 27 [2018-06-26 17:48:57,188 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:48:57,188 INFO ]: Abstraction has 41 states and 45 transitions. [2018-06-26 17:48:57,188 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:48:57,188 INFO ]: Start isEmpty. Operand 41 states and 45 transitions. [2018-06-26 17:48:57,188 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:48:57,188 INFO ]: Found error trace [2018-06-26 17:48:57,188 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:48:57,188 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:48:57,188 INFO ]: Analyzing trace with hash 56090609, now seen corresponding path program 15 times [2018-06-26 17:48:57,188 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:48:57,188 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:48:57,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:57,190 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:48:57,190 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:48:57,198 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:57,754 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:57,754 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:48:57,754 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:48:57,759 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:48:57,787 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:48:57,787 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:48:57,789 INFO ]: Computing forward predicates... [2018-06-26 17:48:58,178 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:48:58,197 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:48:58,197 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 36 [2018-06-26 17:48:58,197 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:48:58,197 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:48:58,197 INFO ]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:48:58,198 INFO ]: Start difference. First operand 41 states and 45 transitions. Second operand 36 states. [2018-06-26 17:49:00,068 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:00,068 INFO ]: Finished difference Result 57 states and 63 transitions. [2018-06-26 17:49:00,070 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-06-26 17:49:00,070 INFO ]: Start accepts. Automaton has 36 states. Word has length 28 [2018-06-26 17:49:00,070 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:00,070 INFO ]: With dead ends: 57 [2018-06-26 17:49:00,070 INFO ]: Without dead ends: 43 [2018-06-26 17:49:00,071 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=734, Invalid=3048, Unknown=0, NotChecked=0, Total=3782 [2018-06-26 17:49:00,071 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 17:49:00,072 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-26 17:49:00,072 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:49:00,073 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-26 17:49:00,073 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-26 17:49:00,073 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:00,073 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-26 17:49:00,073 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:49:00,073 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-26 17:49:00,073 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:49:00,073 INFO ]: Found error trace [2018-06-26 17:49:00,073 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:49:00,073 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:49:00,074 INFO ]: Analyzing trace with hash 2021243810, now seen corresponding path program 16 times [2018-06-26 17:49:00,074 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:49:00,074 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:49:00,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:00,074 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:49:00,074 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:49:00,080 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:49:00,272 INFO ]: Checked inductivity of 144 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:49:00,272 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:49:00,272 INFO ]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-06-26 17:49:00,272 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:49:00,272 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:49:00,272 INFO ]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:49:00,272 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2018-06-26 17:49:00,287 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:49:00,288 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-26 17:49:00,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:49:00,288 INFO ]: Start accepts. Automaton has 14 states. Word has length 29 [2018-06-26 17:49:00,288 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:49:00,288 INFO ]: With dead ends: 15 [2018-06-26 17:49:00,288 INFO ]: Without dead ends: 0 [2018-06-26 17:49:00,288 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:49:00,288 INFO ]: Start minimizeSevpa. Operand 0 states. [2018-06-26 17:49:00,288 INFO ]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-06-26 17:49:00,288 INFO ]: Start removeUnreachable. Operand 0 states. [2018-06-26 17:49:00,288 INFO ]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-06-26 17:49:00,288 INFO ]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-06-26 17:49:00,288 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:49:00,288 INFO ]: Abstraction has 0 states and 0 transitions. [2018-06-26 17:49:00,288 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:49:00,288 INFO ]: Start isEmpty. Operand 0 states and 0 transitions. [2018-06-26 17:49:00,288 INFO ]: Finished isEmpty. No accepting run. [2018-06-26 17:49:00,290 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:49:00,291 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:49:00 BasicIcfg [2018-06-26 17:49:00,291 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:49:00,291 INFO ]: Toolchain (without parser) took 32763.45 ms. Allocated memory was 307.8 MB in the beginning and 702.0 MB in the end (delta: 394.3 MB). Free memory was 265.1 MB in the beginning and 321.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 338.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:49:00,292 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:49:00,292 INFO ]: ChcToBoogie took 51.23 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.0 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:49:00,292 INFO ]: Boogie Preprocessor took 36.91 ms. Allocated memory is still 307.8 MB. Free memory was 262.0 MB in the beginning and 261.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. [2018-06-26 17:49:00,294 INFO ]: RCFGBuilder took 166.65 ms. Allocated memory is still 307.8 MB. Free memory was 261.0 MB in the beginning and 254.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:49:00,294 INFO ]: BlockEncodingV2 took 114.83 ms. Allocated memory is still 307.8 MB. Free memory was 254.0 MB in the beginning and 251.0 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:49:00,295 INFO ]: TraceAbstraction took 32384.32 ms. Allocated memory was 307.8 MB in the beginning and 702.0 MB in the end (delta: 394.3 MB). Free memory was 250.0 MB in the beginning and 321.2 MB in the end (delta: -71.2 MB). Peak memory consumption was 323.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:49:00,299 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 12 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 307.8 MB. Free memory is still 273.2 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 51.23 ms. Allocated memory is still 307.8 MB. Free memory was 264.1 MB in the beginning and 262.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 36.91 ms. Allocated memory is still 307.8 MB. Free memory was 262.0 MB in the beginning and 261.0 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 3.6 GB. * RCFGBuilder took 166.65 ms. Allocated memory is still 307.8 MB. Free memory was 261.0 MB in the beginning and 254.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 114.83 ms. Allocated memory is still 307.8 MB. Free memory was 254.0 MB in the beginning and 251.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 32384.32 ms. Allocated memory was 307.8 MB in the beginning and 702.0 MB in the end (delta: 394.3 MB). Free memory was 250.0 MB in the beginning and 321.2 MB in the end (delta: -71.2 MB). Peak memory consumption was 323.0 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [UNKNOWN] : assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. SAFE Result, 32.3s OverallTime, 39 OverallIterations, 12 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 319 SDtfs, 193 SDslu, 2307 SDs, 0 SdLazy, 5663 SolverSat, 742 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1562 GetRequests, 546 SyntacticMatches, 77 SemanticMatches, 939 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 23.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=36, 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.1s AutomataMinimizationTime, 39 MinimizatonAttempts, 238 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1338 NumberOfCodeBlocks, 1332 NumberOfCodeBlocksAsserted, 155 NumberOfCheckSat, 1264 ConstructedInterpolants, 0 QuantifiedInterpolants, 111976 SizeOfPredicates, 125 NumberOfNonLiveVariables, 5287 ConjunctsInSsa, 1657 ConjunctsInUnsatCore, 74 InterpolantComputations, 5 PerfectInterpolantSequences, 1306/4463 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-49-00-314.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-49-00-314.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-49-00-314.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/break_single_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-49-00-314.csv Received shutdown request...