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/loop2_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-14921ce [2018-06-24 20:49:23,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-24 20:49:23,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-24 20:49:23,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-24 20:49:23,610 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-24 20:49:23,611 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-24 20:49:23,612 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-24 20:49:23,614 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-24 20:49:23,616 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-24 20:49:23,617 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-24 20:49:23,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-24 20:49:23,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-24 20:49:23,619 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-24 20:49:23,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-24 20:49:23,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-24 20:49:23,625 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-24 20:49:23,635 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-24 20:49:23,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-24 20:49:23,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-24 20:49:23,646 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-24 20:49:23,647 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-24 20:49:23,649 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-24 20:49:23,649 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-24 20:49:23,649 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-24 20:49:23,650 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-24 20:49:23,654 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-24 20:49:23,655 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-24 20:49:23,656 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-24 20:49:23,657 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-24 20:49:23,657 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-24 20:49:23,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-24 20:49:23,659 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-24 20:49:23,664 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-24 20:49:23,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-24 20:49:23,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-24 20:49:23,666 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:49:23,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-24 20:49:23,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-24 20:49:23,692 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-24 20:49:23,692 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-24 20:49:23,693 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-24 20:49:23,693 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-24 20:49:23,693 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-24 20:49:23,693 INFO L133 SettingsManager]: * Use SBE=true [2018-06-24 20:49:23,694 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-24 20:49:23,694 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-24 20:49:23,694 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-24 20:49:23,694 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-24 20:49:23,694 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-24 20:49:23,694 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-24 20:49:23,695 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-24 20:49:23,695 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-24 20:49:23,695 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-24 20:49:23,695 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-24 20:49:23,695 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-24 20:49:23,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-24 20:49:23,697 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-24 20:49:23,698 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-24 20:49:23,699 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-24 20:49:23,747 INFO ]: Repository-Root is: /tmp [2018-06-24 20:49:23,764 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-24 20:49:23,769 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-24 20:49:23,771 INFO ]: Initializing SmtParser... [2018-06-24 20:49:23,771 INFO ]: SmtParser initialized [2018-06-24 20:49:23,772 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 [2018-06-24 20:49:23,773 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:49:23,857 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 unknown [2018-06-24 20:49:24,053 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/loop2_merged_safe.c-1.smt2 [2018-06-24 20:49:24,057 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-24 20:49:24,063 INFO ]: Walking toolchain with 5 elements. [2018-06-24 20:49:24,063 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-24 20:49:24,063 INFO ]: Initializing ChcToBoogie... [2018-06-24 20:49:24,064 INFO ]: ChcToBoogie initialized [2018-06-24 20:49:24,067 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,120 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24 Unit [2018-06-24 20:49:24,120 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-24 20:49:24,121 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-24 20:49:24,121 INFO ]: Initializing Boogie Preprocessor... [2018-06-24 20:49:24,121 INFO ]: Boogie Preprocessor initialized [2018-06-24 20:49:24,142 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,142 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,147 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,148 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,150 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,156 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,157 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,158 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-24 20:49:24,159 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-24 20:49:24,159 INFO ]: Initializing RCFGBuilder... [2018-06-24 20:49:24,159 INFO ]: RCFGBuilder initialized [2018-06-24 20:49:24,160 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-24 20:49:24,175 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-24 20:49:24,175 INFO ]: Found specification of procedure gotoProc [2018-06-24 20:49:24,175 INFO ]: Found implementation of procedure gotoProc [2018-06-24 20:49:24,175 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-24 20:49:24,176 INFO ]: Found specification of procedure Ultimate.START [2018-06-24 20:49:24,176 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:49:24,459 INFO ]: Using library mode [2018-06-24 20:49:24,460 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:49:24 BoogieIcfgContainer [2018-06-24 20:49:24,460 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-24 20:49:24,460 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-24 20:49:24,460 INFO ]: Initializing BlockEncodingV2... [2018-06-24 20:49:24,461 INFO ]: BlockEncodingV2 initialized [2018-06-24 20:49:24,462 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:49:24" (1/1) ... [2018-06-24 20:49:24,480 INFO ]: Initial Icfg 13 locations, 17 edges [2018-06-24 20:49:24,481 INFO ]: Using Remove infeasible edges [2018-06-24 20:49:24,482 INFO ]: Using Maximize final states [2018-06-24 20:49:24,482 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-24 20:49:24,482 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-24 20:49:24,487 INFO ]: Using Remove sink states [2018-06-24 20:49:24,489 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-24 20:49:24,489 INFO ]: Using Use SBE [2018-06-24 20:49:24,502 INFO ]: SBE split 0 edges [2018-06-24 20:49:24,515 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-24 20:49:24,522 INFO ]: 0 new accepting states [2018-06-24 20:49:24,631 INFO ]: Removed 12 edges and 4 locations by large block encoding [2018-06-24 20:49:24,633 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:49:24,634 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-24 20:49:24,634 INFO ]: 0 new accepting states [2018-06-24 20:49:24,635 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-24 20:49:24,635 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-24 20:49:24,635 INFO ]: Encoded RCFG 7 locations, 11 edges [2018-06-24 20:49:24,636 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:49:24 BasicIcfg [2018-06-24 20:49:24,636 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-24 20:49:24,637 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-24 20:49:24,637 INFO ]: Initializing TraceAbstraction... [2018-06-24 20:49:24,640 INFO ]: TraceAbstraction initialized [2018-06-24 20:49:24,640 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 24.06 08:49:24" (1/4) ... [2018-06-24 20:49:24,641 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0b53fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 24.06 08:49:24, skipping insertion in model container [2018-06-24 20:49:24,641 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 24.06 08:49:24" (2/4) ... [2018-06-24 20:49:24,641 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0b53fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.06 08:49:24, skipping insertion in model container [2018-06-24 20:49:24,641 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.06 08:49:24" (3/4) ... [2018-06-24 20:49:24,641 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0b53fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:49:24, skipping insertion in model container [2018-06-24 20:49:24,641 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 24.06 08:49:24" (4/4) ... [2018-06-24 20:49:24,644 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-24 20:49:24,653 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-24 20:49:24,662 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-24 20:49:24,698 INFO ]: Using default assertion order modulation [2018-06-24 20:49:24,698 INFO ]: Interprodecural is true [2018-06-24 20:49:24,698 INFO ]: Hoare is false [2018-06-24 20:49:24,698 INFO ]: Compute interpolants for FPandBP [2018-06-24 20:49:24,698 INFO ]: Backedges is TWOTRACK [2018-06-24 20:49:24,698 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-24 20:49:24,698 INFO ]: Difference is false [2018-06-24 20:49:24,699 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-24 20:49:24,699 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-24 20:49:24,709 INFO ]: Start isEmpty. Operand 7 states. [2018-06-24 20:49:24,719 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:49:24,719 INFO ]: Found error trace [2018-06-24 20:49:24,720 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:49:24,720 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:24,724 INFO ]: Analyzing trace with hash 32019107, now seen corresponding path program 1 times [2018-06-24 20:49:24,725 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:24,726 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:24,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:24,758 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:24,758 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:24,805 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:24,887 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:49:24,888 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:49:24,888 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:49:24,890 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:49:24,903 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:49:24,904 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:49:24,907 INFO ]: Start difference. First operand 7 states. Second operand 3 states. [2018-06-24 20:49:24,960 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:24,960 INFO ]: Finished difference Result 8 states and 12 transitions. [2018-06-24 20:49:24,961 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:49:24,962 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:49:24,962 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:24,973 INFO ]: With dead ends: 8 [2018-06-24 20:49:24,973 INFO ]: Without dead ends: 8 [2018-06-24 20:49:24,975 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:49:24,992 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:49:25,014 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:49:25,015 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:49:25,018 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 20:49:25,019 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 5 [2018-06-24 20:49:25,020 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:25,020 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 20:49:25,020 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:49:25,020 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 20:49:25,021 INFO ]: Finished isEmpty. Found accepting run of length 6 [2018-06-24 20:49:25,021 INFO ]: Found error trace [2018-06-24 20:49:25,021 INFO ]: trace histogram [1, 1, 1, 1, 1] [2018-06-24 20:49:25,021 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:25,021 INFO ]: Analyzing trace with hash 32078689, now seen corresponding path program 1 times [2018-06-24 20:49:25,021 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:25,021 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:25,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,022 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:25,022 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,029 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,103 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:49:25,103 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:49:25,103 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:49:25,105 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:49:25,105 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:49:25,105 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:49:25,105 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2018-06-24 20:49:25,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:25,201 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-24 20:49:25,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:49:25,201 INFO ]: Start accepts. Automaton has 3 states. Word has length 5 [2018-06-24 20:49:25,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:25,202 INFO ]: With dead ends: 9 [2018-06-24 20:49:25,202 INFO ]: Without dead ends: 9 [2018-06-24 20:49:25,203 INFO ]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:49:25,203 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:49:25,204 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 20:49:25,204 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:49:25,204 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 20:49:25,204 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 5 [2018-06-24 20:49:25,204 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:25,204 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 20:49:25,204 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:49:25,204 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 20:49:25,205 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:49:25,205 INFO ]: Found error trace [2018-06-24 20:49:25,205 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:49:25,206 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:25,207 INFO ]: Analyzing trace with hash 990365786, now seen corresponding path program 1 times [2018-06-24 20:49:25,207 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:25,207 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:25,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,207 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:25,207 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,219 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,308 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:49:25,308 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:49:25,308 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-06-24 20:49:25,308 INFO ]: Interpolant automaton has 3 states [2018-06-24 20:49:25,308 INFO ]: Constructing interpolant automaton starting with 3 interpolants. [2018-06-24 20:49:25,308 INFO ]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-06-24 20:49:25,309 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 3 states. [2018-06-24 20:49:25,354 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:25,354 INFO ]: Finished difference Result 9 states and 13 transitions. [2018-06-24 20:49:25,355 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:49:25,355 INFO ]: Start accepts. Automaton has 3 states. Word has length 6 [2018-06-24 20:49:25,355 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:25,355 INFO ]: With dead ends: 9 [2018-06-24 20:49:25,355 INFO ]: Without dead ends: 9 [2018-06-24 20:49:25,355 INFO ]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 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:49:25,356 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:49:25,357 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-06-24 20:49:25,357 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:49:25,357 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-06-24 20:49:25,357 INFO ]: Start accepts. Automaton has 8 states and 12 transitions. Word has length 6 [2018-06-24 20:49:25,357 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:25,357 INFO ]: Abstraction has 8 states and 12 transitions. [2018-06-24 20:49:25,357 INFO ]: Interpolant automaton has 3 states. [2018-06-24 20:49:25,357 INFO ]: Start isEmpty. Operand 8 states and 12 transitions. [2018-06-24 20:49:25,357 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:49:25,357 INFO ]: Found error trace [2018-06-24 20:49:25,358 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:49:25,358 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:25,358 INFO ]: Analyzing trace with hash 992510738, now seen corresponding path program 1 times [2018-06-24 20:49:25,358 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:25,358 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:25,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,359 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:25,359 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,375 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,504 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:49:25,505 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:25,505 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:25,512 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:25,545 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,553 INFO ]: Computing forward predicates... [2018-06-24 20:49:25,624 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:49:25,656 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-24 20:49:25,656 INFO ]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-06-24 20:49:25,656 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:49:25,657 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:49:25,657 INFO ]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:49:25,657 INFO ]: Start difference. First operand 8 states and 12 transitions. Second operand 4 states. [2018-06-24 20:49:25,794 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:25,794 INFO ]: Finished difference Result 10 states and 14 transitions. [2018-06-24 20:49:25,796 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-06-24 20:49:25,796 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-24 20:49:25,796 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:25,797 INFO ]: With dead ends: 10 [2018-06-24 20:49:25,797 INFO ]: Without dead ends: 8 [2018-06-24 20:49:25,797 INFO ]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:49:25,797 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:49:25,798 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:49:25,798 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:49:25,798 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-06-24 20:49:25,798 INFO ]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 6 [2018-06-24 20:49:25,798 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:25,799 INFO ]: Abstraction has 8 states and 11 transitions. [2018-06-24 20:49:25,799 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:49:25,799 INFO ]: Start isEmpty. Operand 8 states and 11 transitions. [2018-06-24 20:49:25,799 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-24 20:49:25,799 INFO ]: Found error trace [2018-06-24 20:49:25,799 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-24 20:49:25,799 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:25,799 INFO ]: Analyzing trace with hash 994357780, now seen corresponding path program 1 times [2018-06-24 20:49:25,799 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:25,799 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:25,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:25,800 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:25,820 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,887 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:49:25,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:25,887 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:49:25,897 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:25,932 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:25,934 INFO ]: Computing forward predicates... [2018-06-24 20:49:25,984 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:49:26,003 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:26,003 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-06-24 20:49:26,004 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:49:26,004 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:49:26,004 INFO ]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:49:26,004 INFO ]: Start difference. First operand 8 states and 11 transitions. Second operand 6 states. [2018-06-24 20:49:26,125 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:26,125 INFO ]: Finished difference Result 10 states and 13 transitions. [2018-06-24 20:49:26,125 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:49:26,125 INFO ]: Start accepts. Automaton has 6 states. Word has length 6 [2018-06-24 20:49:26,125 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:26,126 INFO ]: With dead ends: 10 [2018-06-24 20:49:26,126 INFO ]: Without dead ends: 8 [2018-06-24 20:49:26,126 INFO ]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:49:26,126 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:49:26,127 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:49:26,127 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:49:26,128 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-06-24 20:49:26,128 INFO ]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-06-24 20:49:26,128 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:26,128 INFO ]: Abstraction has 8 states and 10 transitions. [2018-06-24 20:49:26,128 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:49:26,128 INFO ]: Start isEmpty. Operand 8 states and 10 transitions. [2018-06-24 20:49:26,128 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:49:26,128 INFO ]: Found error trace [2018-06-24 20:49:26,128 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:26,128 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:26,128 INFO ]: Analyzing trace with hash 636486715, now seen corresponding path program 1 times [2018-06-24 20:49:26,128 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:26,128 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:26,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,129 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:26,129 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,146 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:26,229 INFO ]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-24 20:49:26,230 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-24 20:49:26,230 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-24 20:49:26,230 INFO ]: Interpolant automaton has 4 states [2018-06-24 20:49:26,230 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-24 20:49:26,230 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-24 20:49:26,230 INFO ]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2018-06-24 20:49:26,357 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:26,357 INFO ]: Finished difference Result 11 states and 14 transitions. [2018-06-24 20:49:26,357 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-24 20:49:26,358 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-24 20:49:26,358 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:26,358 INFO ]: With dead ends: 11 [2018-06-24 20:49:26,358 INFO ]: Without dead ends: 8 [2018-06-24 20:49:26,358 INFO ]: 0 DeclaredPredicates, 6 GetRequests, 3 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:49:26,358 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-24 20:49:26,359 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-24 20:49:26,359 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-24 20:49:26,359 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-24 20:49:26,359 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 7 [2018-06-24 20:49:26,359 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:26,359 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-24 20:49:26,359 INFO ]: Interpolant automaton has 4 states. [2018-06-24 20:49:26,360 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-24 20:49:26,360 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-24 20:49:26,360 INFO ]: Found error trace [2018-06-24 20:49:26,360 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:26,360 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:26,360 INFO ]: Analyzing trace with hash 779632470, now seen corresponding path program 1 times [2018-06-24 20:49:26,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:26,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:26,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,361 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:26,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,393 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:26,476 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:49:26,476 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:26,476 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:49:26,482 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:26,498 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:26,500 INFO ]: Computing forward predicates... [2018-06-24 20:49:26,538 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:49:26,558 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:26,558 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-24 20:49:26,558 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:49:26,558 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:49:26,558 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:49:26,558 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 7 states. [2018-06-24 20:49:26,666 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:26,666 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-24 20:49:26,667 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-24 20:49:26,667 INFO ]: Start accepts. Automaton has 7 states. Word has length 7 [2018-06-24 20:49:26,667 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:26,668 INFO ]: With dead ends: 13 [2018-06-24 20:49:26,668 INFO ]: Without dead ends: 13 [2018-06-24 20:49:26,669 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:49:26,669 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:49:26,671 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-24 20:49:26,671 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:49:26,671 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-24 20:49:26,671 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-06-24 20:49:26,671 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:26,671 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-24 20:49:26,671 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:49:26,672 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-24 20:49:26,672 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:49:26,672 INFO ]: Found error trace [2018-06-24 20:49:26,672 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:26,672 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:26,672 INFO ]: Analyzing trace with hash -1601278785, now seen corresponding path program 2 times [2018-06-24 20:49:26,672 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:26,672 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:26,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,673 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:26,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:26,685 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,062 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,062 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:27,062 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:49:27,070 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:27,109 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:27,109 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,111 INFO ]: Computing forward predicates... [2018-06-24 20:49:27,172 INFO ]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,192 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:27,192 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-06-24 20:49:27,192 INFO ]: Interpolant automaton has 7 states [2018-06-24 20:49:27,192 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-24 20:49:27,192 INFO ]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-06-24 20:49:27,192 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 7 states. [2018-06-24 20:49:27,317 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:27,317 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-24 20:49:27,317 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:49:27,317 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-24 20:49:27,317 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:27,317 INFO ]: With dead ends: 12 [2018-06-24 20:49:27,317 INFO ]: Without dead ends: 9 [2018-06-24 20:49:27,318 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:49:27,318 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-24 20:49:27,319 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-24 20:49:27,319 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-24 20:49:27,319 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-24 20:49:27,319 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-06-24 20:49:27,319 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:27,319 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-24 20:49:27,319 INFO ]: Interpolant automaton has 7 states. [2018-06-24 20:49:27,319 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-24 20:49:27,319 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-24 20:49:27,319 INFO ]: Found error trace [2018-06-24 20:49:27,319 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:27,319 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:27,320 INFO ]: Analyzing trace with hash -1581884844, now seen corresponding path program 1 times [2018-06-24 20:49:27,320 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:27,320 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:27,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,320 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:27,320 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,332 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,368 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,368 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:27,368 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:49:27,376 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:27,390 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,392 INFO ]: Computing forward predicates... [2018-06-24 20:49:27,410 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,429 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:27,429 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-24 20:49:27,429 INFO ]: Interpolant automaton has 6 states [2018-06-24 20:49:27,429 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-24 20:49:27,429 INFO ]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-06-24 20:49:27,429 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 6 states. [2018-06-24 20:49:27,470 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:27,470 INFO ]: Finished difference Result 10 states and 11 transitions. [2018-06-24 20:49:27,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-24 20:49:27,471 INFO ]: Start accepts. Automaton has 6 states. Word has length 8 [2018-06-24 20:49:27,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:27,471 INFO ]: With dead ends: 10 [2018-06-24 20:49:27,471 INFO ]: Without dead ends: 10 [2018-06-24 20:49:27,471 INFO ]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:49:27,471 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-24 20:49:27,472 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-24 20:49:27,472 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-24 20:49:27,473 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-24 20:49:27,473 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-06-24 20:49:27,473 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:27,473 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-24 20:49:27,473 INFO ]: Interpolant automaton has 6 states. [2018-06-24 20:49:27,473 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-24 20:49:27,473 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-24 20:49:27,473 INFO ]: Found error trace [2018-06-24 20:49:27,473 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:27,473 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:27,473 INFO ]: Analyzing trace with hash -1793871487, now seen corresponding path program 2 times [2018-06-24 20:49:27,473 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:27,473 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:27,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,474 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:27,474 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,504 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,667 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,667 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:27,667 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:49:27,673 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:27,691 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:27,691 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:27,693 INFO ]: Computing forward predicates... [2018-06-24 20:49:27,751 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:27,769 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:27,769 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-24 20:49:27,769 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:49:27,770 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:49:27,770 INFO ]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:49:27,770 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 10 states. [2018-06-24 20:49:27,902 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:27,903 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-24 20:49:27,903 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:49:27,903 INFO ]: Start accepts. Automaton has 10 states. Word has length 9 [2018-06-24 20:49:27,903 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:27,903 INFO ]: With dead ends: 16 [2018-06-24 20:49:27,903 INFO ]: Without dead ends: 16 [2018-06-24 20:49:27,903 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:49:27,903 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:49:27,905 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-24 20:49:27,905 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:49:27,905 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-24 20:49:27,905 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-06-24 20:49:27,905 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:27,905 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-24 20:49:27,905 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:49:27,905 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-24 20:49:27,905 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:49:27,905 INFO ]: Found error trace [2018-06-24 20:49:27,905 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:27,906 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:27,906 INFO ]: Analyzing trace with hash 224477172, now seen corresponding path program 3 times [2018-06-24 20:49:27,906 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:27,906 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:27,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,906 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:27,906 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:27,918 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,000 INFO ]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:28,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:28,000 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:49:28,008 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:28,053 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-24 20:49:28,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,055 INFO ]: Computing forward predicates... [2018-06-24 20:49:28,090 INFO ]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:28,110 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:28,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-06-24 20:49:28,110 INFO ]: Interpolant automaton has 9 states [2018-06-24 20:49:28,111 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-24 20:49:28,111 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-24 20:49:28,111 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 9 states. [2018-06-24 20:49:28,207 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:28,207 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-24 20:49:28,208 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:49:28,208 INFO ]: Start accepts. Automaton has 9 states. Word has length 10 [2018-06-24 20:49:28,208 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:28,208 INFO ]: With dead ends: 15 [2018-06-24 20:49:28,208 INFO ]: Without dead ends: 11 [2018-06-24 20:49:28,208 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:49:28,208 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-24 20:49:28,209 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-24 20:49:28,209 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-24 20:49:28,210 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-24 20:49:28,210 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-06-24 20:49:28,210 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:28,210 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-24 20:49:28,210 INFO ]: Interpolant automaton has 9 states. [2018-06-24 20:49:28,210 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-24 20:49:28,210 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-24 20:49:28,210 INFO ]: Found error trace [2018-06-24 20:49:28,210 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:28,210 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:28,210 INFO ]: Analyzing trace with hash 825689343, now seen corresponding path program 4 times [2018-06-24 20:49:28,210 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:28,210 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:28,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:28,211 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:28,211 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:28,221 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,558 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:28,558 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:28,558 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:49:28,565 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:28,594 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:28,594 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,596 INFO ]: Computing forward predicates... [2018-06-24 20:49:28,676 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:28,699 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:28,699 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-06-24 20:49:28,699 INFO ]: Interpolant automaton has 8 states [2018-06-24 20:49:28,699 INFO ]: Constructing interpolant automaton starting with 8 interpolants. [2018-06-24 20:49:28,700 INFO ]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-06-24 20:49:28,700 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 8 states. [2018-06-24 20:49:28,739 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:28,739 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-24 20:49:28,739 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-24 20:49:28,739 INFO ]: Start accepts. Automaton has 8 states. Word has length 10 [2018-06-24 20:49:28,740 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:28,740 INFO ]: With dead ends: 12 [2018-06-24 20:49:28,740 INFO ]: Without dead ends: 12 [2018-06-24 20:49:28,740 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:49:28,740 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-24 20:49:28,742 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-24 20:49:28,742 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-24 20:49:28,742 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-24 20:49:28,742 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-24 20:49:28,742 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:28,742 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-24 20:49:28,742 INFO ]: Interpolant automaton has 8 states. [2018-06-24 20:49:28,742 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-24 20:49:28,742 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-24 20:49:28,742 INFO ]: Found error trace [2018-06-24 20:49:28,742 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:28,742 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:28,743 INFO ]: Analyzing trace with hash -173515722, now seen corresponding path program 5 times [2018-06-24 20:49:28,743 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:28,743 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:28,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:28,743 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:28,743 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:28,756 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,855 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:28,855 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:28,855 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:49:28,862 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:28,894 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-24 20:49:28,894 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:28,896 INFO ]: Computing forward predicates... [2018-06-24 20:49:28,985 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:29,006 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:29,006 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-24 20:49:29,006 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:49:29,009 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:49:29,009 INFO ]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:49:29,009 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 13 states. [2018-06-24 20:49:29,162 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:29,162 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-24 20:49:29,162 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:49:29,162 INFO ]: Start accepts. Automaton has 13 states. Word has length 11 [2018-06-24 20:49:29,163 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:29,163 INFO ]: With dead ends: 19 [2018-06-24 20:49:29,163 INFO ]: Without dead ends: 19 [2018-06-24 20:49:29,163 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:49:29,163 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:49:29,165 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-24 20:49:29,165 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:49:29,165 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-24 20:49:29,165 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-06-24 20:49:29,165 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:29,165 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-24 20:49:29,166 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:49:29,166 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-24 20:49:29,166 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:49:29,166 INFO ]: Found error trace [2018-06-24 20:49:29,166 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:29,166 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:29,166 INFO ]: Analyzing trace with hash -1084101665, now seen corresponding path program 6 times [2018-06-24 20:49:29,166 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:29,166 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:29,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,167 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:29,167 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,178 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:29,284 INFO ]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:29,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:29,284 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:49:29,290 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:29,311 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-24 20:49:29,311 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:29,312 INFO ]: Computing forward predicates... [2018-06-24 20:49:29,357 INFO ]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:29,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:29,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-06-24 20:49:29,377 INFO ]: Interpolant automaton has 11 states [2018-06-24 20:49:29,377 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-24 20:49:29,377 INFO ]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-06-24 20:49:29,377 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 11 states. [2018-06-24 20:49:29,450 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:29,450 INFO ]: Finished difference Result 18 states and 20 transitions. [2018-06-24 20:49:29,450 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:49:29,450 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-24 20:49:29,450 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:29,451 INFO ]: With dead ends: 18 [2018-06-24 20:49:29,451 INFO ]: Without dead ends: 13 [2018-06-24 20:49:29,451 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:49:29,451 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-24 20:49:29,452 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-24 20:49:29,452 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-24 20:49:29,452 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-24 20:49:29,453 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-24 20:49:29,453 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:29,453 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-24 20:49:29,453 INFO ]: Interpolant automaton has 11 states. [2018-06-24 20:49:29,453 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-24 20:49:29,453 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-24 20:49:29,453 INFO ]: Found error trace [2018-06-24 20:49:29,453 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:29,453 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:29,453 INFO ]: Analyzing trace with hash 373606452, now seen corresponding path program 7 times [2018-06-24 20:49:29,453 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:29,453 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:29,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,454 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:29,454 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,463 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:29,627 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:29,627 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:29,627 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:49:29,645 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:29,669 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:29,671 INFO ]: Computing forward predicates... [2018-06-24 20:49:29,751 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:29,770 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:29,770 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-06-24 20:49:29,770 INFO ]: Interpolant automaton has 10 states [2018-06-24 20:49:29,770 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-24 20:49:29,770 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-24 20:49:29,770 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 10 states. [2018-06-24 20:49:29,851 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:29,851 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-24 20:49:29,851 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-24 20:49:29,851 INFO ]: Start accepts. Automaton has 10 states. Word has length 12 [2018-06-24 20:49:29,851 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:29,852 INFO ]: With dead ends: 14 [2018-06-24 20:49:29,852 INFO ]: Without dead ends: 14 [2018-06-24 20:49:29,852 INFO ]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:49:29,852 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-24 20:49:29,853 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-24 20:49:29,853 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-24 20:49:29,853 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-24 20:49:29,853 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-24 20:49:29,853 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:29,853 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-24 20:49:29,854 INFO ]: Interpolant automaton has 10 states. [2018-06-24 20:49:29,854 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-24 20:49:29,854 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-24 20:49:29,854 INFO ]: Found error trace [2018-06-24 20:49:29,854 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:29,854 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:29,854 INFO ]: Analyzing trace with hash -1303183455, now seen corresponding path program 8 times [2018-06-24 20:49:29,854 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:29,854 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:29,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,855 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:29,855 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:29,867 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:30,028 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:30,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:30,028 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:49:30,035 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:30,072 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:30,072 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:30,075 INFO ]: Computing forward predicates... [2018-06-24 20:49:30,242 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:30,261 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:30,261 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-24 20:49:30,261 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:49:30,261 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:49:30,261 INFO ]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:49:30,261 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 16 states. [2018-06-24 20:49:30,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:30,613 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-24 20:49:30,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:49:30,613 INFO ]: Start accepts. Automaton has 16 states. Word has length 13 [2018-06-24 20:49:30,613 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:30,613 INFO ]: With dead ends: 22 [2018-06-24 20:49:30,613 INFO ]: Without dead ends: 22 [2018-06-24 20:49:30,614 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:49:30,614 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:49:30,615 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-24 20:49:30,615 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:49:30,615 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-24 20:49:30,616 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-24 20:49:30,616 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:30,616 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-24 20:49:30,616 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:49:30,616 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-24 20:49:30,616 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:49:30,616 INFO ]: Found error trace [2018-06-24 20:49:30,616 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:30,616 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:30,616 INFO ]: Analyzing trace with hash -1744063020, now seen corresponding path program 9 times [2018-06-24 20:49:30,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:30,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:30,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:30,617 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:30,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:30,630 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:30,938 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:30,938 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:30,938 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:49:30,946 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:30,970 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-24 20:49:30,970 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:30,972 INFO ]: Computing forward predicates... [2018-06-24 20:49:31,231 INFO ]: Checked inductivity of 21 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:31,260 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:31,260 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-06-24 20:49:31,260 INFO ]: Interpolant automaton has 13 states [2018-06-24 20:49:31,260 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-24 20:49:31,260 INFO ]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-06-24 20:49:31,260 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 13 states. [2018-06-24 20:49:31,476 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:31,476 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-24 20:49:31,477 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:49:31,477 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-24 20:49:31,477 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:31,477 INFO ]: With dead ends: 21 [2018-06-24 20:49:31,477 INFO ]: Without dead ends: 15 [2018-06-24 20:49:31,477 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:49:31,477 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-24 20:49:31,478 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-24 20:49:31,478 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-24 20:49:31,479 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-24 20:49:31,479 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-06-24 20:49:31,479 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:31,479 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-24 20:49:31,479 INFO ]: Interpolant automaton has 13 states. [2018-06-24 20:49:31,479 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-24 20:49:31,479 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-24 20:49:31,479 INFO ]: Found error trace [2018-06-24 20:49:31,479 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:31,479 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:31,479 INFO ]: Analyzing trace with hash 495215647, now seen corresponding path program 10 times [2018-06-24 20:49:31,479 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:31,479 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:31,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:31,480 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:31,480 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:31,490 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:31,564 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:31,564 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:31,564 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:49:31,570 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:31,593 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:31,593 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:31,595 INFO ]: Computing forward predicates... [2018-06-24 20:49:31,620 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:31,646 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:31,646 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-06-24 20:49:31,647 INFO ]: Interpolant automaton has 12 states [2018-06-24 20:49:31,647 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-24 20:49:31,647 INFO ]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-06-24 20:49:31,647 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-06-24 20:49:31,717 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:31,717 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-24 20:49:31,717 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-24 20:49:31,717 INFO ]: Start accepts. Automaton has 12 states. Word has length 14 [2018-06-24 20:49:31,717 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:31,717 INFO ]: With dead ends: 16 [2018-06-24 20:49:31,717 INFO ]: Without dead ends: 16 [2018-06-24 20:49:31,718 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:49:31,718 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-24 20:49:31,719 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-24 20:49:31,719 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-24 20:49:31,719 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-24 20:49:31,719 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-24 20:49:31,720 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:31,720 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-24 20:49:31,720 INFO ]: Interpolant automaton has 12 states. [2018-06-24 20:49:31,720 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-24 20:49:31,720 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-24 20:49:31,720 INFO ]: Found error trace [2018-06-24 20:49:31,720 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:31,720 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:31,720 INFO ]: Analyzing trace with hash -1828265706, now seen corresponding path program 11 times [2018-06-24 20:49:31,720 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:31,720 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:31,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:31,721 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:31,721 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:31,734 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:31,888 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:31,888 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:31,888 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:49:31,896 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:31,923 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-24 20:49:31,923 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:31,926 INFO ]: Computing forward predicates... [2018-06-24 20:49:32,008 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:32,028 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:32,029 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-24 20:49:32,029 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:49:32,029 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:49:32,029 INFO ]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:49:32,029 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 19 states. [2018-06-24 20:49:32,240 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:32,240 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-24 20:49:32,240 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:49:32,240 INFO ]: Start accepts. Automaton has 19 states. Word has length 15 [2018-06-24 20:49:32,240 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:32,240 INFO ]: With dead ends: 25 [2018-06-24 20:49:32,240 INFO ]: Without dead ends: 25 [2018-06-24 20:49:32,241 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:49:32,241 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:49:32,242 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-24 20:49:32,242 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:49:32,243 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-24 20:49:32,243 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-24 20:49:32,243 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:32,243 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-24 20:49:32,243 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:49:32,243 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-24 20:49:32,243 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:49:32,243 INFO ]: Found error trace [2018-06-24 20:49:32,243 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:32,243 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:32,244 INFO ]: Analyzing trace with hash -841743617, now seen corresponding path program 12 times [2018-06-24 20:49:32,244 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:32,244 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:32,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:32,244 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:32,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:32,255 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:32,482 INFO ]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:32,482 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:32,482 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:49:32,488 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:32,517 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-24 20:49:32,517 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:32,519 INFO ]: Computing forward predicates... [2018-06-24 20:49:32,555 INFO ]: Checked inductivity of 31 backedges. 15 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:32,575 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:32,575 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-06-24 20:49:32,575 INFO ]: Interpolant automaton has 15 states [2018-06-24 20:49:32,575 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-24 20:49:32,575 INFO ]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-06-24 20:49:32,575 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 15 states. [2018-06-24 20:49:32,695 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:32,695 INFO ]: Finished difference Result 24 states and 26 transitions. [2018-06-24 20:49:32,695 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:49:32,695 INFO ]: Start accepts. Automaton has 15 states. Word has length 16 [2018-06-24 20:49:32,695 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:32,695 INFO ]: With dead ends: 24 [2018-06-24 20:49:32,695 INFO ]: Without dead ends: 17 [2018-06-24 20:49:32,696 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:49:32,696 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-24 20:49:32,697 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-24 20:49:32,697 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-24 20:49:32,697 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-24 20:49:32,697 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-06-24 20:49:32,697 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:32,698 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-24 20:49:32,698 INFO ]: Interpolant automaton has 15 states. [2018-06-24 20:49:32,698 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-24 20:49:32,698 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-24 20:49:32,698 INFO ]: Found error trace [2018-06-24 20:49:32,698 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:32,698 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:32,698 INFO ]: Analyzing trace with hash -143581676, now seen corresponding path program 13 times [2018-06-24 20:49:32,698 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:32,698 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:32,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:32,699 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:32,699 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:32,709 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:32,875 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:32,875 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:32,876 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:49:32,881 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:32,908 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:32,910 INFO ]: Computing forward predicates... [2018-06-24 20:49:32,939 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:32,958 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:32,958 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-06-24 20:49:32,958 INFO ]: Interpolant automaton has 14 states [2018-06-24 20:49:32,958 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-24 20:49:32,958 INFO ]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-06-24 20:49:32,958 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 14 states. [2018-06-24 20:49:33,131 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:33,131 INFO ]: Finished difference Result 18 states and 19 transitions. [2018-06-24 20:49:33,131 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-24 20:49:33,131 INFO ]: Start accepts. Automaton has 14 states. Word has length 16 [2018-06-24 20:49:33,131 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:33,132 INFO ]: With dead ends: 18 [2018-06-24 20:49:33,132 INFO ]: Without dead ends: 18 [2018-06-24 20:49:33,132 INFO ]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=240, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:49:33,132 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-24 20:49:33,133 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-24 20:49:33,133 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-24 20:49:33,134 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-24 20:49:33,134 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-24 20:49:33,134 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:33,134 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-24 20:49:33,134 INFO ]: Interpolant automaton has 14 states. [2018-06-24 20:49:33,134 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-24 20:49:33,134 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-24 20:49:33,134 INFO ]: Found error trace [2018-06-24 20:49:33,134 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:33,134 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:33,137 INFO ]: Analyzing trace with hash -156146239, now seen corresponding path program 14 times [2018-06-24 20:49:33,137 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:33,137 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:33,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:33,137 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:33,137 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:33,155 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:33,366 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:33,366 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:33,366 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:49:33,372 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:33,402 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:33,402 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:33,405 INFO ]: Computing forward predicates... [2018-06-24 20:49:33,583 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:33,602 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:33,602 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-24 20:49:33,602 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:49:33,602 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:49:33,602 INFO ]: CoverageRelationStatistics Valid=48, Invalid=414, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:49:33,602 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 22 states. [2018-06-24 20:49:33,884 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:33,884 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-24 20:49:33,884 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:49:33,884 INFO ]: Start accepts. Automaton has 22 states. Word has length 17 [2018-06-24 20:49:33,884 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:33,884 INFO ]: With dead ends: 28 [2018-06-24 20:49:33,884 INFO ]: Without dead ends: 28 [2018-06-24 20:49:33,885 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:49:33,885 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:49:33,886 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-24 20:49:33,886 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:49:33,886 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-24 20:49:33,886 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-06-24 20:49:33,887 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:33,887 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-24 20:49:33,887 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:49:33,887 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-24 20:49:33,887 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:49:33,887 INFO ]: Found error trace [2018-06-24 20:49:33,887 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:33,887 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:33,887 INFO ]: Analyzing trace with hash -545647692, now seen corresponding path program 15 times [2018-06-24 20:49:33,887 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:33,887 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:33,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:33,888 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:33,888 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:33,900 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:34,088 INFO ]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:34,088 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:34,088 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:49:34,096 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:34,163 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-24 20:49:34,163 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:34,167 INFO ]: Computing forward predicates... [2018-06-24 20:49:34,224 INFO ]: Checked inductivity of 43 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:34,243 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:34,243 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-06-24 20:49:34,243 INFO ]: Interpolant automaton has 17 states [2018-06-24 20:49:34,243 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-24 20:49:34,243 INFO ]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-06-24 20:49:34,243 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 17 states. [2018-06-24 20:49:34,392 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:34,392 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-24 20:49:34,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:49:34,392 INFO ]: Start accepts. Automaton has 17 states. Word has length 18 [2018-06-24 20:49:34,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:34,392 INFO ]: With dead ends: 27 [2018-06-24 20:49:34,392 INFO ]: Without dead ends: 19 [2018-06-24 20:49:34,393 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:49:34,393 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-24 20:49:34,394 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-24 20:49:34,394 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-24 20:49:34,394 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-24 20:49:34,394 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-24 20:49:34,394 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:34,394 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-24 20:49:34,394 INFO ]: Interpolant automaton has 17 states. [2018-06-24 20:49:34,394 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-24 20:49:34,395 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-24 20:49:34,395 INFO ]: Found error trace [2018-06-24 20:49:34,395 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:34,395 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:34,395 INFO ]: Analyzing trace with hash -377464001, now seen corresponding path program 16 times [2018-06-24 20:49:34,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:34,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:34,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:34,397 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:34,397 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:34,408 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:35,136 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:35,136 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:35,136 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:49:35,143 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:35,173 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:35,173 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:35,175 INFO ]: Computing forward predicates... [2018-06-24 20:49:35,227 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:35,258 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:35,258 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-06-24 20:49:35,258 INFO ]: Interpolant automaton has 16 states [2018-06-24 20:49:35,258 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-24 20:49:35,258 INFO ]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-06-24 20:49:35,259 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-06-24 20:49:35,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:35,352 INFO ]: Finished difference Result 20 states and 21 transitions. [2018-06-24 20:49:35,353 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-24 20:49:35,353 INFO ]: Start accepts. Automaton has 16 states. Word has length 18 [2018-06-24 20:49:35,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:35,353 INFO ]: With dead ends: 20 [2018-06-24 20:49:35,353 INFO ]: Without dead ends: 20 [2018-06-24 20:49:35,353 INFO ]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:49:35,353 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-24 20:49:35,355 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-24 20:49:35,355 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-24 20:49:35,355 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-24 20:49:35,355 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-24 20:49:35,355 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:35,355 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-24 20:49:35,355 INFO ]: Interpolant automaton has 16 states. [2018-06-24 20:49:35,355 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-24 20:49:35,355 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-24 20:49:35,355 INFO ]: Found error trace [2018-06-24 20:49:35,355 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:35,355 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:35,356 INFO ]: Analyzing trace with hash 1183436278, now seen corresponding path program 17 times [2018-06-24 20:49:35,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:35,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:35,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:35,356 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:35,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:35,369 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:35,596 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:35,596 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:35,596 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:49:35,604 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:35,642 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-24 20:49:35,642 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:35,646 INFO ]: Computing forward predicates... [2018-06-24 20:49:35,803 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:35,834 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:35,834 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-24 20:49:35,835 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:49:35,835 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:49:35,835 INFO ]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:49:35,835 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 25 states. [2018-06-24 20:49:36,093 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:36,093 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-24 20:49:36,093 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:49:36,093 INFO ]: Start accepts. Automaton has 25 states. Word has length 19 [2018-06-24 20:49:36,093 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:36,093 INFO ]: With dead ends: 31 [2018-06-24 20:49:36,093 INFO ]: Without dead ends: 31 [2018-06-24 20:49:36,094 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:49:36,094 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:49:36,095 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-06-24 20:49:36,095 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:49:36,096 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-24 20:49:36,096 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-06-24 20:49:36,096 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:36,096 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-24 20:49:36,096 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:49:36,096 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-24 20:49:36,096 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:49:36,096 INFO ]: Found error trace [2018-06-24 20:49:36,096 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:36,096 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:36,096 INFO ]: Analyzing trace with hash -1968262625, now seen corresponding path program 18 times [2018-06-24 20:49:36,096 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:36,096 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:36,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:36,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:36,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:36,111 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:37,201 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:37,201 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:37,201 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) [2018-06-24 20:49:37,214 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:49:37,252 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-24 20:49:37,252 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:37,255 INFO ]: Computing forward predicates... [2018-06-24 20:49:37,302 INFO ]: Checked inductivity of 57 backedges. 28 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:37,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:37,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-06-24 20:49:37,321 INFO ]: Interpolant automaton has 19 states [2018-06-24 20:49:37,321 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-24 20:49:37,321 INFO ]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-06-24 20:49:37,322 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2018-06-24 20:49:37,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:37,490 INFO ]: Finished difference Result 30 states and 32 transitions. [2018-06-24 20:49:37,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:49:37,490 INFO ]: Start accepts. Automaton has 19 states. Word has length 20 [2018-06-24 20:49:37,490 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:37,490 INFO ]: With dead ends: 30 [2018-06-24 20:49:37,490 INFO ]: Without dead ends: 21 [2018-06-24 20:49:37,490 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:49:37,490 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-24 20:49:37,492 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-24 20:49:37,492 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-24 20:49:37,492 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-24 20:49:37,492 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-06-24 20:49:37,492 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:37,492 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-24 20:49:37,492 INFO ]: Interpolant automaton has 19 states. [2018-06-24 20:49:37,492 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-24 20:49:37,493 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-24 20:49:37,493 INFO ]: Found error trace [2018-06-24 20:49:37,493 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:37,493 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:37,493 INFO ]: Analyzing trace with hash -1049535500, now seen corresponding path program 19 times [2018-06-24 20:49:37,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:37,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:37,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:37,494 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:37,494 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:37,505 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:37,704 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:37,704 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:37,704 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:49:37,800 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:37,835 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:37,838 INFO ]: Computing forward predicates... [2018-06-24 20:49:37,861 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:37,887 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:37,887 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-06-24 20:49:37,887 INFO ]: Interpolant automaton has 18 states [2018-06-24 20:49:37,887 INFO ]: Constructing interpolant automaton starting with 18 interpolants. [2018-06-24 20:49:37,887 INFO ]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2018-06-24 20:49:37,888 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 18 states. [2018-06-24 20:49:38,009 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:38,009 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-24 20:49:38,009 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-24 20:49:38,010 INFO ]: Start accepts. Automaton has 18 states. Word has length 20 [2018-06-24 20:49:38,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:38,010 INFO ]: With dead ends: 22 [2018-06-24 20:49:38,010 INFO ]: Without dead ends: 22 [2018-06-24 20:49:38,010 INFO ]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=416, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:49:38,010 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-24 20:49:38,012 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-24 20:49:38,012 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-24 20:49:38,012 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-24 20:49:38,012 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-24 20:49:38,012 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:38,012 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-24 20:49:38,012 INFO ]: Interpolant automaton has 18 states. [2018-06-24 20:49:38,012 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-24 20:49:38,013 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-24 20:49:38,013 INFO ]: Found error trace [2018-06-24 20:49:38,013 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:38,013 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:38,013 INFO ]: Analyzing trace with hash 1824056289, now seen corresponding path program 20 times [2018-06-24 20:49:38,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:38,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:38,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:38,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:38,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:38,027 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:38,335 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:38,335 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:38,335 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:49:38,347 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:38,383 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:38,383 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:38,386 INFO ]: Computing forward predicates... [2018-06-24 20:49:38,584 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:38,603 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:38,603 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-24 20:49:38,603 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:49:38,603 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:49:38,603 INFO ]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:49:38,603 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 28 states. [2018-06-24 20:49:39,041 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:39,041 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-24 20:49:39,041 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:49:39,041 INFO ]: Start accepts. Automaton has 28 states. Word has length 21 [2018-06-24 20:49:39,041 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:39,041 INFO ]: With dead ends: 34 [2018-06-24 20:49:39,041 INFO ]: Without dead ends: 34 [2018-06-24 20:49:39,042 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1329, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:49:39,042 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:49:39,047 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-06-24 20:49:39,047 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:49:39,048 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-24 20:49:39,048 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-24 20:49:39,048 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:39,048 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-24 20:49:39,048 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:49:39,048 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-24 20:49:39,048 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:49:39,048 INFO ]: Found error trace [2018-06-24 20:49:39,048 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:39,048 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:39,048 INFO ]: Analyzing trace with hash 711088532, now seen corresponding path program 21 times [2018-06-24 20:49:39,048 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:39,048 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:39,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:39,049 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:39,049 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:39,066 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:39,316 INFO ]: Checked inductivity of 73 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:39,317 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:39,317 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:49:39,322 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:39,369 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-24 20:49:39,369 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:39,372 INFO ]: Computing forward predicates... [2018-06-24 20:49:39,403 INFO ]: Checked inductivity of 73 backedges. 36 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:39,434 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:39,434 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-06-24 20:49:39,434 INFO ]: Interpolant automaton has 21 states [2018-06-24 20:49:39,435 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-24 20:49:39,435 INFO ]: CoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2018-06-24 20:49:39,435 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 21 states. [2018-06-24 20:49:40,703 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:40,703 INFO ]: Finished difference Result 33 states and 35 transitions. [2018-06-24 20:49:40,703 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:49:40,703 INFO ]: Start accepts. Automaton has 21 states. Word has length 22 [2018-06-24 20:49:40,703 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:40,703 INFO ]: With dead ends: 33 [2018-06-24 20:49:40,703 INFO ]: Without dead ends: 23 [2018-06-24 20:49:40,704 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=695, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:49:40,704 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-24 20:49:40,705 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-24 20:49:40,705 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-24 20:49:40,705 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-24 20:49:40,705 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-06-24 20:49:40,705 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:40,705 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-24 20:49:40,705 INFO ]: Interpolant automaton has 21 states. [2018-06-24 20:49:40,705 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-24 20:49:40,706 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-24 20:49:40,706 INFO ]: Found error trace [2018-06-24 20:49:40,706 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:40,706 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:40,706 INFO ]: Analyzing trace with hash -873141665, now seen corresponding path program 22 times [2018-06-24 20:49:40,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:40,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:40,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:40,707 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:40,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:40,718 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:40,923 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:40,923 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:40,923 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:49:40,930 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:40,967 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:40,967 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:40,969 INFO ]: Computing forward predicates... [2018-06-24 20:49:41,035 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:41,054 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:41,054 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-06-24 20:49:41,054 INFO ]: Interpolant automaton has 20 states [2018-06-24 20:49:41,054 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-24 20:49:41,055 INFO ]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-06-24 20:49:41,055 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 20 states. [2018-06-24 20:49:41,172 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:41,172 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-24 20:49:41,173 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-24 20:49:41,173 INFO ]: Start accepts. Automaton has 20 states. Word has length 22 [2018-06-24 20:49:41,173 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:41,173 INFO ]: With dead ends: 24 [2018-06-24 20:49:41,173 INFO ]: Without dead ends: 24 [2018-06-24 20:49:41,173 INFO ]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=522, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:49:41,173 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-24 20:49:41,174 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-24 20:49:41,174 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-24 20:49:41,175 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-24 20:49:41,175 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-24 20:49:41,175 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:41,175 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-24 20:49:41,175 INFO ]: Interpolant automaton has 20 states. [2018-06-24 20:49:41,175 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-24 20:49:41,175 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-24 20:49:41,175 INFO ]: Found error trace [2018-06-24 20:49:41,175 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:41,175 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:41,175 INFO ]: Analyzing trace with hash -1297669418, now seen corresponding path program 23 times [2018-06-24 20:49:41,176 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:41,176 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:41,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:41,176 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:41,176 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:41,191 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:41,756 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:41,757 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:41,757 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:49:41,763 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:41,891 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-24 20:49:41,891 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:41,898 INFO ]: Computing forward predicates... [2018-06-24 20:49:42,219 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:42,238 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:42,238 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-24 20:49:42,238 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:49:42,238 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:49:42,238 INFO ]: CoverageRelationStatistics Valid=69, Invalid=861, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:49:42,238 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 31 states. [2018-06-24 20:49:43,337 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:43,337 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-24 20:49:43,337 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:49:43,337 INFO ]: Start accepts. Automaton has 31 states. Word has length 23 [2018-06-24 20:49:43,337 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:43,338 INFO ]: With dead ends: 37 [2018-06-24 20:49:43,338 INFO ]: Without dead ends: 37 [2018-06-24 20:49:43,338 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=170, Invalid=1636, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:49:43,338 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:49:43,340 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-06-24 20:49:43,340 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:49:43,340 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-24 20:49:43,341 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-24 20:49:43,341 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:43,344 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-24 20:49:43,344 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:49:43,344 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-24 20:49:43,344 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:49:43,344 INFO ]: Found error trace [2018-06-24 20:49:43,344 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:43,344 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:43,344 INFO ]: Analyzing trace with hash -1573127873, now seen corresponding path program 24 times [2018-06-24 20:49:43,344 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:43,344 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:43,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:43,345 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:43,345 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:43,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:43,910 INFO ]: Checked inductivity of 91 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:43,910 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:43,910 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:49:43,915 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:43,961 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-24 20:49:43,961 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:43,964 INFO ]: Computing forward predicates... [2018-06-24 20:49:44,035 INFO ]: Checked inductivity of 91 backedges. 45 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:44,055 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:44,055 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-06-24 20:49:44,055 INFO ]: Interpolant automaton has 23 states [2018-06-24 20:49:44,055 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-24 20:49:44,055 INFO ]: CoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2018-06-24 20:49:44,055 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 23 states. [2018-06-24 20:49:44,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:44,229 INFO ]: Finished difference Result 36 states and 38 transitions. [2018-06-24 20:49:44,229 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:49:44,229 INFO ]: Start accepts. Automaton has 23 states. Word has length 24 [2018-06-24 20:49:44,229 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:44,229 INFO ]: With dead ends: 36 [2018-06-24 20:49:44,229 INFO ]: Without dead ends: 25 [2018-06-24 20:49:44,229 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=280, Invalid=842, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:49:44,230 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-24 20:49:44,231 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-24 20:49:44,231 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-24 20:49:44,232 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-24 20:49:44,232 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-06-24 20:49:44,233 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:44,233 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-24 20:49:44,233 INFO ]: Interpolant automaton has 23 states. [2018-06-24 20:49:44,233 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-24 20:49:44,233 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-24 20:49:44,233 INFO ]: Found error trace [2018-06-24 20:49:44,233 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:44,233 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:44,233 INFO ]: Analyzing trace with hash 855343572, now seen corresponding path program 25 times [2018-06-24 20:49:44,233 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:44,233 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:44,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:44,234 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:44,234 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:44,245 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:44,513 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:44,514 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:44,514 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:49:44,519 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:44,579 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:44,583 INFO ]: Computing forward predicates... [2018-06-24 20:49:44,626 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:44,645 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:44,645 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-06-24 20:49:44,645 INFO ]: Interpolant automaton has 22 states [2018-06-24 20:49:44,646 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-24 20:49:44,646 INFO ]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2018-06-24 20:49:44,646 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 22 states. [2018-06-24 20:49:44,791 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:44,791 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-24 20:49:44,791 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-24 20:49:44,791 INFO ]: Start accepts. Automaton has 22 states. Word has length 24 [2018-06-24 20:49:44,791 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:44,791 INFO ]: With dead ends: 26 [2018-06-24 20:49:44,791 INFO ]: Without dead ends: 26 [2018-06-24 20:49:44,792 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=352, Invalid=640, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:49:44,792 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-24 20:49:44,794 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-24 20:49:44,794 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-24 20:49:44,794 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-24 20:49:44,794 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-24 20:49:44,794 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:44,794 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-24 20:49:44,794 INFO ]: Interpolant automaton has 22 states. [2018-06-24 20:49:44,795 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-24 20:49:44,795 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-24 20:49:44,795 INFO ]: Found error trace [2018-06-24 20:49:44,795 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:44,795 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:44,795 INFO ]: Analyzing trace with hash 745765377, now seen corresponding path program 26 times [2018-06-24 20:49:44,795 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:44,795 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:44,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:44,796 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:44,796 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:44,812 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:46,056 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:46,056 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:46,056 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:49:46,061 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:46,103 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:46,103 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:46,108 INFO ]: Computing forward predicates... [2018-06-24 20:49:46,653 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:46,672 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:46,672 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-24 20:49:46,672 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:49:46,672 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:49:46,672 INFO ]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:49:46,672 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 34 states. [2018-06-24 20:49:47,195 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:47,195 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-24 20:49:47,195 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:49:47,195 INFO ]: Start accepts. Automaton has 34 states. Word has length 25 [2018-06-24 20:49:47,195 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:47,195 INFO ]: With dead ends: 40 [2018-06-24 20:49:47,195 INFO ]: Without dead ends: 40 [2018-06-24 20:49:47,196 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=187, Invalid=1975, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:49:47,196 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:49:47,197 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-24 20:49:47,197 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:49:47,198 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-24 20:49:47,198 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-06-24 20:49:47,198 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:47,198 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-24 20:49:47,198 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:49:47,198 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-24 20:49:47,198 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:49:47,198 INFO ]: Found error trace [2018-06-24 20:49:47,198 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:47,198 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:47,198 INFO ]: Analyzing trace with hash 1643808628, now seen corresponding path program 27 times [2018-06-24 20:49:47,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:47,199 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:47,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:47,199 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:47,199 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:47,212 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:47,516 INFO ]: Checked inductivity of 111 backedges. 45 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:47,516 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:47,516 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:49:47,521 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:47,573 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-24 20:49:47,574 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:47,577 INFO ]: Computing forward predicates... [2018-06-24 20:49:47,644 INFO ]: Checked inductivity of 111 backedges. 55 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:47,663 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:47,664 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-06-24 20:49:47,664 INFO ]: Interpolant automaton has 25 states [2018-06-24 20:49:47,664 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-24 20:49:47,664 INFO ]: CoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2018-06-24 20:49:47,664 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 25 states. [2018-06-24 20:49:47,848 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:47,848 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-24 20:49:47,849 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:49:47,849 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-24 20:49:47,849 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:47,849 INFO ]: With dead ends: 39 [2018-06-24 20:49:47,849 INFO ]: Without dead ends: 27 [2018-06-24 20:49:47,849 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=1003, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:49:47,849 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-24 20:49:47,850 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-24 20:49:47,850 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-24 20:49:47,851 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-24 20:49:47,851 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-24 20:49:47,851 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:47,851 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-24 20:49:47,851 INFO ]: Interpolant automaton has 25 states. [2018-06-24 20:49:47,851 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-24 20:49:47,851 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-24 20:49:47,851 INFO ]: Found error trace [2018-06-24 20:49:47,851 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:47,851 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:47,851 INFO ]: Analyzing trace with hash -382987905, now seen corresponding path program 28 times [2018-06-24 20:49:47,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:47,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:47,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:47,852 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:47,852 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:47,865 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:48,449 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:48,449 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:48,449 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:49:48,454 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:48,499 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:48,499 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:48,503 INFO ]: Computing forward predicates... [2018-06-24 20:49:48,599 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:48,618 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:48,618 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-06-24 20:49:48,618 INFO ]: Interpolant automaton has 24 states [2018-06-24 20:49:48,618 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-24 20:49:48,618 INFO ]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2018-06-24 20:49:48,618 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2018-06-24 20:49:48,799 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:48,799 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-24 20:49:48,799 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-24 20:49:48,799 INFO ]: Start accepts. Automaton has 24 states. Word has length 26 [2018-06-24 20:49:48,799 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:48,800 INFO ]: With dead ends: 28 [2018-06-24 20:49:48,800 INFO ]: Without dead ends: 28 [2018-06-24 20:49:48,800 INFO ]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=420, Invalid=770, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:49:48,800 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-24 20:49:48,801 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-24 20:49:48,801 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-24 20:49:48,801 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-24 20:49:48,801 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-24 20:49:48,802 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:48,802 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-24 20:49:48,802 INFO ]: Interpolant automaton has 24 states. [2018-06-24 20:49:48,802 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-24 20:49:48,802 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-24 20:49:48,802 INFO ]: Found error trace [2018-06-24 20:49:48,802 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:48,802 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:48,802 INFO ]: Analyzing trace with hash 1012195254, now seen corresponding path program 29 times [2018-06-24 20:49:48,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:48,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:48,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:48,803 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:48,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:48,817 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:49,573 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:49,573 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:49,573 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:49:49,579 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:49,630 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-24 20:49:49,630 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:49,634 INFO ]: Computing forward predicates... [2018-06-24 20:49:49,945 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:49,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:49,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-24 20:49:49,969 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:49:49,969 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:49:49,970 INFO ]: CoverageRelationStatistics Valid=83, Invalid=1249, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:49:49,970 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 37 states. [2018-06-24 20:49:50,500 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:50,500 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-24 20:49:50,500 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:49:50,500 INFO ]: Start accepts. Automaton has 37 states. Word has length 27 [2018-06-24 20:49:50,500 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:50,501 INFO ]: With dead ends: 43 [2018-06-24 20:49:50,501 INFO ]: Without dead ends: 43 [2018-06-24 20:49:50,501 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=2346, Unknown=0, NotChecked=0, Total=2550 [2018-06-24 20:49:50,501 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-24 20:49:50,503 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-24 20:49:50,503 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:49:50,503 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-24 20:49:50,503 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-24 20:49:50,503 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:50,503 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-24 20:49:50,503 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:49:50,503 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-24 20:49:50,503 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:49:50,503 INFO ]: Found error trace [2018-06-24 20:49:50,504 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:50,504 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:50,504 INFO ]: Analyzing trace with hash 1313200223, now seen corresponding path program 30 times [2018-06-24 20:49:50,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:50,504 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:50,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:50,504 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:50,504 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:50,518 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:50,814 INFO ]: Checked inductivity of 133 backedges. 55 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:50,814 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:50,814 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:49:50,823 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:50,877 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-24 20:49:50,877 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:50,880 INFO ]: Computing forward predicates... [2018-06-24 20:49:51,143 INFO ]: Checked inductivity of 133 backedges. 66 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:51,162 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:51,162 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-06-24 20:49:51,162 INFO ]: Interpolant automaton has 27 states [2018-06-24 20:49:51,162 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-24 20:49:51,163 INFO ]: CoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2018-06-24 20:49:51,163 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 27 states. [2018-06-24 20:49:51,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:51,391 INFO ]: Finished difference Result 42 states and 44 transitions. [2018-06-24 20:49:51,392 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:49:51,392 INFO ]: Start accepts. Automaton has 27 states. Word has length 28 [2018-06-24 20:49:51,392 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:51,392 INFO ]: With dead ends: 42 [2018-06-24 20:49:51,392 INFO ]: Without dead ends: 29 [2018-06-24 20:49:51,393 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=382, Invalid=1178, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:49:51,393 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-24 20:49:51,394 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-24 20:49:51,394 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-24 20:49:51,394 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-24 20:49:51,394 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-06-24 20:49:51,395 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:51,395 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-24 20:49:51,395 INFO ]: Interpolant automaton has 27 states. [2018-06-24 20:49:51,395 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-24 20:49:51,395 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-24 20:49:51,395 INFO ]: Found error trace [2018-06-24 20:49:51,395 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:51,395 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:51,395 INFO ]: Analyzing trace with hash -1387950156, now seen corresponding path program 31 times [2018-06-24 20:49:51,395 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:51,395 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:51,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:51,396 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:51,396 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:51,414 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:51,660 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:51,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:51,660 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:49:51,665 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:51,711 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:51,718 INFO ]: Computing forward predicates... [2018-06-24 20:49:51,785 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:51,804 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:51,804 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-06-24 20:49:51,804 INFO ]: Interpolant automaton has 26 states [2018-06-24 20:49:51,804 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-24 20:49:51,804 INFO ]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2018-06-24 20:49:51,804 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 26 states. [2018-06-24 20:49:51,967 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:51,967 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-24 20:49:51,968 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-24 20:49:51,968 INFO ]: Start accepts. Automaton has 26 states. Word has length 28 [2018-06-24 20:49:51,968 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:51,968 INFO ]: With dead ends: 30 [2018-06-24 20:49:51,968 INFO ]: Without dead ends: 30 [2018-06-24 20:49:51,968 INFO ]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=494, Invalid=912, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:49:51,968 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-24 20:49:51,970 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-24 20:49:51,970 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-24 20:49:51,970 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-24 20:49:51,970 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-24 20:49:51,970 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:51,970 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-24 20:49:51,970 INFO ]: Interpolant automaton has 26 states. [2018-06-24 20:49:51,970 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-24 20:49:51,970 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-24 20:49:51,970 INFO ]: Found error trace [2018-06-24 20:49:51,970 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:51,970 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:51,970 INFO ]: Analyzing trace with hash -76863455, now seen corresponding path program 32 times [2018-06-24 20:49:51,970 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:51,970 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:51,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:51,971 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:51,971 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:51,987 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:52,411 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:52,412 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:52,412 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:49:52,417 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:52,466 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:52,466 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:52,471 INFO ]: Computing forward predicates... [2018-06-24 20:49:52,794 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:52,813 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:52,813 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-24 20:49:52,813 INFO ]: Interpolant automaton has 40 states [2018-06-24 20:49:52,813 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-24 20:49:52,813 INFO ]: CoverageRelationStatistics Valid=90, Invalid=1470, Unknown=0, NotChecked=0, Total=1560 [2018-06-24 20:49:52,813 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 40 states. [2018-06-24 20:49:53,572 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:53,572 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-24 20:49:53,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:49:53,572 INFO ]: Start accepts. Automaton has 40 states. Word has length 29 [2018-06-24 20:49:53,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:53,573 INFO ]: With dead ends: 46 [2018-06-24 20:49:53,573 INFO ]: Without dead ends: 46 [2018-06-24 20:49:53,573 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=2749, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:49:53,573 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-24 20:49:53,574 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-24 20:49:53,574 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:49:53,574 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-24 20:49:53,574 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-24 20:49:53,574 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:53,574 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-24 20:49:53,574 INFO ]: Interpolant automaton has 40 states. [2018-06-24 20:49:53,574 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-24 20:49:53,575 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:49:53,575 INFO ]: Found error trace [2018-06-24 20:49:53,575 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:53,575 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:53,575 INFO ]: Analyzing trace with hash 1912118612, now seen corresponding path program 33 times [2018-06-24 20:49:53,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:53,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:53,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:53,575 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:53,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:53,589 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:54,150 INFO ]: Checked inductivity of 157 backedges. 66 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:54,150 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:54,150 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:49:54,159 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:49:54,222 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-24 20:49:54,222 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:54,227 INFO ]: Computing forward predicates... [2018-06-24 20:49:54,311 INFO ]: Checked inductivity of 157 backedges. 78 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:54,331 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:54,331 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-06-24 20:49:54,331 INFO ]: Interpolant automaton has 29 states [2018-06-24 20:49:54,331 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-24 20:49:54,331 INFO ]: CoverageRelationStatistics Valid=200, Invalid=612, Unknown=0, NotChecked=0, Total=812 [2018-06-24 20:49:54,331 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 29 states. [2018-06-24 20:49:54,619 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:54,619 INFO ]: Finished difference Result 45 states and 47 transitions. [2018-06-24 20:49:54,619 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:49:54,619 INFO ]: Start accepts. Automaton has 29 states. Word has length 30 [2018-06-24 20:49:54,619 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:54,619 INFO ]: With dead ends: 45 [2018-06-24 20:49:54,619 INFO ]: Without dead ends: 31 [2018-06-24 20:49:54,620 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=439, Invalid=1367, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:49:54,620 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-24 20:49:54,620 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-24 20:49:54,620 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-24 20:49:54,620 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-24 20:49:54,620 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-06-24 20:49:54,620 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:54,620 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-24 20:49:54,620 INFO ]: Interpolant automaton has 29 states. [2018-06-24 20:49:54,620 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-24 20:49:54,621 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-24 20:49:54,621 INFO ]: Found error trace [2018-06-24 20:49:54,621 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:54,621 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:54,621 INFO ]: Analyzing trace with hash -219164513, now seen corresponding path program 34 times [2018-06-24 20:49:54,621 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:54,621 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:54,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:54,621 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:54,621 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:54,635 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:54,870 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:54,870 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:54,870 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:49:54,875 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:49:54,927 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:49:54,927 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:54,931 INFO ]: Computing forward predicates... [2018-06-24 20:49:54,986 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:55,005 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:55,005 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-06-24 20:49:55,005 INFO ]: Interpolant automaton has 28 states [2018-06-24 20:49:55,005 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-24 20:49:55,005 INFO ]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2018-06-24 20:49:55,005 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 28 states. [2018-06-24 20:49:55,243 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:55,243 INFO ]: Finished difference Result 32 states and 33 transitions. [2018-06-24 20:49:55,246 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-24 20:49:55,246 INFO ]: Start accepts. Automaton has 28 states. Word has length 30 [2018-06-24 20:49:55,246 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:55,246 INFO ]: With dead ends: 32 [2018-06-24 20:49:55,246 INFO ]: Without dead ends: 32 [2018-06-24 20:49:55,247 INFO ]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=574, Invalid=1066, Unknown=0, NotChecked=0, Total=1640 [2018-06-24 20:49:55,247 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-24 20:49:55,248 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-24 20:49:55,248 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-24 20:49:55,249 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-24 20:49:55,249 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-24 20:49:55,249 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:55,249 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-24 20:49:55,249 INFO ]: Interpolant automaton has 28 states. [2018-06-24 20:49:55,249 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-24 20:49:55,249 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-24 20:49:55,249 INFO ]: Found error trace [2018-06-24 20:49:55,249 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:55,249 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:55,249 INFO ]: Analyzing trace with hash 1795753110, now seen corresponding path program 35 times [2018-06-24 20:49:55,249 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:55,249 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:55,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:55,250 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:55,250 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:55,268 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:55,669 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:55,669 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:55,669 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:49:55,675 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:49:55,739 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-24 20:49:55,739 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:55,743 INFO ]: Computing forward predicates... [2018-06-24 20:49:56,227 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:56,246 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:56,246 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-24 20:49:56,246 INFO ]: Interpolant automaton has 43 states [2018-06-24 20:49:56,246 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-24 20:49:56,247 INFO ]: CoverageRelationStatistics Valid=97, Invalid=1709, Unknown=0, NotChecked=0, Total=1806 [2018-06-24 20:49:56,247 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 43 states. [2018-06-24 20:49:57,114 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:57,114 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-24 20:49:57,114 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:49:57,114 INFO ]: Start accepts. Automaton has 43 states. Word has length 31 [2018-06-24 20:49:57,114 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:57,115 INFO ]: With dead ends: 49 [2018-06-24 20:49:57,115 INFO ]: Without dead ends: 49 [2018-06-24 20:49:57,115 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=3184, Unknown=0, NotChecked=0, Total=3422 [2018-06-24 20:49:57,115 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-24 20:49:57,117 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-06-24 20:49:57,117 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:49:57,117 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-24 20:49:57,117 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-06-24 20:49:57,117 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:57,117 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-24 20:49:57,117 INFO ]: Interpolant automaton has 43 states. [2018-06-24 20:49:57,117 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-24 20:49:57,117 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:49:57,117 INFO ]: Found error trace [2018-06-24 20:49:57,118 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:57,118 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:57,118 INFO ]: Analyzing trace with hash -166310017, now seen corresponding path program 36 times [2018-06-24 20:49:57,118 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:57,118 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:57,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:57,118 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:57,118 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:57,134 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:57,472 INFO ]: Checked inductivity of 183 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:57,472 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:57,472 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:49:57,477 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:49:57,540 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-24 20:49:57,540 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:57,545 INFO ]: Computing forward predicates... [2018-06-24 20:49:57,582 INFO ]: Checked inductivity of 183 backedges. 91 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:57,601 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:57,601 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-06-24 20:49:57,601 INFO ]: Interpolant automaton has 31 states [2018-06-24 20:49:57,601 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-24 20:49:57,601 INFO ]: CoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2018-06-24 20:49:57,602 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 31 states. [2018-06-24 20:49:57,920 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:57,920 INFO ]: Finished difference Result 48 states and 50 transitions. [2018-06-24 20:49:57,920 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:49:57,920 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-24 20:49:57,920 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:57,920 INFO ]: With dead ends: 48 [2018-06-24 20:49:57,920 INFO ]: Without dead ends: 33 [2018-06-24 20:49:57,921 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=500, Invalid=1570, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:49:57,921 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-24 20:49:57,921 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-24 20:49:57,922 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-24 20:49:57,922 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-24 20:49:57,922 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-06-24 20:49:57,922 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:57,922 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-24 20:49:57,922 INFO ]: Interpolant automaton has 31 states. [2018-06-24 20:49:57,922 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-24 20:49:57,922 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-24 20:49:57,922 INFO ]: Found error trace [2018-06-24 20:49:57,922 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:57,922 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:57,922 INFO ]: Analyzing trace with hash -1811577452, now seen corresponding path program 37 times [2018-06-24 20:49:57,922 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:57,922 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:57,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:57,922 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:49:57,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:57,936 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:58,204 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:58,204 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:58,204 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:49:58,211 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:58,263 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:58,267 INFO ]: Computing forward predicates... [2018-06-24 20:49:58,358 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:58,376 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:58,377 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-06-24 20:49:58,377 INFO ]: Interpolant automaton has 30 states [2018-06-24 20:49:58,377 INFO ]: Constructing interpolant automaton starting with 30 interpolants. [2018-06-24 20:49:58,377 INFO ]: CoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2018-06-24 20:49:58,377 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 30 states. [2018-06-24 20:49:58,628 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:49:58,628 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-24 20:49:58,628 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-24 20:49:58,628 INFO ]: Start accepts. Automaton has 30 states. Word has length 32 [2018-06-24 20:49:58,628 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:49:58,628 INFO ]: With dead ends: 34 [2018-06-24 20:49:58,628 INFO ]: Without dead ends: 34 [2018-06-24 20:49:58,629 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=660, Invalid=1232, Unknown=0, NotChecked=0, Total=1892 [2018-06-24 20:49:58,629 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-24 20:49:58,629 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-24 20:49:58,630 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-24 20:49:58,630 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-24 20:49:58,630 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-24 20:49:58,630 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:49:58,630 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-24 20:49:58,630 INFO ]: Interpolant automaton has 30 states. [2018-06-24 20:49:58,630 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-24 20:49:58,630 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-24 20:49:58,630 INFO ]: Found error trace [2018-06-24 20:49:58,630 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:49:58,630 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:49:58,630 INFO ]: Analyzing trace with hash -324407743, now seen corresponding path program 38 times [2018-06-24 20:49:58,630 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:49:58,630 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:49:58,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:58,631 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:49:58,631 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:49:58,644 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:59,160 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:59,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:49:59,160 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:49:59,167 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:49:59,226 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:49:59,226 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:49:59,231 INFO ]: Computing forward predicates... [2018-06-24 20:49:59,658 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:49:59,676 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:49:59,677 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-24 20:49:59,677 INFO ]: Interpolant automaton has 46 states [2018-06-24 20:49:59,677 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-24 20:49:59,677 INFO ]: CoverageRelationStatistics Valid=104, Invalid=1966, Unknown=0, NotChecked=0, Total=2070 [2018-06-24 20:49:59,677 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 46 states. [2018-06-24 20:50:00,490 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:00,490 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-24 20:50:00,490 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:50:00,490 INFO ]: Start accepts. Automaton has 46 states. Word has length 33 [2018-06-24 20:50:00,491 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:00,491 INFO ]: With dead ends: 52 [2018-06-24 20:50:00,491 INFO ]: Without dead ends: 52 [2018-06-24 20:50:00,491 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=255, Invalid=3651, Unknown=0, NotChecked=0, Total=3906 [2018-06-24 20:50:00,492 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-24 20:50:00,492 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-06-24 20:50:00,492 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:50:00,492 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-24 20:50:00,493 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-24 20:50:00,493 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:00,493 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-24 20:50:00,493 INFO ]: Interpolant automaton has 46 states. [2018-06-24 20:50:00,493 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-24 20:50:00,493 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:50:00,493 INFO ]: Found error trace [2018-06-24 20:50:00,493 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:00,493 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:00,493 INFO ]: Analyzing trace with hash -1466787020, now seen corresponding path program 39 times [2018-06-24 20:50:00,493 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:00,493 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:00,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:00,493 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:00,493 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:00,507 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:00,820 INFO ]: Checked inductivity of 211 backedges. 91 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:00,820 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:00,879 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:50:00,884 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:00,954 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-24 20:50:00,954 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:00,958 INFO ]: Computing forward predicates... [2018-06-24 20:50:00,999 INFO ]: Checked inductivity of 211 backedges. 105 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:01,020 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:01,020 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-06-24 20:50:01,020 INFO ]: Interpolant automaton has 33 states [2018-06-24 20:50:01,020 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-24 20:50:01,020 INFO ]: CoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-06-24 20:50:01,020 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 33 states. [2018-06-24 20:50:01,484 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:01,484 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-24 20:50:01,484 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:50:01,484 INFO ]: Start accepts. Automaton has 33 states. Word has length 34 [2018-06-24 20:50:01,484 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:01,485 INFO ]: With dead ends: 51 [2018-06-24 20:50:01,485 INFO ]: Without dead ends: 35 [2018-06-24 20:50:01,485 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=565, Invalid=1787, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:50:01,485 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-24 20:50:01,486 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-24 20:50:01,486 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-24 20:50:01,486 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-24 20:50:01,486 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-06-24 20:50:01,486 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:01,486 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-24 20:50:01,486 INFO ]: Interpolant automaton has 33 states. [2018-06-24 20:50:01,486 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-24 20:50:01,486 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-24 20:50:01,486 INFO ]: Found error trace [2018-06-24 20:50:01,486 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:01,487 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:01,487 INFO ]: Analyzing trace with hash -930469953, now seen corresponding path program 40 times [2018-06-24 20:50:01,487 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:01,487 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:01,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:01,487 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:01,487 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:01,499 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:01,991 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:01,991 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:01,991 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:50:01,997 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:02,053 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:02,053 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:02,057 INFO ]: Computing forward predicates... [2018-06-24 20:50:02,094 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:02,112 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:02,112 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-06-24 20:50:02,113 INFO ]: Interpolant automaton has 32 states [2018-06-24 20:50:02,113 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-24 20:50:02,113 INFO ]: CoverageRelationStatistics Valid=272, Invalid=720, Unknown=0, NotChecked=0, Total=992 [2018-06-24 20:50:02,113 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-06-24 20:50:02,339 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:02,339 INFO ]: Finished difference Result 36 states and 37 transitions. [2018-06-24 20:50:02,340 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-24 20:50:02,340 INFO ]: Start accepts. Automaton has 32 states. Word has length 34 [2018-06-24 20:50:02,340 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:02,340 INFO ]: With dead ends: 36 [2018-06-24 20:50:02,340 INFO ]: Without dead ends: 36 [2018-06-24 20:50:02,340 INFO ]: 0 DeclaredPredicates, 79 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=752, Invalid=1410, Unknown=0, NotChecked=0, Total=2162 [2018-06-24 20:50:02,340 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-24 20:50:02,341 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-24 20:50:02,341 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-24 20:50:02,341 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-24 20:50:02,342 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-24 20:50:02,342 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:02,342 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-24 20:50:02,342 INFO ]: Interpolant automaton has 32 states. [2018-06-24 20:50:02,342 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-24 20:50:02,342 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-24 20:50:02,342 INFO ]: Found error trace [2018-06-24 20:50:02,342 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:02,342 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:02,342 INFO ]: Analyzing trace with hash 1220120950, now seen corresponding path program 41 times [2018-06-24 20:50:02,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:02,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:02,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:02,343 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:02,343 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:02,361 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:03,321 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:03,321 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:03,321 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:50:03,327 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:03,402 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-24 20:50:03,402 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:03,408 INFO ]: Computing forward predicates... [2018-06-24 20:50:03,919 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:03,938 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:03,938 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-24 20:50:03,938 INFO ]: Interpolant automaton has 49 states [2018-06-24 20:50:03,939 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-24 20:50:03,939 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2241, Unknown=0, NotChecked=0, Total=2352 [2018-06-24 20:50:03,939 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 49 states. [2018-06-24 20:50:04,772 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:04,772 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-24 20:50:04,772 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:50:04,772 INFO ]: Start accepts. Automaton has 49 states. Word has length 35 [2018-06-24 20:50:04,772 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:04,773 INFO ]: With dead ends: 55 [2018-06-24 20:50:04,773 INFO ]: Without dead ends: 55 [2018-06-24 20:50:04,774 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=272, Invalid=4150, Unknown=0, NotChecked=0, Total=4422 [2018-06-24 20:50:04,774 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-24 20:50:04,775 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-06-24 20:50:04,775 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:50:04,775 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-24 20:50:04,775 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-24 20:50:04,775 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:04,775 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-24 20:50:04,775 INFO ]: Interpolant automaton has 49 states. [2018-06-24 20:50:04,775 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-24 20:50:04,775 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:50:04,775 INFO ]: Found error trace [2018-06-24 20:50:04,775 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:04,775 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:04,776 INFO ]: Analyzing trace with hash -831037793, now seen corresponding path program 42 times [2018-06-24 20:50:04,776 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:04,776 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:04,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:04,776 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:04,776 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:04,790 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:05,672 INFO ]: Checked inductivity of 241 backedges. 105 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:05,672 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:05,672 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:50:05,677 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:05,771 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-24 20:50:05,771 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:05,776 INFO ]: Computing forward predicates... [2018-06-24 20:50:06,438 INFO ]: Checked inductivity of 241 backedges. 120 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:06,458 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:06,458 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-06-24 20:50:06,458 INFO ]: Interpolant automaton has 35 states [2018-06-24 20:50:06,458 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-24 20:50:06,458 INFO ]: CoverageRelationStatistics Valid=293, Invalid=897, Unknown=0, NotChecked=0, Total=1190 [2018-06-24 20:50:06,458 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 35 states. [2018-06-24 20:50:06,862 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:06,862 INFO ]: Finished difference Result 54 states and 56 transitions. [2018-06-24 20:50:06,862 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:50:06,862 INFO ]: Start accepts. Automaton has 35 states. Word has length 36 [2018-06-24 20:50:06,862 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:06,862 INFO ]: With dead ends: 54 [2018-06-24 20:50:06,862 INFO ]: Without dead ends: 37 [2018-06-24 20:50:06,862 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=634, Invalid=2018, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:50:06,863 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-24 20:50:06,863 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-24 20:50:06,863 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-24 20:50:06,863 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-24 20:50:06,863 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-06-24 20:50:06,863 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:06,863 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-24 20:50:06,863 INFO ]: Interpolant automaton has 35 states. [2018-06-24 20:50:06,863 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-24 20:50:06,864 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-24 20:50:06,864 INFO ]: Found error trace [2018-06-24 20:50:06,864 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:06,864 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:06,864 INFO ]: Analyzing trace with hash -1385077900, now seen corresponding path program 43 times [2018-06-24 20:50:06,864 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:06,864 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:06,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:06,864 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:06,864 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:06,877 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:07,227 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:07,227 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:07,227 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:50:07,232 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:07,295 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:07,302 INFO ]: Computing forward predicates... [2018-06-24 20:50:07,340 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:07,359 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:07,359 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-06-24 20:50:07,359 INFO ]: Interpolant automaton has 34 states [2018-06-24 20:50:07,359 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-24 20:50:07,359 INFO ]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2018-06-24 20:50:07,359 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 34 states. [2018-06-24 20:50:07,630 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:07,630 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-24 20:50:07,630 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-24 20:50:07,630 INFO ]: Start accepts. Automaton has 34 states. Word has length 36 [2018-06-24 20:50:07,630 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:07,630 INFO ]: With dead ends: 38 [2018-06-24 20:50:07,630 INFO ]: Without dead ends: 38 [2018-06-24 20:50:07,630 INFO ]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=850, Invalid=1600, Unknown=0, NotChecked=0, Total=2450 [2018-06-24 20:50:07,630 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-24 20:50:07,631 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-24 20:50:07,631 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-24 20:50:07,632 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-24 20:50:07,632 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-24 20:50:07,632 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:07,632 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-24 20:50:07,632 INFO ]: Interpolant automaton has 34 states. [2018-06-24 20:50:07,632 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-24 20:50:07,632 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-24 20:50:07,632 INFO ]: Found error trace [2018-06-24 20:50:07,632 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:07,632 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:07,632 INFO ]: Analyzing trace with hash 12176481, now seen corresponding path program 44 times [2018-06-24 20:50:07,632 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:07,633 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:07,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:07,633 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:07,633 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:07,649 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:08,468 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:08,469 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:08,469 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:50:08,474 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-24 20:50:08,553 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-24 20:50:08,553 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:08,559 INFO ]: Computing forward predicates... [2018-06-24 20:50:09,164 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:09,183 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:09,183 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-24 20:50:09,184 INFO ]: Interpolant automaton has 52 states [2018-06-24 20:50:09,184 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-24 20:50:09,184 INFO ]: CoverageRelationStatistics Valid=118, Invalid=2534, Unknown=0, NotChecked=0, Total=2652 [2018-06-24 20:50:09,184 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 52 states. [2018-06-24 20:50:10,239 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:10,239 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-24 20:50:10,239 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:50:10,239 INFO ]: Start accepts. Automaton has 52 states. Word has length 37 [2018-06-24 20:50:10,239 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:10,239 INFO ]: With dead ends: 58 [2018-06-24 20:50:10,239 INFO ]: Without dead ends: 58 [2018-06-24 20:50:10,240 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=289, Invalid=4681, Unknown=0, NotChecked=0, Total=4970 [2018-06-24 20:50:10,240 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-24 20:50:10,241 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 40. [2018-06-24 20:50:10,241 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:50:10,241 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-24 20:50:10,241 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-06-24 20:50:10,242 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:10,242 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-24 20:50:10,242 INFO ]: Interpolant automaton has 52 states. [2018-06-24 20:50:10,242 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-24 20:50:10,242 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:50:10,242 INFO ]: Found error trace [2018-06-24 20:50:10,242 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:10,242 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:10,242 INFO ]: Analyzing trace with hash 377389332, now seen corresponding path program 45 times [2018-06-24 20:50:10,242 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:10,242 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:10,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:10,243 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:10,243 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:10,260 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:12,119 INFO ]: Checked inductivity of 273 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:12,120 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:12,158 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:50:12,164 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-24 20:50:12,263 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-24 20:50:12,263 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:12,268 INFO ]: Computing forward predicates... [2018-06-24 20:50:12,313 INFO ]: Checked inductivity of 273 backedges. 136 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:12,332 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:12,332 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-06-24 20:50:12,333 INFO ]: Interpolant automaton has 37 states [2018-06-24 20:50:12,333 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-24 20:50:12,333 INFO ]: CoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-06-24 20:50:12,333 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 37 states. [2018-06-24 20:50:12,774 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:12,774 INFO ]: Finished difference Result 57 states and 59 transitions. [2018-06-24 20:50:12,775 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-24 20:50:12,775 INFO ]: Start accepts. Automaton has 37 states. Word has length 38 [2018-06-24 20:50:12,775 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:12,776 INFO ]: With dead ends: 57 [2018-06-24 20:50:12,776 INFO ]: Without dead ends: 39 [2018-06-24 20:50:12,776 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=707, Invalid=2263, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:50:12,776 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-24 20:50:12,777 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-24 20:50:12,777 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-24 20:50:12,777 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-24 20:50:12,777 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-06-24 20:50:12,777 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:12,777 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-24 20:50:12,777 INFO ]: Interpolant automaton has 37 states. [2018-06-24 20:50:12,777 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-24 20:50:12,777 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-24 20:50:12,777 INFO ]: Found error trace [2018-06-24 20:50:12,778 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:12,778 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:12,778 INFO ]: Analyzing trace with hash 382015199, now seen corresponding path program 46 times [2018-06-24 20:50:12,778 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:12,778 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:12,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:12,778 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:12,778 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:12,790 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:13,504 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:13,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:13,504 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:50:13,511 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-24 20:50:13,579 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-24 20:50:13,579 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:13,586 INFO ]: Computing forward predicates... [2018-06-24 20:50:14,295 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:14,324 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:14,324 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-06-24 20:50:14,325 INFO ]: Interpolant automaton has 36 states [2018-06-24 20:50:14,325 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-24 20:50:14,325 INFO ]: CoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2018-06-24 20:50:14,325 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 36 states. [2018-06-24 20:50:15,571 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:15,571 INFO ]: Finished difference Result 40 states and 41 transitions. [2018-06-24 20:50:15,572 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:50:15,572 INFO ]: Start accepts. Automaton has 36 states. Word has length 38 [2018-06-24 20:50:15,572 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:15,572 INFO ]: With dead ends: 40 [2018-06-24 20:50:15,572 INFO ]: Without dead ends: 40 [2018-06-24 20:50:15,572 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=954, Invalid=1802, Unknown=0, NotChecked=0, Total=2756 [2018-06-24 20:50:15,572 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-24 20:50:15,573 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-24 20:50:15,573 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-24 20:50:15,574 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-24 20:50:15,574 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-24 20:50:15,574 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:15,574 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-24 20:50:15,574 INFO ]: Interpolant automaton has 36 states. [2018-06-24 20:50:15,574 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-24 20:50:15,574 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-24 20:50:15,574 INFO ]: Found error trace [2018-06-24 20:50:15,574 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:15,574 INFO ]: === Iteration 55 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:15,574 INFO ]: Analyzing trace with hash -1042512298, now seen corresponding path program 47 times [2018-06-24 20:50:15,574 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:15,574 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:15,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:15,575 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:15,575 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:15,595 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:16,252 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:16,252 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:16,252 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:50:16,259 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-24 20:50:16,341 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-24 20:50:16,341 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:16,348 INFO ]: Computing forward predicates... [2018-06-24 20:50:17,023 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:17,042 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:17,042 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2018-06-24 20:50:17,042 INFO ]: Interpolant automaton has 55 states [2018-06-24 20:50:17,042 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-24 20:50:17,043 INFO ]: CoverageRelationStatistics Valid=125, Invalid=2845, Unknown=0, NotChecked=0, Total=2970 [2018-06-24 20:50:17,043 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 55 states. [2018-06-24 20:50:18,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:18,232 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-24 20:50:18,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:50:18,232 INFO ]: Start accepts. Automaton has 55 states. Word has length 39 [2018-06-24 20:50:18,233 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:18,233 INFO ]: With dead ends: 61 [2018-06-24 20:50:18,233 INFO ]: Without dead ends: 61 [2018-06-24 20:50:18,234 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 17 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=306, Invalid=5244, Unknown=0, NotChecked=0, Total=5550 [2018-06-24 20:50:18,234 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-24 20:50:18,235 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-06-24 20:50:18,235 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-24 20:50:18,235 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-24 20:50:18,236 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-24 20:50:18,236 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:18,236 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-24 20:50:18,236 INFO ]: Interpolant automaton has 55 states. [2018-06-24 20:50:18,236 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-24 20:50:18,236 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:50:18,236 INFO ]: Found error trace [2018-06-24 20:50:18,236 INFO ]: trace histogram [18, 16, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:18,236 INFO ]: === Iteration 56 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:18,236 INFO ]: Analyzing trace with hash 2041775551, now seen corresponding path program 48 times [2018-06-24 20:50:18,236 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:18,236 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:18,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:18,239 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:18,239 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:18,258 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:18,673 INFO ]: Checked inductivity of 307 backedges. 136 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:18,673 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:18,673 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:18,679 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-24 20:50:18,758 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-24 20:50:18,758 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:18,763 INFO ]: Computing forward predicates... [2018-06-24 20:50:18,800 INFO ]: Checked inductivity of 307 backedges. 153 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:18,819 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:18,819 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-06-24 20:50:18,819 INFO ]: Interpolant automaton has 39 states [2018-06-24 20:50:18,819 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-24 20:50:18,819 INFO ]: CoverageRelationStatistics Valid=365, Invalid=1117, Unknown=0, NotChecked=0, Total=1482 [2018-06-24 20:50:18,819 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 39 states. [2018-06-24 20:50:19,301 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-24 20:50:19,301 INFO ]: Finished difference Result 60 states and 62 transitions. [2018-06-24 20:50:19,301 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-24 20:50:19,301 INFO ]: Start accepts. Automaton has 39 states. Word has length 40 [2018-06-24 20:50:19,301 INFO ]: Finished accepts. some prefix is accepted. [2018-06-24 20:50:19,301 INFO ]: With dead ends: 60 [2018-06-24 20:50:19,301 INFO ]: Without dead ends: 41 [2018-06-24 20:50:19,301 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=784, Invalid=2522, Unknown=0, NotChecked=0, Total=3306 [2018-06-24 20:50:19,301 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-24 20:50:19,302 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-24 20:50:19,302 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-24 20:50:19,302 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-24 20:50:19,302 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-06-24 20:50:19,302 INFO ]: Finished accepts. word is rejected. [2018-06-24 20:50:19,302 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-24 20:50:19,302 INFO ]: Interpolant automaton has 39 states. [2018-06-24 20:50:19,302 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-24 20:50:19,302 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-24 20:50:19,302 INFO ]: Found error trace [2018-06-24 20:50:19,303 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2018-06-24 20:50:19,303 INFO ]: === Iteration 57 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-24 20:50:19,303 INFO ]: Analyzing trace with hash -2109789868, now seen corresponding path program 49 times [2018-06-24 20:50:19,303 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-24 20:50:19,303 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-24 20:50:19,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:19,303 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-24 20:50:19,303 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-24 20:50:19,314 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:19,828 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:19,828 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-24 20:50:19,828 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-24 20:50:19,834 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-24 20:50:19,903 INFO ]: Conjunction of SSA is unsat [2018-06-24 20:50:19,909 INFO ]: Computing forward predicates... [2018-06-24 20:50:19,977 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-24 20:50:20,010 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-24 20:50:20,010 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-06-24 20:50:20,010 INFO ]: Interpolant automaton has 38 states [2018-06-24 20:50:20,010 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-24 20:50:20,010 INFO ]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2018-06-24 20:50:20,011 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 38 states. Received shutdown request... [2018-06-24 20:50:20,296 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-24 20:50:20,297 WARN ]: Verification canceled [2018-06-24 20:50:20,298 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-24 20:50:20,299 WARN ]: Timeout [2018-06-24 20:50:20,299 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.06 08:50:20 BasicIcfg [2018-06-24 20:50:20,299 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-24 20:50:20,300 INFO ]: Toolchain (without parser) took 56242.30 ms. Allocated memory was 309.3 MB in the beginning and 845.2 MB in the end (delta: 535.8 MB). Free memory was 263.7 MB in the beginning and 326.0 MB in the end (delta: -62.2 MB). Peak memory consumption was 473.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:20,301 INFO ]: SmtParser took 0.33 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:50:20,301 INFO ]: ChcToBoogie took 56.82 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 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:50:20,302 INFO ]: Boogie Preprocessor took 37.74 ms. Allocated memory is still 309.3 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-24 20:50:20,302 INFO ]: RCFGBuilder took 300.86 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 251.7 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:50:20,304 INFO ]: BlockEncodingV2 took 175.60 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 245.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:20,305 INFO ]: TraceAbstraction took 55662.68 ms. Allocated memory was 309.3 MB in the beginning and 845.2 MB in the end (delta: 535.8 MB). Free memory was 245.7 MB in the beginning and 326.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 455.6 MB. Max. memory is 3.6 GB. [2018-06-24 20:50:20,307 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 17 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.33 ms. Allocated memory is still 309.3 MB. Free memory is still 273.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 56.82 ms. Allocated memory is still 309.3 MB. Free memory was 263.7 MB in the beginning and 261.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 37.74 ms. Allocated memory is still 309.3 MB. Free memory is still 261.7 MB. There was no memory consumed. Max. memory is 3.6 GB. * RCFGBuilder took 300.86 ms. Allocated memory is still 309.3 MB. Free memory was 261.7 MB in the beginning and 251.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 175.60 ms. Allocated memory is still 309.3 MB. Free memory was 251.7 MB in the beginning and 245.7 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 55662.68 ms. Allocated memory was 309.3 MB in the beginning and 845.2 MB in the end (delta: 535.8 MB). Free memory was 245.7 MB in the beginning and 326.0 MB in the end (delta: -80.2 MB). Peak memory consumption was 455.6 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was constructing difference of abstraction (41states) and interpolant automaton (currently 35 states, 38 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 54 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 55.6s OverallTime, 57 OverallIterations, 18 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 326 SDtfs, 491 SDslu, 3074 SDs, 0 SdLazy, 14953 SolverSat, 2721 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2837 GetRequests, 1022 SyntacticMatches, 54 SemanticMatches, 1760 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10117 ImplicationChecksByTransitivity, 36.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 56 MinimizatonAttempts, 189 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 30.9s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 251 NumberOfCheckSat, 2351 ConstructedInterpolants, 0 QuantifiedInterpolants, 319957 SizeOfPredicates, 1271 NumberOfNonLiveVariables, 21794 ConjunctsInSsa, 5426 ConjunctsInUnsatCore, 110 InterpolantComputations, 5 PerfectInterpolantSequences, 3725/11361 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/loop2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-24_20-50-20-319.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-24_20-50-20-319.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-24_20-50-20-319.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/loop2_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-24_20-50-20-319.csv Completed graceful shutdown