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/nested-while_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:52:03,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:52:03,053 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:52:03,071 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:52:03,071 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:52:03,072 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:52:03,075 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:52:03,077 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:52:03,078 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:52:03,080 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:52:03,081 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:52:03,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:52:03,082 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:52:03,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:52:03,089 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:52:03,090 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:52:03,091 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:52:03,101 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:52:03,102 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:52:03,103 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:52:03,110 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:52:03,116 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:52:03,116 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:52:03,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:52:03,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:52:03,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:52:03,119 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:52:03,119 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:52:03,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:52:03,126 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:52:03,127 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:52:03,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:52:03,128 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:52:03,129 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:52:03,129 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:52:03,129 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-24 20:52:03,146 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:52:03,146 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:52:03,146 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:52:03,146 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:52:03,147 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:52:03,147 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:52:03,148 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:52:03,148 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:52:03,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:52:03,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:52:03,149 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:52:03,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:52:03,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:52:03,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:52:03,149 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:52:03,150 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:52:03,150 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:52:03,150 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:52:03,150 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:52:03,150 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:52:03,150 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:52:03,152 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:52:03,152 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:52:03,203 INFO ]: Repository-Root is: /tmp [2018-06-24 20:52:03,220 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:52:03,228 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:52:03,230 INFO ]: Initializing SmtParser... [2018-06-24 20:52:03,230 INFO ]: SmtParser initialized [2018-06-24 20:52:03,231 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-24 20:52:03,232 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-24 20:52:03,320 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 unknown [2018-06-24 20:52:03,499 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/nested-while_safe.c-1.smt2 [2018-06-24 20:52:03,507 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:52:03,513 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:52:03,514 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:52:03,514 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:52:03,514 INFO ]: ChcToBoogie initialized [2018-06-24 20:52:03,517 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,578 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03 Unit [2018-06-24 20:52:03,578 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:52:03,579 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:52:03,579 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:52:03,579 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:52:03,602 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,603 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,608 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,609 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,613 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,615 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,616 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,619 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:52:03,619 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:52:03,619 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:52:03,619 INFO ]: RCFGBuilder initialized [2018-06-24 20:52:03,620 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:52:03,634 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:52:03,634 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:52:03,634 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:52:03,634 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:52:03,634 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:52:03,634 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:52:03,953 INFO ]: Using library mode [2018-06-24 20:52:03,953 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:03 BoogieIcfgContainer [2018-06-24 20:52:03,953 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:52:03,954 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:52:03,954 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:52:03,963 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:52:03,964 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:03" (1/1) ... [2018-06-24 20:52:03,977 INFO ]: Initial Icfg 13 locations, 19 edges [2018-06-24 20:52:03,978 INFO ]: Using Remove infeasible edges [2018-06-24 20:52:03,978 INFO ]: Using Maximize final states [2018-06-24 20:52:03,979 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:52:03,979 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:52:03,980 INFO ]: Using Remove sink states [2018-06-24 20:52:03,981 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:52:03,981 INFO ]: Using Use SBE [2018-06-24 20:52:03,986 INFO ]: SBE split 0 edges [2018-06-24 20:52:03,990 INFO ]: Removed 3 edges and 2 locations because of local infeasibility [2018-06-24 20:52:03,992 INFO ]: 0 new accepting states [2018-06-24 20:52:04,066 INFO ]: Removed 12 edges and 4 locations by large block encoding [2018-06-24 20:52:04,068 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:04,070 INFO ]: Removed 1 edges and 0 locations because of local infeasibility [2018-06-24 20:52:04,070 INFO ]: 0 new accepting states [2018-06-24 20:52:04,070 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:52:04,070 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:04,070 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:52:04,070 INFO ]: 0 new accepting states [2018-06-24 20:52:04,071 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:52:04,071 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:52:04,071 INFO ]: Encoded RCFG 7 locations, 11 edges [2018-06-24 20:52:04,071 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:04 BasicIcfg [2018-06-24 20:52:04,071 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:52:04,072 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:52:04,072 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:52:04,075 INFO ]: TraceAbstraction initialized [2018-06-24 20:52:04,075 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:52:03" (1/4) ... [2018-06-24 20:52:04,077 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2016ce3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:52:04, skipping insertion in model container [2018-06-24 20:52:04,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:52:03" (2/4) ... [2018-06-24 20:52:04,077 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2016ce3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:52:04, skipping insertion in model container [2018-06-24 20:52:04,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:52:03" (3/4) ... [2018-06-24 20:52:04,077 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2016ce3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:52:04, skipping insertion in model container [2018-06-24 20:52:04,077 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:52:04" (4/4) ... [2018-06-24 20:52:04,079 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:52:04,090 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:52:04,098 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:52:04,138 INFO ]: Using default assertion order modulation [2018-06-24 20:52:04,138 INFO ]: Interprodecural is true [2018-06-24 20:52:04,139 INFO ]: Hoare is false [2018-06-24 20:52:04,139 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:52:04,139 INFO ]: Backedges is TWOTRACK [2018-06-24 20:52:04,139 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:52:04,139 INFO ]: Difference is false [2018-06-24 20:52:04,139 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:52:04,139 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:52:04,147 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:52:04,156 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:52:04,156 INFO ]: Found error trace [2018-06-24 20:52:04,157 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:52:04,157 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:04,169 INFO ]: Analyzing trace with hash 32944614, now seen corresponding path program 1 times [2018-06-24 20:52:04,170 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:04,170 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:04,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,202 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:04,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,242 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:04,290 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:04,292 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:04,292 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:52:04,293 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:52:04,306 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:52:04,306 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:52:04,309 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:52:04,368 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:04,368 INFO ]: Finished difference Result 8 states and 13 transitions. [2018-06-24 20:52:04,370 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:52:04,371 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:52:04,371 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:04,381 INFO ]: With dead ends: 8 [2018-06-24 20:52:04,381 INFO ]: Without dead ends: 7 [2018-06-24 20:52:04,382 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:52:04,394 INFO ]: Start minimizeSevpa. Operand 7 states. [2018-06-24 20:52:04,412 INFO ]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-06-24 20:52:04,413 INFO ]: Start removeUnreachable. Operand 7 states. [2018-06-24 20:52:04,414 INFO ]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-06-24 20:52:04,415 INFO ]: Start accepts. Automaton has 7 states and 10 transitions. Word has length 5 [2018-06-24 20:52:04,415 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:04,415 INFO ]: Abstraction has 7 states and 10 transitions. [2018-06-24 20:52:04,415 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:52:04,415 INFO ]: Start isEmpty. Operand 7 states and 10 transitions. [2018-06-24 20:52:04,415 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:52:04,416 INFO ]: Found error trace [2018-06-24 20:52:04,416 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:52:04,417 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:04,417 INFO ]: Analyzing trace with hash 1021737695, now seen corresponding path program 1 times [2018-06-24 20:52:04,418 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:04,418 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:04,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,418 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:04,418 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,440 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:04,595 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:04,595 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:04,595 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:52:04,596 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:04,596 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:04,597 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:04,597 INFO ]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-06-24 20:52:04,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:04,884 INFO ]: Finished difference Result 11 states and 19 transitions. [2018-06-24 20:52:04,885 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:04,885 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:52:04,885 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:04,888 INFO ]: With dead ends: 11 [2018-06-24 20:52:04,888 INFO ]: Without dead ends: 11 [2018-06-24 20:52:04,889 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-24 20:52:04,889 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:52:04,894 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-06-24 20:52:04,894 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:52:04,894 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-06-24 20:52:04,894 INFO ]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-06-24 20:52:04,894 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:04,894 INFO ]: Abstraction has 9 states and 15 transitions. [2018-06-24 20:52:04,894 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:04,894 INFO ]: Start isEmpty. Operand 9 states and 15 transitions. [2018-06-24 20:52:04,895 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:04,895 INFO ]: Found error trace [2018-06-24 20:52:04,895 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:04,895 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:04,895 INFO ]: Analyzing trace with hash 1608360494, now seen corresponding path program 1 times [2018-06-24 20:52:04,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:04,895 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:04,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,896 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:04,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:04,931 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:05,097 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:05,098 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:05,098 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) [2018-06-24 20:52:05,116 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:05,160 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:05,167 INFO ]: Computing forward predicates... [2018-06-24 20:52:05,662 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:05,694 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:52:05,694 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-06-24 20:52:05,694 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:52:05,695 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:52:05,695 INFO ]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:52:05,695 INFO ]: Start difference. First operand 9 states and 15 transitions. Second operand 8 states. [2018-06-24 20:52:06,031 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:06,031 INFO ]: Finished difference Result 13 states and 23 transitions. [2018-06-24 20:52:06,032 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:52:06,032 INFO ]: Start accepts. Automaton has 8 states. Word has length 7 [2018-06-24 20:52:06,032 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:06,032 INFO ]: With dead ends: 13 [2018-06-24 20:52:06,032 INFO ]: Without dead ends: 12 [2018-06-24 20:52:06,033 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:06,033 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:52:06,035 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-06-24 20:52:06,035 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:52:06,035 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-06-24 20:52:06,035 INFO ]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-06-24 20:52:06,035 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:06,035 INFO ]: Abstraction has 11 states and 19 transitions. [2018-06-24 20:52:06,035 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:52:06,035 INFO ]: Start isEmpty. Operand 11 states and 19 transitions. [2018-06-24 20:52:06,036 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:06,036 INFO ]: Found error trace [2018-06-24 20:52:06,037 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:06,037 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:06,038 INFO ]: Analyzing trace with hash 1608390285, now seen corresponding path program 1 times [2018-06-24 20:52:06,038 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:06,038 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:06,038 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,039 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:06,039 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,067 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,162 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:06,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:06,169 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:06,199 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,200 INFO ]: Computing forward predicates... [2018-06-24 20:52:06,235 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,254 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:52:06,254 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 20:52:06,254 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:52:06,254 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:52:06,254 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:06,255 INFO ]: Start difference. First operand 11 states and 19 transitions. Second operand 5 states. [2018-06-24 20:52:06,362 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:06,362 INFO ]: Finished difference Result 13 states and 21 transitions. [2018-06-24 20:52:06,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:06,363 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:52:06,363 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:06,363 INFO ]: With dead ends: 13 [2018-06-24 20:52:06,363 INFO ]: Without dead ends: 10 [2018-06-24 20:52:06,363 INFO ]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:52:06,363 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:52:06,365 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:52:06,365 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:52:06,365 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-06-24 20:52:06,365 INFO ]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2018-06-24 20:52:06,365 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:06,365 INFO ]: Abstraction has 10 states and 15 transitions. [2018-06-24 20:52:06,365 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:52:06,365 INFO ]: Start isEmpty. Operand 10 states and 15 transitions. [2018-06-24 20:52:06,365 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:06,365 INFO ]: Found error trace [2018-06-24 20:52:06,366 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:06,366 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:06,366 INFO ]: Analyzing trace with hash 1609552134, now seen corresponding path program 1 times [2018-06-24 20:52:06,366 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:06,366 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:06,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,368 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:06,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,381 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,416 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:06,416 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:06,422 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:06,453 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,455 INFO ]: Computing forward predicates... [2018-06-24 20:52:06,491 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,515 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:52:06,515 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-06-24 20:52:06,516 INFO ]: Interpolant automaton has 5 states [2018-06-24 20:52:06,516 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-24 20:52:06,516 INFO ]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:06,516 INFO ]: Start difference. First operand 10 states and 15 transitions. Second operand 5 states. [2018-06-24 20:52:06,542 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:06,542 INFO ]: Finished difference Result 9 states and 12 transitions. [2018-06-24 20:52:06,542 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:06,542 INFO ]: Start accepts. Automaton has 5 states. Word has length 7 [2018-06-24 20:52:06,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:06,542 INFO ]: With dead ends: 9 [2018-06-24 20:52:06,542 INFO ]: Without dead ends: 8 [2018-06-24 20:52:06,543 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:06,543 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:52:06,544 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:52:06,544 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:52:06,544 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-24 20:52:06,544 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 7 [2018-06-24 20:52:06,544 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:06,544 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-24 20:52:06,544 INFO ]: Interpolant automaton has 5 states. [2018-06-24 20:52:06,544 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-24 20:52:06,545 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:52:06,545 INFO ]: Found error trace [2018-06-24 20:52:06,545 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:06,545 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:06,545 INFO ]: Analyzing trace with hash 1610475655, now seen corresponding path program 1 times [2018-06-24 20:52:06,545 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:06,545 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:06,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,546 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:06,546 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,557 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,601 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,601 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:52:06,601 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:52:06,602 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:52:06,602 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:52:06,602 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:52:06,602 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-06-24 20:52:06,749 WARN ]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-06-24 20:52:06,829 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:06,829 INFO ]: Finished difference Result 9 states and 10 transitions. [2018-06-24 20:52:06,829 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:52:06,829 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:52:06,829 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:06,829 INFO ]: With dead ends: 9 [2018-06-24 20:52:06,829 INFO ]: Without dead ends: 9 [2018-06-24 20:52:06,830 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-06-24 20:52:06,830 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:52:06,831 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:52:06,831 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:52:06,831 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-24 20:52:06,831 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-06-24 20:52:06,831 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:06,831 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-24 20:52:06,831 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:52:06,831 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-24 20:52:06,831 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:52:06,831 INFO ]: Found error trace [2018-06-24 20:52:06,831 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:06,831 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:06,832 INFO ]: Analyzing trace with hash -1615599226, now seen corresponding path program 1 times [2018-06-24 20:52:06,832 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:06,832 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:06,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,832 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:06,832 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:06,866 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:06,984 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:06,984 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:06,984 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:06,993 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:07,025 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,027 INFO ]: Computing forward predicates... [2018-06-24 20:52:07,103 INFO ]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:07,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:07,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-06-24 20:52:07,123 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:52:07,123 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:52:07,123 INFO ]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:52:07,123 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-06-24 20:52:07,274 WARN ]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-06-24 20:52:07,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:07,392 INFO ]: Finished difference Result 14 states and 17 transitions. [2018-06-24 20:52:07,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:52:07,392 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:52:07,393 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:07,393 INFO ]: With dead ends: 14 [2018-06-24 20:52:07,393 INFO ]: Without dead ends: 14 [2018-06-24 20:52:07,393 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:52:07,393 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:52:07,395 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-06-24 20:52:07,395 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:52:07,395 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-24 20:52:07,395 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-06-24 20:52:07,395 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:07,395 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-24 20:52:07,395 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:52:07,395 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-24 20:52:07,396 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:52:07,396 INFO ]: Found error trace [2018-06-24 20:52:07,396 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:07,396 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:07,396 INFO ]: Analyzing trace with hash 1455294567, now seen corresponding path program 2 times [2018-06-24 20:52:07,396 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:07,396 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:07,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:07,396 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:07,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:07,407 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,504 INFO ]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:07,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:07,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:07,510 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:07,538 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:07,538 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,540 INFO ]: Computing forward predicates... [2018-06-24 20:52:07,747 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:07,768 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:07,768 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-24 20:52:07,768 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:52:07,769 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:52:07,769 INFO ]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:52:07,769 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-24 20:52:07,857 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:07,857 INFO ]: Finished difference Result 13 states and 15 transitions. [2018-06-24 20:52:07,857 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:52:07,857 INFO ]: Start accepts. Automaton has 11 states. Word has length 9 [2018-06-24 20:52:07,858 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:07,858 INFO ]: With dead ends: 13 [2018-06-24 20:52:07,858 INFO ]: Without dead ends: 10 [2018-06-24 20:52:07,858 INFO ]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:52:07,858 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:52:07,859 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:52:07,859 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:52:07,859 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-24 20:52:07,859 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 9 [2018-06-24 20:52:07,859 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:07,860 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-24 20:52:07,860 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:52:07,860 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-24 20:52:07,860 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:52:07,860 INFO ]: Found error trace [2018-06-24 20:52:07,860 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:07,860 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:07,860 INFO ]: Analyzing trace with hash 1520864558, now seen corresponding path program 3 times [2018-06-24 20:52:07,860 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:07,860 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:07,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:07,861 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:07,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:07,881 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,947 INFO ]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:07,947 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:07,947 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:07,953 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:07,970 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-24 20:52:07,971 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:07,972 INFO ]: Computing forward predicates... [2018-06-24 20:52:08,031 INFO ]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:08,050 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:08,050 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-06-24 20:52:08,050 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:52:08,050 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:52:08,050 INFO ]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:52:08,051 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 9 states. [2018-06-24 20:52:08,155 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:08,155 INFO ]: Finished difference Result 11 states and 12 transitions. [2018-06-24 20:52:08,155 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:52:08,155 INFO ]: Start accepts. Automaton has 9 states. Word has length 9 [2018-06-24 20:52:08,155 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:08,156 INFO ]: With dead ends: 11 [2018-06-24 20:52:08,156 INFO ]: Without dead ends: 11 [2018-06-24 20:52:08,156 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:52:08,156 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:52:08,157 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:52:08,157 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:52:08,158 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-24 20:52:08,158 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 9 [2018-06-24 20:52:08,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:08,158 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-24 20:52:08,158 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:52:08,158 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-24 20:52:08,158 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:52:08,158 INFO ]: Found error trace [2018-06-24 20:52:08,158 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:08,158 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:08,159 INFO ]: Analyzing trace with hash -98575937, now seen corresponding path program 4 times [2018-06-24 20:52:08,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:08,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:08,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:08,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:08,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:08,172 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:08,289 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:08,289 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:08,289 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:08,296 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:08,329 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:08,329 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:08,331 INFO ]: Computing forward predicates... [2018-06-24 20:52:08,590 INFO ]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:08,624 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:08,624 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-06-24 20:52:08,624 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:52:08,624 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:52:08,624 INFO ]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:52:08,624 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2018-06-24 20:52:08,766 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:08,766 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-24 20:52:08,766 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:52:08,766 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:52:08,766 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:08,767 INFO ]: With dead ends: 17 [2018-06-24 20:52:08,767 INFO ]: Without dead ends: 17 [2018-06-24 20:52:08,767 INFO ]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:52:08,767 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:52:08,770 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-06-24 20:52:08,770 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:52:08,771 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-24 20:52:08,771 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-06-24 20:52:08,771 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:08,771 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-24 20:52:08,771 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:52:08,771 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-24 20:52:08,771 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:52:08,771 INFO ]: Found error trace [2018-06-24 20:52:08,771 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:08,771 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:08,771 INFO ]: Analyzing trace with hash 1238376270, now seen corresponding path program 5 times [2018-06-24 20:52:08,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:08,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:08,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:08,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:08,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:08,784 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:08,866 INFO ]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:08,866 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:08,866 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-24 20:52:08,872 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:08,936 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:52:08,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:08,938 INFO ]: Computing forward predicates... [2018-06-24 20:52:09,005 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:09,026 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:09,026 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-06-24 20:52:09,026 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:52:09,027 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:52:09,027 INFO ]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:52:09,027 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 14 states. [2018-06-24 20:52:09,091 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:09,091 INFO ]: Finished difference Result 16 states and 18 transitions. [2018-06-24 20:52:09,091 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-24 20:52:09,092 INFO ]: Start accepts. Automaton has 14 states. Word has length 11 [2018-06-24 20:52:09,092 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:09,092 INFO ]: With dead ends: 16 [2018-06-24 20:52:09,092 INFO ]: Without dead ends: 12 [2018-06-24 20:52:09,092 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:52:09,092 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:52:09,093 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:52:09,093 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:52:09,093 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-24 20:52:09,093 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2018-06-24 20:52:09,093 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:09,093 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-24 20:52:09,093 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:52:09,093 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-24 20:52:09,093 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:52:09,093 INFO ]: Found error trace [2018-06-24 20:52:09,093 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:09,094 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:09,094 INFO ]: Analyzing trace with hash -1023921305, now seen corresponding path program 6 times [2018-06-24 20:52:09,094 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:09,094 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:09,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,094 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:09,094 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,108 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:09,267 INFO ]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:09,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:09,267 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:09,276 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:09,333 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:52:09,333 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:09,334 INFO ]: Computing forward predicates... [2018-06-24 20:52:09,429 INFO ]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:09,475 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:09,475 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-06-24 20:52:09,475 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:52:09,475 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:52:09,475 INFO ]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:52:09,476 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 12 states. [2018-06-24 20:52:09,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:09,526 INFO ]: Finished difference Result 13 states and 14 transitions. [2018-06-24 20:52:09,529 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-24 20:52:09,529 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-24 20:52:09,529 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:09,529 INFO ]: With dead ends: 13 [2018-06-24 20:52:09,529 INFO ]: Without dead ends: 13 [2018-06-24 20:52:09,530 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:52:09,530 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:52:09,531 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:52:09,531 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:52:09,531 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-24 20:52:09,531 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-06-24 20:52:09,531 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:09,531 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-24 20:52:09,531 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:52:09,531 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-24 20:52:09,532 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:52:09,532 INFO ]: Found error trace [2018-06-24 20:52:09,532 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:09,532 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:09,532 INFO ]: Analyzing trace with hash -1677526362, now seen corresponding path program 7 times [2018-06-24 20:52:09,532 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:09,532 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:09,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,532 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:09,532 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,543 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:09,635 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:09,636 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:09,636 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:09,650 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:09,671 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:09,673 INFO ]: Computing forward predicates... [2018-06-24 20:52:09,699 INFO ]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:09,728 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:09,728 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-06-24 20:52:09,728 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:52:09,728 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:52:09,728 INFO ]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:52:09,728 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2018-06-24 20:52:09,871 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:09,871 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-24 20:52:09,871 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:52:09,871 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:52:09,872 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:09,872 INFO ]: With dead ends: 20 [2018-06-24 20:52:09,872 INFO ]: Without dead ends: 20 [2018-06-24 20:52:09,872 INFO ]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:52:09,872 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:52:09,874 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-06-24 20:52:09,874 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:52:09,874 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-06-24 20:52:09,874 INFO ]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-06-24 20:52:09,874 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:09,875 INFO ]: Abstraction has 15 states and 17 transitions. [2018-06-24 20:52:09,875 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:52:09,875 INFO ]: Start isEmpty. Operand 15 states and 17 transitions. [2018-06-24 20:52:09,875 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:52:09,875 INFO ]: Found error trace [2018-06-24 20:52:09,875 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:09,875 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:09,875 INFO ]: Analyzing trace with hash -464446649, now seen corresponding path program 8 times [2018-06-24 20:52:09,875 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:09,875 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:09,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,876 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:09,876 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:09,887 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:10,045 INFO ]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:10,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:10,045 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:10,050 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:10,101 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:10,101 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:10,104 INFO ]: Computing forward predicates... [2018-06-24 20:52:10,273 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:10,292 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:10,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2018-06-24 20:52:10,292 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:52:10,293 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:52:10,293 INFO ]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:52:10,293 INFO ]: Start difference. First operand 15 states and 17 transitions. Second operand 17 states. [2018-06-24 20:52:10,423 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:10,423 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-24 20:52:10,423 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-24 20:52:10,423 INFO ]: Start accepts. Automaton has 17 states. Word has length 13 [2018-06-24 20:52:10,423 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:10,423 INFO ]: With dead ends: 19 [2018-06-24 20:52:10,423 INFO ]: Without dead ends: 14 [2018-06-24 20:52:10,424 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:52:10,424 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:52:10,425 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:52:10,425 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:52:10,425 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-24 20:52:10,425 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2018-06-24 20:52:10,425 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:10,425 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-24 20:52:10,425 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:52:10,425 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-24 20:52:10,426 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:52:10,426 INFO ]: Found error trace [2018-06-24 20:52:10,426 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:10,426 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:10,426 INFO ]: Analyzing trace with hash -1876194738, now seen corresponding path program 9 times [2018-06-24 20:52:10,426 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:10,426 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:10,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:10,426 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:10,426 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:10,436 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:10,610 INFO ]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:10,610 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:10,610 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:10,616 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:10,678 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:52:10,678 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:10,680 INFO ]: Computing forward predicates... [2018-06-24 20:52:10,775 INFO ]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:10,794 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:10,794 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2018-06-24 20:52:10,794 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:52:10,794 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:52:10,794 INFO ]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:52:10,794 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2018-06-24 20:52:10,937 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:10,937 INFO ]: Finished difference Result 15 states and 16 transitions. [2018-06-24 20:52:10,937 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:52:10,937 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-24 20:52:10,937 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:10,938 INFO ]: With dead ends: 15 [2018-06-24 20:52:10,938 INFO ]: Without dead ends: 15 [2018-06-24 20:52:10,938 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:52:10,938 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:52:10,939 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:52:10,939 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:52:10,940 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-24 20:52:10,940 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13 [2018-06-24 20:52:10,940 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:10,940 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-24 20:52:10,940 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:52:10,940 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-24 20:52:10,940 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:52:10,940 INFO ]: Found error trace [2018-06-24 20:52:10,940 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:10,940 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:10,940 INFO ]: Analyzing trace with hash 1966768287, now seen corresponding path program 10 times [2018-06-24 20:52:10,940 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:10,940 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:10,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:10,941 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:10,941 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:10,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:11,099 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:11,099 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:11,099 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:11,104 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:11,141 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:11,141 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:11,144 INFO ]: Computing forward predicates... [2018-06-24 20:52:11,167 INFO ]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:11,198 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:11,198 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-06-24 20:52:11,199 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:52:11,199 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:52:11,199 INFO ]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:52:11,199 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-24 20:52:11,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:11,476 INFO ]: Finished difference Result 23 states and 26 transitions. [2018-06-24 20:52:11,476 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:52:11,476 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:52:11,476 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:11,476 INFO ]: With dead ends: 23 [2018-06-24 20:52:11,476 INFO ]: Without dead ends: 23 [2018-06-24 20:52:11,477 INFO ]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:52:11,477 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:52:11,478 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-06-24 20:52:11,478 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:52:11,479 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-24 20:52:11,479 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-06-24 20:52:11,479 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:11,479 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-24 20:52:11,479 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:52:11,479 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-24 20:52:11,479 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:52:11,479 INFO ]: Found error trace [2018-06-24 20:52:11,479 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:11,479 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:11,480 INFO ]: Analyzing trace with hash 839537774, now seen corresponding path program 11 times [2018-06-24 20:52:11,480 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:11,480 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:11,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:11,480 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:11,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:11,491 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:12,346 INFO ]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:12,346 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:12,346 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:12,352 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:12,376 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:52:12,376 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:12,379 INFO ]: Computing forward predicates... [2018-06-24 20:52:12,812 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:12,833 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:12,833 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-24 20:52:12,833 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:52:12,833 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:52:12,834 INFO ]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:52:12,834 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 20 states. [2018-06-24 20:52:13,052 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:13,053 INFO ]: Finished difference Result 22 states and 24 transitions. [2018-06-24 20:52:13,053 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-24 20:52:13,053 INFO ]: Start accepts. Automaton has 20 states. Word has length 15 [2018-06-24 20:52:13,053 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:13,054 INFO ]: With dead ends: 22 [2018-06-24 20:52:13,054 INFO ]: Without dead ends: 16 [2018-06-24 20:52:13,054 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:52:13,054 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:52:13,055 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:52:13,055 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:52:13,055 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-24 20:52:13,055 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2018-06-24 20:52:13,056 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:13,056 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-24 20:52:13,056 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:52:13,056 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-24 20:52:13,056 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:52:13,056 INFO ]: Found error trace [2018-06-24 20:52:13,056 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:13,056 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:13,056 INFO ]: Analyzing trace with hash 25019975, now seen corresponding path program 12 times [2018-06-24 20:52:13,056 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:13,056 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:13,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:13,057 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:13,057 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:13,065 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:13,276 INFO ]: Checked inductivity of 25 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:13,276 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:13,276 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:13,282 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:13,306 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:52:13,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:13,308 INFO ]: Computing forward predicates... [2018-06-24 20:52:13,417 INFO ]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:13,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:13,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 19 [2018-06-24 20:52:13,436 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:52:13,436 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:52:13,436 INFO ]: CoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:52:13,436 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 19 states. [2018-06-24 20:52:13,541 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:13,541 INFO ]: Finished difference Result 17 states and 18 transitions. [2018-06-24 20:52:13,541 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:52:13,541 INFO ]: Start accepts. Automaton has 19 states. Word has length 15 [2018-06-24 20:52:13,542 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:13,542 INFO ]: With dead ends: 17 [2018-06-24 20:52:13,542 INFO ]: Without dead ends: 17 [2018-06-24 20:52:13,542 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:52:13,542 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:52:13,543 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:52:13,543 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:52:13,543 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-24 20:52:13,543 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-06-24 20:52:13,543 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:13,543 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-24 20:52:13,543 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:52:13,543 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-24 20:52:13,543 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:52:13,543 INFO ]: Found error trace [2018-06-24 20:52:13,543 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:13,543 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:13,543 INFO ]: Analyzing trace with hash 774882246, now seen corresponding path program 13 times [2018-06-24 20:52:13,544 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:13,544 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:13,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:13,544 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:13,544 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:13,556 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:13,698 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:13,698 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:13,698 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:13,703 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:13,727 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:13,730 INFO ]: Computing forward predicates... [2018-06-24 20:52:13,855 INFO ]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:13,880 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:13,880 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-06-24 20:52:13,880 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:52:13,880 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:52:13,880 INFO ]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:52:13,881 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2018-06-24 20:52:14,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:14,215 INFO ]: Finished difference Result 26 states and 29 transitions. [2018-06-24 20:52:14,215 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:52:14,215 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:52:14,215 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:14,215 INFO ]: With dead ends: 26 [2018-06-24 20:52:14,215 INFO ]: Without dead ends: 26 [2018-06-24 20:52:14,216 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:52:14,216 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:52:14,217 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-06-24 20:52:14,217 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:52:14,218 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-24 20:52:14,218 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-06-24 20:52:14,218 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:14,218 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-24 20:52:14,218 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:52:14,218 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-24 20:52:14,218 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:52:14,218 INFO ]: Found error trace [2018-06-24 20:52:14,218 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:14,218 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:14,218 INFO ]: Analyzing trace with hash -1749191129, now seen corresponding path program 14 times [2018-06-24 20:52:14,218 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:14,218 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:14,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:14,219 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:14,219 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:14,230 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:14,414 INFO ]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:14,414 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:14,414 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:14,421 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:14,453 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:14,453 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:14,456 INFO ]: Computing forward predicates... [2018-06-24 20:52:14,602 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:14,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:14,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-24 20:52:14,621 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:52:14,622 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:52:14,622 INFO ]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:52:14,622 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 23 states. [2018-06-24 20:52:14,722 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:14,722 INFO ]: Finished difference Result 25 states and 27 transitions. [2018-06-24 20:52:14,722 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-24 20:52:14,722 INFO ]: Start accepts. Automaton has 23 states. Word has length 17 [2018-06-24 20:52:14,722 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:14,723 INFO ]: With dead ends: 25 [2018-06-24 20:52:14,723 INFO ]: Without dead ends: 18 [2018-06-24 20:52:14,723 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=637, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:52:14,723 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:52:14,724 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:52:14,724 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:52:14,725 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-24 20:52:14,725 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 17 [2018-06-24 20:52:14,725 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:14,725 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-24 20:52:14,725 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:52:14,725 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-24 20:52:14,725 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:52:14,725 INFO ]: Found error trace [2018-06-24 20:52:14,725 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:14,725 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:14,725 INFO ]: Analyzing trace with hash -1229439122, now seen corresponding path program 15 times [2018-06-24 20:52:14,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:14,725 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:14,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:14,726 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:14,726 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:14,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:14,855 INFO ]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:14,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:14,855 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:14,861 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:14,890 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:52:14,890 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:14,892 INFO ]: Computing forward predicates... [2018-06-24 20:52:15,032 INFO ]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:15,051 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:15,051 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 22 [2018-06-24 20:52:15,051 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:52:15,051 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:52:15,051 INFO ]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:52:15,052 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 22 states. [2018-06-24 20:52:15,154 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:15,155 INFO ]: Finished difference Result 19 states and 20 transitions. [2018-06-24 20:52:15,156 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:52:15,156 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-24 20:52:15,156 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:15,156 INFO ]: With dead ends: 19 [2018-06-24 20:52:15,156 INFO ]: Without dead ends: 19 [2018-06-24 20:52:15,157 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=525, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:52:15,157 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:52:15,158 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:52:15,158 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:52:15,158 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-24 20:52:15,158 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 17 [2018-06-24 20:52:15,158 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:15,158 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-24 20:52:15,158 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:52:15,158 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-24 20:52:15,159 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:52:15,159 INFO ]: Found error trace [2018-06-24 20:52:15,159 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:15,159 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:15,159 INFO ]: Analyzing trace with hash 541355903, now seen corresponding path program 16 times [2018-06-24 20:52:15,159 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:15,159 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:15,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:15,159 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:15,159 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:15,171 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:15,459 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:15,459 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:15,459 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:15,471 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:15,501 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:15,501 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:15,504 INFO ]: Computing forward predicates... [2018-06-24 20:52:15,537 INFO ]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:15,562 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:15,562 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-06-24 20:52:15,562 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:52:15,562 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:52:15,563 INFO ]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:52:15,563 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-06-24 20:52:15,932 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:15,932 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-24 20:52:15,932 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:52:15,932 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:52:15,932 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:15,933 INFO ]: With dead ends: 29 [2018-06-24 20:52:15,933 INFO ]: Without dead ends: 29 [2018-06-24 20:52:15,933 INFO ]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:52:15,933 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:52:15,935 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-06-24 20:52:15,935 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:52:15,935 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-06-24 20:52:15,935 INFO ]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-06-24 20:52:15,935 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:15,935 INFO ]: Abstraction has 21 states and 23 transitions. [2018-06-24 20:52:15,935 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:52:15,935 INFO ]: Start isEmpty. Operand 21 states and 23 transitions. [2018-06-24 20:52:15,936 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:52:15,936 INFO ]: Found error trace [2018-06-24 20:52:15,936 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:15,936 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:15,936 INFO ]: Analyzing trace with hash -398573170, now seen corresponding path program 17 times [2018-06-24 20:52:15,936 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:15,936 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:15,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:15,936 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:15,936 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:15,952 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:16,120 INFO ]: Checked inductivity of 49 backedges. 21 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:16,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:16,120 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:16,136 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:16,185 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:52:16,185 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:16,187 INFO ]: Computing forward predicates... [2018-06-24 20:52:16,336 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:16,368 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:16,368 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-24 20:52:16,369 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:52:16,369 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:52:16,369 INFO ]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:52:16,369 INFO ]: Start difference. First operand 21 states and 23 transitions. Second operand 26 states. [2018-06-24 20:52:16,512 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:16,512 INFO ]: Finished difference Result 28 states and 30 transitions. [2018-06-24 20:52:16,513 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-24 20:52:16,513 INFO ]: Start accepts. Automaton has 26 states. Word has length 19 [2018-06-24 20:52:16,513 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:16,513 INFO ]: With dead ends: 28 [2018-06-24 20:52:16,513 INFO ]: Without dead ends: 20 [2018-06-24 20:52:16,513 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=294, Invalid=828, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:52:16,513 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:52:16,515 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:52:16,515 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:52:16,515 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-24 20:52:16,515 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 19 [2018-06-24 20:52:16,515 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:16,515 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-24 20:52:16,515 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:52:16,515 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-24 20:52:16,515 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:52:16,515 INFO ]: Found error trace [2018-06-24 20:52:16,516 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:16,516 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:16,516 INFO ]: Analyzing trace with hash -1466130137, now seen corresponding path program 18 times [2018-06-24 20:52:16,516 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:16,516 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:16,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:16,516 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:16,516 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:16,527 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:16,962 INFO ]: Checked inductivity of 49 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:16,962 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:16,962 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:16,967 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:16,998 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:52:16,998 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:17,001 INFO ]: Computing forward predicates... [2018-06-24 20:52:17,231 INFO ]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:17,250 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:17,250 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 25 [2018-06-24 20:52:17,250 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:52:17,250 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:52:17,250 INFO ]: CoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:52:17,250 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 25 states. [2018-06-24 20:52:17,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:17,357 INFO ]: Finished difference Result 21 states and 22 transitions. [2018-06-24 20:52:17,358 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:52:17,358 INFO ]: Start accepts. Automaton has 25 states. Word has length 19 [2018-06-24 20:52:17,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:17,358 INFO ]: With dead ends: 21 [2018-06-24 20:52:17,358 INFO ]: Without dead ends: 21 [2018-06-24 20:52:17,358 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=692, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:52:17,358 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:52:17,359 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:52:17,360 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:52:17,360 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-24 20:52:17,360 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-06-24 20:52:17,360 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:17,360 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-24 20:52:17,360 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:52:17,360 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-24 20:52:17,360 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:52:17,360 INFO ]: Found error trace [2018-06-24 20:52:17,360 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:17,361 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:17,361 INFO ]: Analyzing trace with hash 1793869030, now seen corresponding path program 19 times [2018-06-24 20:52:17,361 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:17,361 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:17,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:17,361 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:17,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:17,378 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:17,637 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:17,637 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:17,637 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:17,646 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:17,676 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:17,679 INFO ]: Computing forward predicates... [2018-06-24 20:52:17,746 INFO ]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:17,765 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:17,765 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-06-24 20:52:17,765 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:52:17,765 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:52:17,765 INFO ]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:52:17,765 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2018-06-24 20:52:18,054 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:18,054 INFO ]: Finished difference Result 32 states and 35 transitions. [2018-06-24 20:52:18,054 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:52:18,054 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:52:18,054 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:18,054 INFO ]: With dead ends: 32 [2018-06-24 20:52:18,054 INFO ]: Without dead ends: 32 [2018-06-24 20:52:18,055 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:52:18,055 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:52:18,061 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 23. [2018-06-24 20:52:18,061 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:52:18,061 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-24 20:52:18,061 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-24 20:52:18,061 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:18,061 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-24 20:52:18,061 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:52:18,061 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-24 20:52:18,062 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:52:18,062 INFO ]: Found error trace [2018-06-24 20:52:18,062 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:18,062 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:18,062 INFO ]: Analyzing trace with hash -225371897, now seen corresponding path program 20 times [2018-06-24 20:52:18,062 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:18,062 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:18,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:18,062 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:18,062 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:18,073 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:18,425 INFO ]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:18,425 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:18,425 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:18,430 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:18,462 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:18,462 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:18,465 INFO ]: Computing forward predicates... [2018-06-24 20:52:18,737 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:18,756 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:18,756 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2018-06-24 20:52:18,756 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:52:18,756 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:52:18,757 INFO ]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:52:18,757 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 29 states. [2018-06-24 20:52:19,019 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:19,019 INFO ]: Finished difference Result 31 states and 33 transitions. [2018-06-24 20:52:19,020 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-06-24 20:52:19,020 INFO ]: Start accepts. Automaton has 29 states. Word has length 21 [2018-06-24 20:52:19,020 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:19,020 INFO ]: With dead ends: 31 [2018-06-24 20:52:19,020 INFO ]: Without dead ends: 22 [2018-06-24 20:52:19,020 INFO ]: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:52:19,020 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:52:19,022 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:52:19,022 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:52:19,022 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-24 20:52:19,022 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 21 [2018-06-24 20:52:19,022 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:19,022 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-24 20:52:19,022 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:52:19,022 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-24 20:52:19,023 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:52:19,023 INFO ]: Found error trace [2018-06-24 20:52:19,023 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:19,023 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:19,023 INFO ]: Analyzing trace with hash 1040100494, now seen corresponding path program 21 times [2018-06-24 20:52:19,023 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:19,023 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:19,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:19,023 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:19,023 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:19,033 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:19,330 INFO ]: Checked inductivity of 64 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:19,330 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:19,330 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:19,335 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:19,371 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:52:19,371 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:19,373 INFO ]: Computing forward predicates... [2018-06-24 20:52:19,516 INFO ]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:19,558 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:19,558 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 28 [2018-06-24 20:52:19,559 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:52:19,559 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:52:19,559 INFO ]: CoverageRelationStatistics Valid=182, Invalid=574, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:52:19,559 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 28 states. [2018-06-24 20:52:20,005 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:20,005 INFO ]: Finished difference Result 23 states and 24 transitions. [2018-06-24 20:52:20,006 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:52:20,006 INFO ]: Start accepts. Automaton has 28 states. Word has length 21 [2018-06-24 20:52:20,006 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:20,006 INFO ]: With dead ends: 23 [2018-06-24 20:52:20,006 INFO ]: Without dead ends: 23 [2018-06-24 20:52:20,006 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=882, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:52:20,006 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:52:20,008 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:52:20,008 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:52:20,008 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-24 20:52:20,008 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2018-06-24 20:52:20,008 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:20,008 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-24 20:52:20,008 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:52:20,008 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-24 20:52:20,009 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:52:20,009 INFO ]: Found error trace [2018-06-24 20:52:20,009 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:20,009 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:20,009 INFO ]: Analyzing trace with hash -2117360033, now seen corresponding path program 22 times [2018-06-24 20:52:20,009 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:20,009 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:20,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:20,009 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:20,009 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:20,022 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:20,370 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:20,370 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:20,370 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:20,376 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:20,410 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:20,410 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:20,413 INFO ]: Computing forward predicates... [2018-06-24 20:52:20,528 INFO ]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:20,547 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:20,548 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-06-24 20:52:20,548 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:52:20,548 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:52:20,548 INFO ]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:52:20,548 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 20 states. [2018-06-24 20:52:20,890 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:20,890 INFO ]: Finished difference Result 35 states and 38 transitions. [2018-06-24 20:52:20,890 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:20,890 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:52:20,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:20,891 INFO ]: With dead ends: 35 [2018-06-24 20:52:20,891 INFO ]: Without dead ends: 35 [2018-06-24 20:52:20,891 INFO ]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:52:20,891 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:52:20,892 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 25. [2018-06-24 20:52:20,892 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:52:20,893 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-06-24 20:52:20,893 INFO ]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-06-24 20:52:20,893 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:20,893 INFO ]: Abstraction has 25 states and 27 transitions. [2018-06-24 20:52:20,893 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:52:20,893 INFO ]: Start isEmpty. Operand 25 states and 27 transitions. [2018-06-24 20:52:20,893 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:52:20,893 INFO ]: Found error trace [2018-06-24 20:52:20,893 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:20,894 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:20,894 INFO ]: Analyzing trace with hash -1214388562, now seen corresponding path program 23 times [2018-06-24 20:52:20,894 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:20,894 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:20,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:20,894 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:20,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:20,906 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:21,390 INFO ]: Checked inductivity of 81 backedges. 36 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:21,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:21,390 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:21,402 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:21,446 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:52:21,446 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:21,449 INFO ]: Computing forward predicates... [2018-06-24 20:52:21,663 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:21,683 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:21,683 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2018-06-24 20:52:21,683 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:52:21,684 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:52:21,684 INFO ]: CoverageRelationStatistics Valid=242, Invalid=750, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:52:21,684 INFO ]: Start difference. First operand 25 states and 27 transitions. Second operand 32 states. [2018-06-24 20:52:21,855 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:21,855 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-24 20:52:21,856 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-24 20:52:21,856 INFO ]: Start accepts. Automaton has 32 states. Word has length 23 [2018-06-24 20:52:21,856 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:21,856 INFO ]: With dead ends: 34 [2018-06-24 20:52:21,856 INFO ]: Without dead ends: 24 [2018-06-24 20:52:21,857 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=1285, Unknown=0, NotChecked=0, Total=1722 [2018-06-24 20:52:21,857 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:52:21,858 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:52:21,858 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:52:21,858 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-24 20:52:21,858 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 23 [2018-06-24 20:52:21,859 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:21,859 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-24 20:52:21,859 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:52:21,859 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-24 20:52:21,859 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:52:21,859 INFO ]: Found error trace [2018-06-24 20:52:21,859 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:21,859 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:21,859 INFO ]: Analyzing trace with hash -639450105, now seen corresponding path program 24 times [2018-06-24 20:52:21,859 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:21,859 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:21,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:21,861 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:21,861 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:21,875 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:22,332 INFO ]: Checked inductivity of 81 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:22,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:22,332 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-24 20:52:22,338 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:22,379 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:52:22,379 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:22,382 INFO ]: Computing forward predicates... [2018-06-24 20:52:23,516 INFO ]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:23,535 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:23,535 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2018-06-24 20:52:23,535 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:52:23,535 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:52:23,536 INFO ]: CoverageRelationStatistics Valid=222, Invalid=708, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:52:23,536 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 31 states. [2018-06-24 20:52:23,689 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:23,689 INFO ]: Finished difference Result 25 states and 26 transitions. [2018-06-24 20:52:23,691 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:52:23,691 INFO ]: Start accepts. Automaton has 31 states. Word has length 23 [2018-06-24 20:52:23,691 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:23,691 INFO ]: With dead ends: 25 [2018-06-24 20:52:23,691 INFO ]: Without dead ends: 25 [2018-06-24 20:52:23,692 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=465, Invalid=1095, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:52:23,692 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:52:23,693 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:52:23,693 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:52:23,693 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-24 20:52:23,693 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-06-24 20:52:23,693 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:23,693 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-24 20:52:23,694 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:52:23,694 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-24 20:52:23,694 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:52:23,694 INFO ]: Found error trace [2018-06-24 20:52:23,694 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:23,694 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:23,694 INFO ]: Analyzing trace with hash 1651146246, now seen corresponding path program 25 times [2018-06-24 20:52:23,694 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:23,694 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:23,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:23,695 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:23,695 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:23,723 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:24,266 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:24,267 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:24,267 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-24 20:52:24,272 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:24,310 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:24,314 INFO ]: Computing forward predicates... [2018-06-24 20:52:24,368 INFO ]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:24,387 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:24,387 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-06-24 20:52:24,387 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:52:24,388 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:52:24,388 INFO ]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:52:24,388 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 22 states. [2018-06-24 20:52:24,849 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:24,849 INFO ]: Finished difference Result 38 states and 41 transitions. [2018-06-24 20:52:24,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:52:24,849 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:52:24,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:24,850 INFO ]: With dead ends: 38 [2018-06-24 20:52:24,850 INFO ]: Without dead ends: 38 [2018-06-24 20:52:24,850 INFO ]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:52:24,850 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:52:24,945 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-06-24 20:52:24,946 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:52:24,947 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-06-24 20:52:24,947 INFO ]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-06-24 20:52:24,947 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:24,947 INFO ]: Abstraction has 27 states and 29 transitions. [2018-06-24 20:52:24,947 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:52:24,947 INFO ]: Start isEmpty. Operand 27 states and 29 transitions. [2018-06-24 20:52:24,948 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:52:24,948 INFO ]: Found error trace [2018-06-24 20:52:24,948 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:24,948 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:24,948 INFO ]: Analyzing trace with hash -354810905, now seen corresponding path program 26 times [2018-06-24 20:52:24,948 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:24,948 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:24,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:24,949 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:24,949 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:24,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:25,170 INFO ]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:25,170 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:25,171 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-24 20:52:25,182 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:25,226 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:25,226 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:25,229 INFO ]: Computing forward predicates... [2018-06-24 20:52:25,830 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:25,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:25,848 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-24 20:52:25,848 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:52:25,849 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:52:25,849 INFO ]: CoverageRelationStatistics Valid=288, Invalid=902, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:52:25,849 INFO ]: Start difference. First operand 27 states and 29 transitions. Second operand 35 states. [2018-06-24 20:52:26,140 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:26,140 INFO ]: Finished difference Result 37 states and 39 transitions. [2018-06-24 20:52:26,141 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-24 20:52:26,141 INFO ]: Start accepts. Automaton has 35 states. Word has length 25 [2018-06-24 20:52:26,141 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:26,141 INFO ]: With dead ends: 37 [2018-06-24 20:52:26,141 INFO ]: Without dead ends: 26 [2018-06-24 20:52:26,142 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=519, Invalid=1551, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:52:26,142 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:52:26,143 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:52:26,143 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:52:26,144 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-24 20:52:26,144 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 25 [2018-06-24 20:52:26,144 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:26,144 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-24 20:52:26,144 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:52:26,144 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-24 20:52:26,144 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:52:26,144 INFO ]: Found error trace [2018-06-24 20:52:26,144 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:26,144 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:26,144 INFO ]: Analyzing trace with hash 288412078, now seen corresponding path program 27 times [2018-06-24 20:52:26,144 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:26,144 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:26,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:26,146 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:26,146 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:26,158 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:26,411 INFO ]: Checked inductivity of 100 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:26,411 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:26,411 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-24 20:52:26,420 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:26,460 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:52:26,460 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:26,462 INFO ]: Computing forward predicates... [2018-06-24 20:52:27,093 INFO ]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:27,113 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:27,113 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 34 [2018-06-24 20:52:27,114 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:52:27,114 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:52:27,114 INFO ]: CoverageRelationStatistics Valid=266, Invalid=856, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:52:27,114 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 34 states. [2018-06-24 20:52:27,295 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:27,295 INFO ]: Finished difference Result 27 states and 28 transitions. [2018-06-24 20:52:27,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:52:27,296 INFO ]: Start accepts. Automaton has 34 states. Word has length 25 [2018-06-24 20:52:27,296 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:27,296 INFO ]: With dead ends: 27 [2018-06-24 20:52:27,296 INFO ]: Without dead ends: 27 [2018-06-24 20:52:27,297 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=1331, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:52:27,297 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:52:27,298 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:52:27,298 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:52:27,299 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-24 20:52:27,299 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 25 [2018-06-24 20:52:27,299 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:27,299 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-24 20:52:27,299 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:52:27,299 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-24 20:52:27,299 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:52:27,299 INFO ]: Found error trace [2018-06-24 20:52:27,299 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:27,299 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:27,299 INFO ]: Analyzing trace with hash 350102847, now seen corresponding path program 28 times [2018-06-24 20:52:27,299 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:27,299 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:27,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:27,303 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:27,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:27,317 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:27,636 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:27,636 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:27,636 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-24 20:52:27,641 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:27,680 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:27,680 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:27,684 INFO ]: Computing forward predicates... [2018-06-24 20:52:27,761 INFO ]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:27,780 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:27,780 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-06-24 20:52:27,780 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:52:27,780 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:52:27,780 INFO ]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:52:27,780 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2018-06-24 20:52:28,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:28,232 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-24 20:52:28,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:52:28,232 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:52:28,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:28,232 INFO ]: With dead ends: 41 [2018-06-24 20:52:28,232 INFO ]: Without dead ends: 41 [2018-06-24 20:52:28,233 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:52:28,233 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:52:28,234 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 29. [2018-06-24 20:52:28,234 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:52:28,234 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-24 20:52:28,234 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-06-24 20:52:28,234 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:28,234 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-24 20:52:28,234 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:52:28,234 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-24 20:52:28,235 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:52:28,235 INFO ]: Found error trace [2018-06-24 20:52:28,235 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:28,235 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:28,235 INFO ]: Analyzing trace with hash -2032450610, now seen corresponding path program 29 times [2018-06-24 20:52:28,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:28,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:28,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:28,235 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:28,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:28,250 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:28,641 INFO ]: Checked inductivity of 121 backedges. 55 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:28,641 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:28,641 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:28,647 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:28,693 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:52:28,693 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:28,697 INFO ]: Computing forward predicates... [2018-06-24 20:52:29,034 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:29,055 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:29,055 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-24 20:52:29,055 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:52:29,055 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:52:29,056 INFO ]: CoverageRelationStatistics Valid=338, Invalid=1068, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:52:29,056 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 38 states. [2018-06-24 20:52:29,290 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:29,290 INFO ]: Finished difference Result 40 states and 42 transitions. [2018-06-24 20:52:29,291 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-24 20:52:29,291 INFO ]: Start accepts. Automaton has 38 states. Word has length 27 [2018-06-24 20:52:29,291 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:29,291 INFO ]: With dead ends: 40 [2018-06-24 20:52:29,291 INFO ]: Without dead ends: 28 [2018-06-24 20:52:29,292 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=608, Invalid=1842, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:52:29,292 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:52:29,292 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:52:29,293 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:52:29,293 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-24 20:52:29,293 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 27 [2018-06-24 20:52:29,293 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:29,293 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-24 20:52:29,293 INFO ]: Interpolant automaton has 38 states. [2018-06-24 20:52:29,293 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-24 20:52:29,293 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:52:29,293 INFO ]: Found error trace [2018-06-24 20:52:29,293 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:29,293 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:29,294 INFO ]: Analyzing trace with hash 727592679, now seen corresponding path program 30 times [2018-06-24 20:52:29,294 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:29,294 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:29,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:29,294 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:29,294 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:29,306 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,039 INFO ]: Checked inductivity of 121 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:30,039 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:30,040 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-24 20:52:30,050 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:30,097 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:52:30,097 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:30,099 INFO ]: Computing forward predicates... [2018-06-24 20:52:30,423 INFO ]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:30,443 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:30,443 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 37 [2018-06-24 20:52:30,443 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:52:30,443 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:52:30,444 INFO ]: CoverageRelationStatistics Valid=314, Invalid=1018, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:52:30,444 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 37 states. [2018-06-24 20:52:30,640 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:30,640 INFO ]: Finished difference Result 29 states and 30 transitions. [2018-06-24 20:52:30,640 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:52:30,640 INFO ]: Start accepts. Automaton has 37 states. Word has length 27 [2018-06-24 20:52:30,640 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:30,640 INFO ]: With dead ends: 29 [2018-06-24 20:52:30,640 INFO ]: Without dead ends: 29 [2018-06-24 20:52:30,641 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=666, Invalid=1590, Unknown=0, NotChecked=0, Total=2256 [2018-06-24 20:52:30,641 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:52:30,642 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:52:30,642 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:52:30,642 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-24 20:52:30,642 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-06-24 20:52:30,642 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:30,642 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-24 20:52:30,642 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:52:30,642 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-24 20:52:30,642 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:52:30,642 INFO ]: Found error trace [2018-06-24 20:52:30,643 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:30,643 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:30,643 INFO ]: Analyzing trace with hash 1079799590, now seen corresponding path program 31 times [2018-06-24 20:52:30,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:30,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:30,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,643 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:30,643 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:30,659 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,365 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:31,365 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:31,365 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-24 20:52:31,371 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:31,413 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:31,416 INFO ]: Computing forward predicates... [2018-06-24 20:52:31,491 INFO ]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:31,510 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:31,510 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-06-24 20:52:31,510 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:52:31,510 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:52:31,510 INFO ]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:52:31,510 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 26 states. [2018-06-24 20:52:32,033 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:32,033 INFO ]: Finished difference Result 44 states and 47 transitions. [2018-06-24 20:52:32,033 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:52:32,033 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 20:52:32,033 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:32,033 INFO ]: With dead ends: 44 [2018-06-24 20:52:32,033 INFO ]: Without dead ends: 44 [2018-06-24 20:52:32,034 INFO ]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:52:32,034 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-24 20:52:32,035 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-06-24 20:52:32,035 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:52:32,036 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-24 20:52:32,036 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-06-24 20:52:32,036 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:32,036 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-24 20:52:32,036 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:52:32,036 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-24 20:52:32,036 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:52:32,036 INFO ]: Found error trace [2018-06-24 20:52:32,036 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:32,036 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:32,036 INFO ]: Analyzing trace with hash -886688057, now seen corresponding path program 32 times [2018-06-24 20:52:32,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:32,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:32,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:32,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:32,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:32,048 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,426 INFO ]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:32,426 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:32,426 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-24 20:52:32,431 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:32,475 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:32,475 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:32,478 INFO ]: Computing forward predicates... [2018-06-24 20:52:32,931 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:32,950 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:32,950 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2018-06-24 20:52:32,950 INFO ]: Interpolant automaton has 41 states [2018-06-24 20:52:32,950 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-24 20:52:32,951 INFO ]: CoverageRelationStatistics Valid=392, Invalid=1248, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:52:32,951 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 41 states. [2018-06-24 20:52:33,205 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:33,205 INFO ]: Finished difference Result 43 states and 45 transitions. [2018-06-24 20:52:33,205 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-24 20:52:33,205 INFO ]: Start accepts. Automaton has 41 states. Word has length 29 [2018-06-24 20:52:33,205 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:33,205 INFO ]: With dead ends: 43 [2018-06-24 20:52:33,205 INFO ]: Without dead ends: 30 [2018-06-24 20:52:33,206 INFO ]: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=704, Invalid=2158, Unknown=0, NotChecked=0, Total=2862 [2018-06-24 20:52:33,206 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:52:33,207 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:52:33,207 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:52:33,207 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-24 20:52:33,207 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 29 [2018-06-24 20:52:33,207 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:33,207 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-24 20:52:33,207 INFO ]: Interpolant automaton has 41 states. [2018-06-24 20:52:33,207 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-24 20:52:33,207 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:52:33,207 INFO ]: Found error trace [2018-06-24 20:52:33,207 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:33,208 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:33,208 INFO ]: Analyzing trace with hash -1224692018, now seen corresponding path program 33 times [2018-06-24 20:52:33,208 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:33,208 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:33,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:33,208 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:33,208 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:33,221 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:33,642 INFO ]: Checked inductivity of 144 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:33,642 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:33,642 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:33,647 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:33,695 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:52:33,695 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:33,698 INFO ]: Computing forward predicates... [2018-06-24 20:52:33,968 INFO ]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:33,987 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:33,987 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 40 [2018-06-24 20:52:33,987 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:52:33,987 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:52:33,988 INFO ]: CoverageRelationStatistics Valid=366, Invalid=1194, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:52:33,988 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 40 states. [2018-06-24 20:52:34,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:34,484 INFO ]: Finished difference Result 31 states and 32 transitions. [2018-06-24 20:52:34,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:52:34,484 INFO ]: Start accepts. Automaton has 40 states. Word has length 29 [2018-06-24 20:52:34,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:34,484 INFO ]: With dead ends: 31 [2018-06-24 20:52:34,484 INFO ]: Without dead ends: 31 [2018-06-24 20:52:34,485 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=1872, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:52:34,485 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:52:34,485 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:52:34,485 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:52:34,486 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-24 20:52:34,486 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 29 [2018-06-24 20:52:34,486 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:34,486 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-24 20:52:34,486 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:52:34,486 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-24 20:52:34,486 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:52:34,486 INFO ]: Found error trace [2018-06-24 20:52:34,486 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:34,486 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:34,486 INFO ]: Analyzing trace with hash 688516127, now seen corresponding path program 34 times [2018-06-24 20:52:34,486 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:34,486 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:34,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,487 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:34,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:34,502 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,488 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:35,489 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:35,489 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:35,494 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:35,541 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:35,541 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:35,546 INFO ]: Computing forward predicates... [2018-06-24 20:52:35,622 INFO ]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:35,640 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:35,641 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-06-24 20:52:35,641 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:52:35,641 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:52:35,641 INFO ]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:52:35,641 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 28 states. [2018-06-24 20:52:36,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:36,283 INFO ]: Finished difference Result 47 states and 50 transitions. [2018-06-24 20:52:36,283 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:52:36,283 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-24 20:52:36,283 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:36,283 INFO ]: With dead ends: 47 [2018-06-24 20:52:36,283 INFO ]: Without dead ends: 47 [2018-06-24 20:52:36,284 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=1659, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:52:36,284 INFO ]: Start minimizeSevpa. Operand 47 states. [2018-06-24 20:52:36,285 INFO ]: Finished minimizeSevpa. Reduced states from 47 to 33. [2018-06-24 20:52:36,285 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:52:36,285 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-24 20:52:36,285 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-06-24 20:52:36,285 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:36,285 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-24 20:52:36,285 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:52:36,285 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-24 20:52:36,286 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:52:36,286 INFO ]: Found error trace [2018-06-24 20:52:36,286 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:36,286 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:36,286 INFO ]: Analyzing trace with hash -131573522, now seen corresponding path program 35 times [2018-06-24 20:52:36,286 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:36,286 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:36,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:36,286 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:36,286 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:36,300 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:36,779 INFO ]: Checked inductivity of 169 backedges. 78 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:36,779 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:36,779 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:36,784 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:36,836 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:52:36,836 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:36,839 INFO ]: Computing forward predicates... [2018-06-24 20:52:37,213 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:37,232 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:37,232 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 44 [2018-06-24 20:52:37,232 INFO ]: Interpolant automaton has 44 states [2018-06-24 20:52:37,232 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-24 20:52:37,232 INFO ]: CoverageRelationStatistics Valid=450, Invalid=1442, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:52:37,232 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 44 states. [2018-06-24 20:52:37,509 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:37,509 INFO ]: Finished difference Result 46 states and 48 transitions. [2018-06-24 20:52:37,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-24 20:52:37,509 INFO ]: Start accepts. Automaton has 44 states. Word has length 31 [2018-06-24 20:52:37,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:37,509 INFO ]: With dead ends: 46 [2018-06-24 20:52:37,509 INFO ]: Without dead ends: 32 [2018-06-24 20:52:37,510 INFO ]: 0 DeclaredPredicates, 73 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=807, Invalid=2499, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:52:37,510 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:52:37,511 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:52:37,511 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:52:37,511 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-24 20:52:37,511 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 31 [2018-06-24 20:52:37,511 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:37,511 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-24 20:52:37,511 INFO ]: Interpolant automaton has 44 states. [2018-06-24 20:52:37,511 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-24 20:52:37,512 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:52:37,512 INFO ]: Found error trace [2018-06-24 20:52:37,512 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:37,512 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:37,512 INFO ]: Analyzing trace with hash -2019761721, now seen corresponding path program 36 times [2018-06-24 20:52:37,512 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:37,512 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:37,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:37,512 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:37,512 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:37,522 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:37,841 INFO ]: Checked inductivity of 169 backedges. 79 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:37,841 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:37,841 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:37,847 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:37,900 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:52:37,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:37,903 INFO ]: Computing forward predicates... [2018-06-24 20:52:38,149 INFO ]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:38,168 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:38,168 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29] total 43 [2018-06-24 20:52:38,168 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:52:38,168 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:52:38,168 INFO ]: CoverageRelationStatistics Valid=422, Invalid=1384, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:52:38,168 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 43 states. [2018-06-24 20:52:38,447 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:38,447 INFO ]: Finished difference Result 33 states and 34 transitions. [2018-06-24 20:52:38,447 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:52:38,447 INFO ]: Start accepts. Automaton has 43 states. Word has length 31 [2018-06-24 20:52:38,447 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:38,447 INFO ]: With dead ends: 33 [2018-06-24 20:52:38,447 INFO ]: Without dead ends: 33 [2018-06-24 20:52:38,448 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=2177, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 20:52:38,448 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:52:38,448 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:52:38,448 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:52:38,449 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-24 20:52:38,449 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-06-24 20:52:38,449 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:38,449 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-24 20:52:38,449 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:52:38,449 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-24 20:52:38,449 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:52:38,449 INFO ]: Found error trace [2018-06-24 20:52:38,449 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:38,449 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:38,449 INFO ]: Analyzing trace with hash 1811159110, now seen corresponding path program 37 times [2018-06-24 20:52:38,449 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:38,449 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:38,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:38,449 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:38,449 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:38,463 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:38,879 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:38,879 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:38,879 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:38,884 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:38,932 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:38,937 INFO ]: Computing forward predicates... [2018-06-24 20:52:39,067 INFO ]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:39,086 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:39,086 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-06-24 20:52:39,086 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:52:39,086 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:52:39,086 INFO ]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:52:39,087 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 30 states. [2018-06-24 20:52:39,795 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:39,795 INFO ]: Finished difference Result 50 states and 53 transitions. [2018-06-24 20:52:39,795 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:52:39,795 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-24 20:52:39,795 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:39,796 INFO ]: With dead ends: 50 [2018-06-24 20:52:39,796 INFO ]: Without dead ends: 50 [2018-06-24 20:52:39,796 INFO ]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 11 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=1912, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:52:39,796 INFO ]: Start minimizeSevpa. Operand 50 states. [2018-06-24 20:52:39,797 INFO ]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-06-24 20:52:39,797 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:52:39,797 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-24 20:52:39,798 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-06-24 20:52:39,798 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:39,798 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-24 20:52:39,798 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:52:39,798 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-24 20:52:39,798 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:52:39,798 INFO ]: Found error trace [2018-06-24 20:52:39,798 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:39,798 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:39,798 INFO ]: Analyzing trace with hash 310620583, now seen corresponding path program 38 times [2018-06-24 20:52:39,798 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:39,798 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:39,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:39,799 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:39,799 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:39,811 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:40,162 INFO ]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:40,162 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:40,162 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:40,168 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:40,219 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:40,219 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:40,223 INFO ]: Computing forward predicates... [2018-06-24 20:52:40,611 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:40,631 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:40,631 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 47 [2018-06-24 20:52:40,631 INFO ]: Interpolant automaton has 47 states [2018-06-24 20:52:40,632 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-24 20:52:40,632 INFO ]: CoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:52:40,632 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 47 states. [2018-06-24 20:52:40,955 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:40,956 INFO ]: Finished difference Result 49 states and 51 transitions. [2018-06-24 20:52:40,956 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-24 20:52:40,956 INFO ]: Start accepts. Automaton has 47 states. Word has length 33 [2018-06-24 20:52:40,956 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:40,956 INFO ]: With dead ends: 49 [2018-06-24 20:52:40,956 INFO ]: Without dead ends: 34 [2018-06-24 20:52:40,956 INFO ]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=917, Invalid=2865, Unknown=0, NotChecked=0, Total=3782 [2018-06-24 20:52:40,956 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:52:40,957 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:52:40,957 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:52:40,957 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-24 20:52:40,957 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 33 [2018-06-24 20:52:40,957 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:40,957 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-24 20:52:40,957 INFO ]: Interpolant automaton has 47 states. [2018-06-24 20:52:40,957 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-24 20:52:40,958 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:52:40,958 INFO ]: Found error trace [2018-06-24 20:52:40,958 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:40,958 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:40,958 INFO ]: Analyzing trace with hash 1906328558, now seen corresponding path program 39 times [2018-06-24 20:52:40,958 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:40,958 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:40,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:40,958 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:40,958 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:40,970 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:41,332 INFO ]: Checked inductivity of 196 backedges. 92 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:41,332 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:41,332 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:41,346 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:41,436 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:52:41,436 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:41,440 INFO ]: Computing forward predicates... [2018-06-24 20:52:41,715 INFO ]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:41,734 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:41,734 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 46 [2018-06-24 20:52:41,734 INFO ]: Interpolant automaton has 46 states [2018-06-24 20:52:41,734 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-24 20:52:41,735 INFO ]: CoverageRelationStatistics Valid=482, Invalid=1588, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:52:41,735 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 46 states. [2018-06-24 20:52:42,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:42,131 INFO ]: Finished difference Result 35 states and 36 transitions. [2018-06-24 20:52:42,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:52:42,131 INFO ]: Start accepts. Automaton has 46 states. Word has length 33 [2018-06-24 20:52:42,132 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:42,132 INFO ]: With dead ends: 35 [2018-06-24 20:52:42,132 INFO ]: Without dead ends: 35 [2018-06-24 20:52:42,132 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 974 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=2505, Unknown=0, NotChecked=0, Total=3540 [2018-06-24 20:52:42,132 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:52:42,133 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:52:42,133 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:52:42,133 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-24 20:52:42,133 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 33 [2018-06-24 20:52:42,133 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:42,133 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-24 20:52:42,133 INFO ]: Interpolant automaton has 46 states. [2018-06-24 20:52:42,133 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-24 20:52:42,133 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:52:42,133 INFO ]: Found error trace [2018-06-24 20:52:42,133 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:42,133 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:42,133 INFO ]: Analyzing trace with hash -1034093825, now seen corresponding path program 40 times [2018-06-24 20:52:42,133 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:42,133 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:42,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:42,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:42,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:42,154 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:43,224 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:43,224 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:43,224 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:43,230 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:43,283 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:43,283 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:43,288 INFO ]: Computing forward predicates... [2018-06-24 20:52:43,386 INFO ]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:43,417 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:43,417 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-06-24 20:52:43,418 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:52:43,418 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:52:43,418 INFO ]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:52:43,418 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-06-24 20:52:44,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:44,239 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-24 20:52:44,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:52:44,239 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-24 20:52:44,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:44,239 INFO ]: With dead ends: 53 [2018-06-24 20:52:44,239 INFO ]: Without dead ends: 53 [2018-06-24 20:52:44,240 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=169, Invalid=2183, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:52:44,240 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-24 20:52:44,241 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 37. [2018-06-24 20:52:44,241 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:52:44,241 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-06-24 20:52:44,241 INFO ]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-06-24 20:52:44,241 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:44,241 INFO ]: Abstraction has 37 states and 39 transitions. [2018-06-24 20:52:44,241 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:52:44,241 INFO ]: Start isEmpty. Operand 37 states and 39 transitions. [2018-06-24 20:52:44,242 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:52:44,242 INFO ]: Found error trace [2018-06-24 20:52:44,242 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:44,242 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:44,242 INFO ]: Analyzing trace with hash -1992874482, now seen corresponding path program 41 times [2018-06-24 20:52:44,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:44,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:44,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,243 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:44,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:44,257 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:44,590 INFO ]: Checked inductivity of 225 backedges. 105 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:44,590 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:44,590 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:44,595 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:44,658 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 20:52:44,658 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:44,662 INFO ]: Computing forward predicates... [2018-06-24 20:52:45,131 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:45,150 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:45,150 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 50 [2018-06-24 20:52:45,150 INFO ]: Interpolant automaton has 50 states [2018-06-24 20:52:45,150 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-24 20:52:45,150 INFO ]: CoverageRelationStatistics Valid=578, Invalid=1872, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:52:45,150 INFO ]: Start difference. First operand 37 states and 39 transitions. Second operand 50 states. [2018-06-24 20:52:45,425 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:45,425 INFO ]: Finished difference Result 52 states and 54 transitions. [2018-06-24 20:52:45,425 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-06-24 20:52:45,425 INFO ]: Start accepts. Automaton has 50 states. Word has length 35 [2018-06-24 20:52:45,426 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:45,426 INFO ]: With dead ends: 52 [2018-06-24 20:52:45,426 INFO ]: Without dead ends: 36 [2018-06-24 20:52:45,426 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1034, Invalid=3256, Unknown=0, NotChecked=0, Total=4290 [2018-06-24 20:52:45,426 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:52:45,427 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:52:45,427 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:52:45,427 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-24 20:52:45,428 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 35 [2018-06-24 20:52:45,428 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:45,428 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-24 20:52:45,428 INFO ]: Interpolant automaton has 50 states. [2018-06-24 20:52:45,428 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-24 20:52:45,428 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:52:45,428 INFO ]: Found error trace [2018-06-24 20:52:45,428 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:45,428 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:45,428 INFO ]: Analyzing trace with hash 229432487, now seen corresponding path program 42 times [2018-06-24 20:52:45,428 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:45,428 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:45,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:45,429 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:45,429 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:45,442 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:45,856 INFO ]: Checked inductivity of 225 backedges. 106 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:45,856 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:45,856 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:45,864 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:45,927 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-24 20:52:45,927 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:45,931 INFO ]: Computing forward predicates... [2018-06-24 20:52:46,247 INFO ]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:46,266 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:46,266 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 49 [2018-06-24 20:52:46,266 INFO ]: Interpolant automaton has 49 states [2018-06-24 20:52:46,266 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-24 20:52:46,266 INFO ]: CoverageRelationStatistics Valid=546, Invalid=1806, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:52:46,266 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 49 states. [2018-06-24 20:52:46,680 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:46,680 INFO ]: Finished difference Result 37 states and 38 transitions. [2018-06-24 20:52:46,680 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:52:46,681 INFO ]: Start accepts. Automaton has 49 states. Word has length 35 [2018-06-24 20:52:46,681 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:46,681 INFO ]: With dead ends: 37 [2018-06-24 20:52:46,681 INFO ]: Without dead ends: 37 [2018-06-24 20:52:46,681 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=2856, Unknown=0, NotChecked=0, Total=4032 [2018-06-24 20:52:46,681 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:52:46,683 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:52:46,683 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:52:46,683 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-24 20:52:46,683 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-06-24 20:52:46,683 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:46,683 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-24 20:52:46,683 INFO ]: Interpolant automaton has 49 states. [2018-06-24 20:52:46,683 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-24 20:52:46,683 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:52:46,683 INFO ]: Found error trace [2018-06-24 20:52:46,684 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:46,684 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:46,684 INFO ]: Analyzing trace with hash -1478264474, now seen corresponding path program 43 times [2018-06-24 20:52:46,684 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:46,684 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:46,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:46,684 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:46,684 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:46,698 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:47,528 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:47,528 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:47,528 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:47,533 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:47,592 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:47,598 INFO ]: Computing forward predicates... [2018-06-24 20:52:47,767 INFO ]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:47,787 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:47,788 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-06-24 20:52:47,788 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:52:47,788 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:52:47,788 INFO ]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:52:47,788 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 34 states. [2018-06-24 20:52:48,813 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:48,813 INFO ]: Finished difference Result 56 states and 59 transitions. [2018-06-24 20:52:48,813 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:52:48,813 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-24 20:52:48,813 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:48,813 INFO ]: With dead ends: 56 [2018-06-24 20:52:48,813 INFO ]: Without dead ends: 56 [2018-06-24 20:52:48,814 INFO ]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=180, Invalid=2472, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:52:48,814 INFO ]: Start minimizeSevpa. Operand 56 states. [2018-06-24 20:52:48,815 INFO ]: Finished minimizeSevpa. Reduced states from 56 to 39. [2018-06-24 20:52:48,815 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:52:48,815 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-06-24 20:52:48,816 INFO ]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-06-24 20:52:48,816 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:48,816 INFO ]: Abstraction has 39 states and 41 transitions. [2018-06-24 20:52:48,816 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:52:48,816 INFO ]: Start isEmpty. Operand 39 states and 41 transitions. [2018-06-24 20:52:48,816 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:52:48,816 INFO ]: Found error trace [2018-06-24 20:52:48,816 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:48,816 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:48,816 INFO ]: Analyzing trace with hash 1417704583, now seen corresponding path program 44 times [2018-06-24 20:52:48,816 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:48,816 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:48,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:48,818 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:52:48,818 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:48,832 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:49,278 INFO ]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:49,278 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:49,278 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:49,283 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:52:49,341 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:52:49,341 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:49,345 INFO ]: Computing forward predicates... [2018-06-24 20:52:49,829 INFO ]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:49,848 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:49,935 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 53 [2018-06-24 20:52:49,935 INFO ]: Interpolant automaton has 53 states [2018-06-24 20:52:49,935 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-24 20:52:49,936 INFO ]: CoverageRelationStatistics Valid=648, Invalid=2108, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:52:49,936 INFO ]: Start difference. First operand 39 states and 41 transitions. Second operand 53 states. [2018-06-24 20:52:50,325 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:50,325 INFO ]: Finished difference Result 55 states and 57 transitions. [2018-06-24 20:52:50,325 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-06-24 20:52:50,325 INFO ]: Start accepts. Automaton has 53 states. Word has length 37 [2018-06-24 20:52:50,325 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:50,325 INFO ]: With dead ends: 55 [2018-06-24 20:52:50,325 INFO ]: Without dead ends: 38 [2018-06-24 20:52:50,326 INFO ]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1158, Invalid=3672, Unknown=0, NotChecked=0, Total=4830 [2018-06-24 20:52:50,326 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:52:50,327 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:52:50,327 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:52:50,327 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-24 20:52:50,327 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 37 [2018-06-24 20:52:50,327 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:50,327 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-24 20:52:50,327 INFO ]: Interpolant automaton has 53 states. [2018-06-24 20:52:50,327 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-24 20:52:50,327 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:52:50,327 INFO ]: Found error trace [2018-06-24 20:52:50,327 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:50,327 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:50,327 INFO ]: Analyzing trace with hash 1589743886, now seen corresponding path program 45 times [2018-06-24 20:52:50,327 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:50,327 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:50,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:50,328 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:50,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:50,340 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:51,266 INFO ]: Checked inductivity of 256 backedges. 121 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:51,266 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:51,266 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:51,272 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:52:51,338 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:52:51,338 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:51,342 INFO ]: Computing forward predicates... [2018-06-24 20:52:51,666 INFO ]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:51,685 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:51,685 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35] total 52 [2018-06-24 20:52:51,686 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:52:51,686 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:52:51,686 INFO ]: CoverageRelationStatistics Valid=614, Invalid=2038, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:52:51,686 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 52 states. [2018-06-24 20:52:52,158 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:52,158 INFO ]: Finished difference Result 39 states and 40 transitions. [2018-06-24 20:52:52,158 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:52:52,158 INFO ]: Start accepts. Automaton has 52 states. Word has length 37 [2018-06-24 20:52:52,158 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:52,159 INFO ]: With dead ends: 39 [2018-06-24 20:52:52,159 INFO ]: Without dead ends: 39 [2018-06-24 20:52:52,159 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=3230, Unknown=0, NotChecked=0, Total=4556 [2018-06-24 20:52:52,159 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:52:52,160 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:52:52,160 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:52:52,160 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-24 20:52:52,160 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 37 [2018-06-24 20:52:52,160 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:52,160 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-24 20:52:52,160 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:52:52,160 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-24 20:52:52,161 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:52:52,161 INFO ]: Found error trace [2018-06-24 20:52:52,161 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:52,161 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:52,161 INFO ]: Analyzing trace with hash 2036683231, now seen corresponding path program 46 times [2018-06-24 20:52:52,161 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:52,161 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:52,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:52,161 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:52,161 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:52,176 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:52,785 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:52,785 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:52,785 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:52,791 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:52:52,856 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:52:52,856 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:52,861 INFO ]: Computing forward predicates... [2018-06-24 20:52:52,934 INFO ]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:52,954 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:52,954 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-06-24 20:52:52,955 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:52:52,955 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:52:52,955 INFO ]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:52:52,955 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 36 states. [2018-06-24 20:52:53,924 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:53,924 INFO ]: Finished difference Result 59 states and 62 transitions. [2018-06-24 20:52:53,924 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:52:53,924 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-24 20:52:53,924 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:53,924 INFO ]: With dead ends: 59 [2018-06-24 20:52:53,924 INFO ]: Without dead ends: 59 [2018-06-24 20:52:53,925 INFO ]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=2779, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:52:53,925 INFO ]: Start minimizeSevpa. Operand 59 states. [2018-06-24 20:52:53,926 INFO ]: Finished minimizeSevpa. Reduced states from 59 to 41. [2018-06-24 20:52:53,926 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:52:53,926 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-24 20:52:53,926 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-06-24 20:52:53,926 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:53,926 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-24 20:52:53,926 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:52:53,926 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-24 20:52:53,927 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:52:53,927 INFO ]: Found error trace [2018-06-24 20:52:53,927 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:53,927 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:53,927 INFO ]: Analyzing trace with hash -1288066258, now seen corresponding path program 47 times [2018-06-24 20:52:53,927 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:53,927 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:53,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:53,927 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:53,927 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:53,943 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:55,227 INFO ]: Checked inductivity of 289 backedges. 136 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:55,228 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:55,228 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:55,233 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:52:55,304 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:52:55,304 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:55,309 INFO ]: Computing forward predicates... [2018-06-24 20:52:56,942 INFO ]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:56,961 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:56,961 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 56 [2018-06-24 20:52:56,961 INFO ]: Interpolant automaton has 56 states [2018-06-24 20:52:56,961 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-24 20:52:56,962 INFO ]: CoverageRelationStatistics Valid=722, Invalid=2358, Unknown=0, NotChecked=0, Total=3080 [2018-06-24 20:52:56,962 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 56 states. [2018-06-24 20:52:57,381 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:57,381 INFO ]: Finished difference Result 58 states and 60 transitions. [2018-06-24 20:52:57,381 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-06-24 20:52:57,381 INFO ]: Start accepts. Automaton has 56 states. Word has length 39 [2018-06-24 20:52:57,381 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:57,382 INFO ]: With dead ends: 58 [2018-06-24 20:52:57,382 INFO ]: Without dead ends: 40 [2018-06-24 20:52:57,382 INFO ]: 0 DeclaredPredicates, 93 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1289, Invalid=4113, Unknown=0, NotChecked=0, Total=5402 [2018-06-24 20:52:57,382 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:52:57,383 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:52:57,383 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:52:57,383 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-24 20:52:57,383 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 39 [2018-06-24 20:52:57,383 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:57,383 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-24 20:52:57,383 INFO ]: Interpolant automaton has 56 states. [2018-06-24 20:52:57,383 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-24 20:52:57,383 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:52:57,383 INFO ]: Found error trace [2018-06-24 20:52:57,383 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:57,383 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:57,384 INFO ]: Analyzing trace with hash -249815161, now seen corresponding path program 48 times [2018-06-24 20:52:57,384 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:57,384 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:57,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,384 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:57,384 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:57,393 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:58,323 INFO ]: Checked inductivity of 289 backedges. 137 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:58,323 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:52:58,323 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:52:58,330 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:52:58,399 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:52:58,399 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:52:58,404 INFO ]: Computing forward predicates... [2018-06-24 20:52:59,023 INFO ]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:52:59,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:52:59,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 55 [2018-06-24 20:52:59,042 INFO ]: Interpolant automaton has 55 states [2018-06-24 20:52:59,042 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-24 20:52:59,042 INFO ]: CoverageRelationStatistics Valid=686, Invalid=2284, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:52:59,043 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 55 states. [2018-06-24 20:52:59,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:52:59,526 INFO ]: Finished difference Result 41 states and 42 transitions. [2018-06-24 20:52:59,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:52:59,526 INFO ]: Start accepts. Automaton has 55 states. Word has length 39 [2018-06-24 20:52:59,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:52:59,527 INFO ]: With dead ends: 41 [2018-06-24 20:52:59,527 INFO ]: Without dead ends: 41 [2018-06-24 20:52:59,527 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1485, Invalid=3627, Unknown=0, NotChecked=0, Total=5112 [2018-06-24 20:52:59,527 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:52:59,528 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:52:59,528 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:52:59,529 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-24 20:52:59,529 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-06-24 20:52:59,529 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:52:59,529 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-24 20:52:59,529 INFO ]: Interpolant automaton has 55 states. [2018-06-24 20:52:59,529 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-24 20:52:59,529 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:52:59,529 INFO ]: Found error trace [2018-06-24 20:52:59,529 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2018-06-24 20:52:59,529 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:52:59,529 INFO ]: Analyzing trace with hash 844927622, now seen corresponding path program 49 times [2018-06-24 20:52:59,529 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:52:59,529 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:52:59,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:59,530 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:52:59,530 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:52:59,543 INFO ]: Conjunction of SSA is unsat Received shutdown request... [2018-06-24 20:53:00,431 WARN ]: Verification canceled [2018-06-24 20:53:00,434 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:53:00,436 WARN ]: Timeout [2018-06-24 20:53:00,436 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:53:00 BasicIcfg [2018-06-24 20:53:00,436 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:53:00,437 INFO ]: Toolchain (without parser) took 56929.09 ms. Allocated memory was 307.8 MB in the beginning and 828.4 MB in the end (delta: 520.6 MB). Free memory was 263.1 MB in the beginning and 621.3 MB in the end (delta: -358.2 MB). Peak memory consumption was 162.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:00,438 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-24 20:53:00,438 INFO ]: ChcToBoogie took 64.45 ms. Allocated memory is still 307.8 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:00,438 INFO ]: Boogie Preprocessor took 39.94 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:00,439 INFO ]: RCFGBuilder took 334.26 ms. Allocated memory is still 307.8 MB. Free memory was 259.2 MB in the beginning and 249.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:00,439 INFO ]: BlockEncodingV2 took 117.56 ms. Allocated memory is still 307.8 MB. Free memory was 249.1 MB in the beginning and 245.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:00,439 INFO ]: TraceAbstraction took 56364.06 ms. Allocated memory was 307.8 MB in the beginning and 828.4 MB in the end (delta: 520.6 MB). Free memory was 245.1 MB in the beginning and 621.3 MB in the end (delta: -376.2 MB). Peak memory consumption was 144.5 MB. Max. memory is 3.6 GB. [2018-06-24 20:53:00,449 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 19 edges - StatisticsResult: Encoded RCFG 7 locations, 11 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 64.45 ms. Allocated memory is still 307.8 MB. Free memory was 263.1 MB in the beginning and 261.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 39.94 ms. Allocated memory is still 307.8 MB. Free memory was 261.1 MB in the beginning and 259.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 334.26 ms. Allocated memory is still 307.8 MB. Free memory was 259.2 MB in the beginning and 249.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 117.56 ms. Allocated memory is still 307.8 MB. Free memory was 249.1 MB in the beginning and 245.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 56364.06 ms. Allocated memory was 307.8 MB in the beginning and 828.4 MB in the end (delta: 520.6 MB). Free memory was 245.1 MB in the beginning and 621.3 MB in the end (delta: -376.2 MB). Peak memory consumption was 144.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 41 with TraceHistMax 17, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while NestedInterpolantsBuilder was constructing predicates for 39 interpolants. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 56.3s OverallTime, 55 OverallIterations, 17 TraceHistogramMax, 16.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 280 SDtfs, 344 SDslu, 2792 SDs, 0 SdLazy, 13615 SolverSat, 1656 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2661 GetRequests, 734 SyntacticMatches, 109 SemanticMatches, 1818 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16417 ImplicationChecksByTransitivity, 39.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=52, 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.2s AutomataMinimizationTime, 54 MinimizatonAttempts, 171 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 33.5s InterpolantComputationTime, 2332 NumberOfCodeBlocks, 2332 NumberOfCodeBlocksAsserted, 237 NumberOfCheckSat, 2227 ConstructedInterpolants, 0 QuantifiedInterpolants, 370271 SizeOfPredicates, 316 NumberOfNonLiveVariables, 18289 ConjunctsInSsa, 4242 ConjunctsInUnsatCore, 105 InterpolantComputations, 6 PerfectInterpolantSequences, 3588/10407 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-53-00-463.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-53-00-463.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-53-00-463.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/nested-while_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-53-00-463.csv Completed graceful shutdown