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/square_twice_safe_weaved.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:54:36,674 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:54:36,675 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:54:36,687 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:54:36,687 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:54:36,688 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:54:36,689 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:54:36,704 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:54:36,706 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:54:36,707 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:54:36,707 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:54:36,708 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:54:36,708 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:54:36,709 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:54:36,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:54:36,711 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:54:36,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:54:36,717 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:54:36,719 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:54:36,723 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:54:36,724 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:54:36,725 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:54:36,731 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:54:36,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:54:36,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:54:36,733 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:54:36,734 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:54:36,736 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:54:36,736 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:54:36,737 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:54:36,737 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:54:36,738 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:54:36,738 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:54:36,738 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:54:36,743 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:54:36,744 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:54:36,744 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/chc/AutomizerCHC/AutomizerCHC_Goto.epf [2018-06-26 17:54:36,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:54:36,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:54:36,768 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:54:36,770 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:54:36,771 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:54:36,771 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:54:36,772 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:54:36,772 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:54:36,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:54:36,772 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:54:36,772 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:54:36,773 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:54:36,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:54:36,773 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:54:36,773 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:54:36,773 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:54:36,773 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:54:36,774 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:54:36,774 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:54:36,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:54:36,775 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:54:36,776 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:54:36,776 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:54:36,817 INFO ]: Repository-Root is: /tmp [2018-06-26 17:54:36,833 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:54:36,836 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:54:36,838 INFO ]: Initializing SmtParser... [2018-06-26 17:54:36,838 INFO ]: SmtParser initialized [2018-06-26 17:54:36,839 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-26 17:54:36,840 INFO ]: Parsing .smt2 file as a set of Horn Clauses No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-06-26 17:54:36,926 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 unknown [2018-06-26 17:54:37,120 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/square_twice_safe_weaved.c-1.smt2 [2018-06-26 17:54:37,124 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:54:37,129 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:54:37,129 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:54:37,129 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:54:37,129 INFO ]: ChcToBoogie initialized [2018-06-26 17:54:37,133 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,179 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37 Unit [2018-06-26 17:54:37,179 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:54:37,179 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:54:37,179 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:54:37,180 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:54:37,203 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,203 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,211 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,211 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,214 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,216 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,217 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,219 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:54:37,220 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:54:37,220 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:54:37,220 INFO ]: RCFGBuilder initialized [2018-06-26 17:54:37,221 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2018-06-26 17:54:37,239 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:54:37,239 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:54:37,239 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:54:37,239 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:54:37,239 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:54:37,239 INFO ]: Found implementation of procedure Ultimate.START Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:54:37,550 INFO ]: Using library mode [2018-06-26 17:54:37,551 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:37 BoogieIcfgContainer [2018-06-26 17:54:37,551 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:54:37,551 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:54:37,551 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:54:37,552 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:54:37,553 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:37" (1/1) ... [2018-06-26 17:54:37,566 INFO ]: Initial Icfg 14 locations, 16 edges [2018-06-26 17:54:37,567 INFO ]: Using Remove infeasible edges [2018-06-26 17:54:37,568 INFO ]: Using Maximize final states [2018-06-26 17:54:37,568 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:54:37,569 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:54:37,573 INFO ]: Using Remove sink states [2018-06-26 17:54:37,574 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:54:37,574 INFO ]: Using Use SBE [2018-06-26 17:54:37,579 INFO ]: SBE split 0 edges [2018-06-26 17:54:37,584 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:54:37,586 INFO ]: 0 new accepting states [2018-06-26 17:54:37,645 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-26 17:54:37,647 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:54:37,652 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:54:37,652 INFO ]: 0 new accepting states [2018-06-26 17:54:37,653 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:54:37,653 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:54:37,653 INFO ]: Encoded RCFG 8 locations, 10 edges [2018-06-26 17:54:37,653 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:54:37 BasicIcfg [2018-06-26 17:54:37,653 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:54:37,665 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:54:37,666 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:54:37,670 INFO ]: TraceAbstraction initialized [2018-06-26 17:54:37,670 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:54:37" (1/4) ... [2018-06-26 17:54:37,671 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6d4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:54:37, skipping insertion in model container [2018-06-26 17:54:37,671 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:54:37" (2/4) ... [2018-06-26 17:54:37,671 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6d4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:54:37, skipping insertion in model container [2018-06-26 17:54:37,671 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:54:37" (3/4) ... [2018-06-26 17:54:37,671 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb6d4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:54:37, skipping insertion in model container [2018-06-26 17:54:37,671 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:54:37" (4/4) ... [2018-06-26 17:54:37,673 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:54:37,683 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:54:37,690 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:54:37,729 INFO ]: Using default assertion order modulation [2018-06-26 17:54:37,730 INFO ]: Interprodecural is true [2018-06-26 17:54:37,730 INFO ]: Hoare is false [2018-06-26 17:54:37,730 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:54:37,730 INFO ]: Backedges is TWOTRACK [2018-06-26 17:54:37,730 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:54:37,730 INFO ]: Difference is false [2018-06-26 17:54:37,730 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:54:37,730 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:54:37,740 INFO ]: Start isEmpty. Operand 8 states. [2018-06-26 17:54:37,749 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:54:37,749 INFO ]: Found error trace [2018-06-26 17:54:37,749 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:37,750 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:37,754 INFO ]: Analyzing trace with hash -1173083044, now seen corresponding path program 1 times [2018-06-26 17:54:37,756 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:37,756 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:37,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:37,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:37,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:37,833 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:37,903 INFO ]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:37,905 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:37,905 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:54:37,907 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:54:37,919 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:54:37,920 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:54:37,922 INFO ]: Start difference. First operand 8 states. Second operand 4 states. [2018-06-26 17:54:37,994 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:37,994 INFO ]: Finished difference Result 13 states and 18 transitions. [2018-06-26 17:54:37,994 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:54:37,995 INFO ]: Start accepts. Automaton has 4 states. Word has length 7 [2018-06-26 17:54:37,995 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:38,006 INFO ]: With dead ends: 13 [2018-06-26 17:54:38,006 INFO ]: Without dead ends: 13 [2018-06-26 17:54:38,007 INFO ]: 0 DeclaredPredicates, 5 GetRequests, 2 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-26 17:54:38,019 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:54:38,032 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 17:54:38,034 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:54:38,034 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-06-26 17:54:38,035 INFO ]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-06-26 17:54:38,036 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:38,036 INFO ]: Abstraction has 10 states and 13 transitions. [2018-06-26 17:54:38,036 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:54:38,036 INFO ]: Start isEmpty. Operand 10 states and 13 transitions. [2018-06-26 17:54:38,036 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:54:38,036 INFO ]: Found error trace [2018-06-26 17:54:38,036 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:38,036 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:38,036 INFO ]: Analyzing trace with hash -2007083269, now seen corresponding path program 1 times [2018-06-26 17:54:38,036 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:38,036 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:38,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:38,037 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:38,037 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:38,053 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:38,440 INFO ]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:38,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:38,440 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:38,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:38,494 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:38,503 INFO ]: Computing forward predicates... [2018-06-26 17:54:38,818 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:38,838 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:54:38,838 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2018-06-26 17:54:38,839 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:54:38,839 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:54:38,839 INFO ]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:54:38,839 INFO ]: Start difference. First operand 10 states and 13 transitions. Second operand 9 states. [2018-06-26 17:54:39,029 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:39,029 INFO ]: Finished difference Result 12 states and 16 transitions. [2018-06-26 17:54:39,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:54:39,030 INFO ]: Start accepts. Automaton has 9 states. Word has length 8 [2018-06-26 17:54:39,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:39,030 INFO ]: With dead ends: 12 [2018-06-26 17:54:39,030 INFO ]: Without dead ends: 9 [2018-06-26 17:54:39,031 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:54:39,031 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:54:39,032 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:54:39,032 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:54:39,032 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-06-26 17:54:39,032 INFO ]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 8 [2018-06-26 17:54:39,032 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:39,032 INFO ]: Abstraction has 9 states and 11 transitions. [2018-06-26 17:54:39,032 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:54:39,032 INFO ]: Start isEmpty. Operand 9 states and 11 transitions. [2018-06-26 17:54:39,032 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:54:39,032 INFO ]: Found error trace [2018-06-26 17:54:39,032 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:39,032 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:39,033 INFO ]: Analyzing trace with hash -1980301160, now seen corresponding path program 1 times [2018-06-26 17:54:39,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:39,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:39,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:39,033 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:39,033 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:39,050 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:39,128 INFO ]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:54:39,128 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:39,128 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:54:39,128 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:54:39,128 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:54:39,128 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:39,129 INFO ]: Start difference. First operand 9 states and 11 transitions. Second operand 5 states. [2018-06-26 17:54:39,224 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:39,224 INFO ]: Finished difference Result 11 states and 14 transitions. [2018-06-26 17:54:39,224 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:54:39,224 INFO ]: Start accepts. Automaton has 5 states. Word has length 8 [2018-06-26 17:54:39,224 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:39,224 INFO ]: With dead ends: 11 [2018-06-26 17:54:39,224 INFO ]: Without dead ends: 10 [2018-06-26 17:54:39,225 INFO ]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:54:39,225 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:54:39,226 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:54:39,226 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:54:39,226 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-26 17:54:39,226 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 8 [2018-06-26 17:54:39,227 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:39,227 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-26 17:54:39,227 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:54:39,227 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-26 17:54:39,227 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:54:39,227 INFO ]: Found error trace [2018-06-26 17:54:39,227 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:39,227 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:39,227 INFO ]: Analyzing trace with hash -1261041089, now seen corresponding path program 1 times [2018-06-26 17:54:39,227 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:39,227 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:39,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:39,228 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:39,228 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:39,240 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:39,318 INFO ]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:39,318 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:54:39,318 INFO ]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-06-26 17:54:39,319 INFO ]: Interpolant automaton has 5 states [2018-06-26 17:54:39,319 INFO ]: Constructing interpolant automaton starting with 5 interpolants. [2018-06-26 17:54:39,319 INFO ]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-06-26 17:54:39,319 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-06-26 17:54:39,446 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:39,446 INFO ]: Finished difference Result 11 states and 13 transitions. [2018-06-26 17:54:39,449 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:54:39,449 INFO ]: Start accepts. Automaton has 5 states. Word has length 9 [2018-06-26 17:54:39,449 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:39,449 INFO ]: With dead ends: 11 [2018-06-26 17:54:39,449 INFO ]: Without dead ends: 11 [2018-06-26 17:54:39,449 INFO ]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:54:39,449 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:54:39,451 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:54:39,451 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:54:39,451 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-06-26 17:54:39,451 INFO ]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2018-06-26 17:54:39,451 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:39,451 INFO ]: Abstraction has 11 states and 13 transitions. [2018-06-26 17:54:39,451 INFO ]: Interpolant automaton has 5 states. [2018-06-26 17:54:39,451 INFO ]: Start isEmpty. Operand 11 states and 13 transitions. [2018-06-26 17:54:39,452 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:54:39,452 INFO ]: Found error trace [2018-06-26 17:54:39,452 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:39,452 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:39,452 INFO ]: Analyzing trace with hash -437802474, now seen corresponding path program 1 times [2018-06-26 17:54:39,452 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:39,452 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:39,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:39,453 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:39,453 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:39,473 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:39,710 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:39,710 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:39,710 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-06-26 17:54:39,735 INFO ]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:39,777 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:39,780 INFO ]: Computing forward predicates... [2018-06-26 17:54:40,059 INFO ]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:40,079 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:40,079 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-06-26 17:54:40,080 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:54:40,080 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:54:40,080 INFO ]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:54:40,080 INFO ]: Start difference. First operand 11 states and 13 transitions. Second operand 11 states. [2018-06-26 17:54:40,218 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:40,218 INFO ]: Finished difference Result 18 states and 23 transitions. [2018-06-26 17:54:40,218 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:54:40,218 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-26 17:54:40,218 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:40,218 INFO ]: With dead ends: 18 [2018-06-26 17:54:40,218 INFO ]: Without dead ends: 18 [2018-06-26 17:54:40,219 INFO ]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:54:40,219 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:54:40,220 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-06-26 17:54:40,220 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:54:40,221 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-06-26 17:54:40,221 INFO ]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 10 [2018-06-26 17:54:40,221 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:40,221 INFO ]: Abstraction has 13 states and 16 transitions. [2018-06-26 17:54:40,221 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:54:40,221 INFO ]: Start isEmpty. Operand 13 states and 16 transitions. [2018-06-26 17:54:40,221 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:54:40,221 INFO ]: Found error trace [2018-06-26 17:54:40,221 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:40,221 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:40,221 INFO ]: Analyzing trace with hash -718608899, now seen corresponding path program 2 times [2018-06-26 17:54:40,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:40,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:40,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:40,222 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:40,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:40,239 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:40,360 INFO ]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:40,360 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:40,360 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:40,366 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:40,386 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:40,386 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:40,388 INFO ]: Computing forward predicates... [2018-06-26 17:54:40,497 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:40,521 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:40,521 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-06-26 17:54:40,521 INFO ]: Interpolant automaton has 12 states [2018-06-26 17:54:40,521 INFO ]: Constructing interpolant automaton starting with 12 interpolants. [2018-06-26 17:54:40,521 INFO ]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:54:40,522 INFO ]: Start difference. First operand 13 states and 16 transitions. Second operand 12 states. [2018-06-26 17:54:40,977 WARN ]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 17:54:41,321 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:41,321 INFO ]: Finished difference Result 23 states and 29 transitions. [2018-06-26 17:54:41,321 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:54:41,322 INFO ]: Start accepts. Automaton has 12 states. Word has length 11 [2018-06-26 17:54:41,322 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:41,322 INFO ]: With dead ends: 23 [2018-06-26 17:54:41,322 INFO ]: Without dead ends: 17 [2018-06-26 17:54:41,323 INFO ]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:54:41,323 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:54:41,324 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-06-26 17:54:41,324 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:54:41,325 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-06-26 17:54:41,325 INFO ]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 11 [2018-06-26 17:54:41,325 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:41,325 INFO ]: Abstraction has 14 states and 17 transitions. [2018-06-26 17:54:41,325 INFO ]: Interpolant automaton has 12 states. [2018-06-26 17:54:41,325 INFO ]: Start isEmpty. Operand 14 states and 17 transitions. [2018-06-26 17:54:41,325 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:54:41,325 INFO ]: Found error trace [2018-06-26 17:54:41,325 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:41,325 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:41,326 INFO ]: Analyzing trace with hash -750805926, now seen corresponding path program 3 times [2018-06-26 17:54:41,326 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:41,326 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:41,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,326 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:41,326 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,338 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,406 INFO ]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:41,406 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:41,406 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:41,412 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:41,438 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-06-26 17:54:41,438 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,443 INFO ]: Computing forward predicates... [2018-06-26 17:54:41,479 INFO ]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-06-26 17:54:41,501 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:41,501 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-26 17:54:41,501 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:54:41,501 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:54:41,501 INFO ]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:54:41,501 INFO ]: Start difference. First operand 14 states and 17 transitions. Second operand 10 states. [2018-06-26 17:54:41,551 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:41,551 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-26 17:54:41,552 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:54:41,552 INFO ]: Start accepts. Automaton has 10 states. Word has length 11 [2018-06-26 17:54:41,552 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:41,552 INFO ]: With dead ends: 16 [2018-06-26 17:54:41,552 INFO ]: Without dead ends: 16 [2018-06-26 17:54:41,553 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:54:41,553 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:54:41,554 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-06-26 17:54:41,554 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:54:41,554 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-06-26 17:54:41,554 INFO ]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 11 [2018-06-26 17:54:41,554 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:41,554 INFO ]: Abstraction has 13 states and 15 transitions. [2018-06-26 17:54:41,554 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:54:41,554 INFO ]: Start isEmpty. Operand 13 states and 15 transitions. [2018-06-26 17:54:41,555 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:54:41,555 INFO ]: Found error trace [2018-06-26 17:54:41,555 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:41,555 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:41,555 INFO ]: Analyzing trace with hash -1800381605, now seen corresponding path program 4 times [2018-06-26 17:54:41,555 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:41,555 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:41,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,556 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:41,556 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,567 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,651 INFO ]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:41,651 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:41,651 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:41,657 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:41,676 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:41,676 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,678 INFO ]: Computing forward predicates... [2018-06-26 17:54:41,753 INFO ]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:41,772 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:41,772 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-06-26 17:54:41,772 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:54:41,773 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:54:41,773 INFO ]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:54:41,773 INFO ]: Start difference. First operand 13 states and 15 transitions. Second operand 11 states. [2018-06-26 17:54:41,825 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:41,825 INFO ]: Finished difference Result 17 states and 20 transitions. [2018-06-26 17:54:41,826 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:54:41,826 INFO ]: Start accepts. Automaton has 11 states. Word has length 12 [2018-06-26 17:54:41,826 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:41,826 INFO ]: With dead ends: 17 [2018-06-26 17:54:41,826 INFO ]: Without dead ends: 14 [2018-06-26 17:54:41,827 INFO ]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:54:41,827 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:54:41,828 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:54:41,828 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:54:41,829 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-26 17:54:41,829 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-06-26 17:54:41,829 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:41,829 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-26 17:54:41,829 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:54:41,829 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-26 17:54:41,829 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:54:41,829 INFO ]: Found error trace [2018-06-26 17:54:41,830 INFO ]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:41,830 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:41,830 INFO ]: Analyzing trace with hash -950880420, now seen corresponding path program 5 times [2018-06-26 17:54:41,831 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:41,831 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:41,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,831 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:41,831 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:41,854 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:41,966 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:41,966 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:41,966 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:41,975 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:42,027 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:42,027 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:42,031 INFO ]: Computing forward predicates... [2018-06-26 17:54:42,476 INFO ]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:42,507 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:42,507 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-06-26 17:54:42,507 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:54:42,508 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:54:42,508 INFO ]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:54:42,508 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 15 states. [2018-06-26 17:54:42,797 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:42,798 INFO ]: Finished difference Result 23 states and 28 transitions. [2018-06-26 17:54:42,798 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-06-26 17:54:42,798 INFO ]: Start accepts. Automaton has 15 states. Word has length 13 [2018-06-26 17:54:42,798 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:42,798 INFO ]: With dead ends: 23 [2018-06-26 17:54:42,798 INFO ]: Without dead ends: 23 [2018-06-26 17:54:42,799 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:54:42,799 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:54:42,801 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-06-26 17:54:42,801 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:54:42,801 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-06-26 17:54:42,801 INFO ]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 13 [2018-06-26 17:54:42,801 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:42,801 INFO ]: Abstraction has 16 states and 19 transitions. [2018-06-26 17:54:42,801 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:54:42,801 INFO ]: Start isEmpty. Operand 16 states and 19 transitions. [2018-06-26 17:54:42,802 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:54:42,802 INFO ]: Found error trace [2018-06-26 17:54:42,802 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:42,802 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:42,802 INFO ]: Analyzing trace with hash -386147461, now seen corresponding path program 6 times [2018-06-26 17:54:42,802 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:42,802 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:42,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:42,803 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:42,803 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:42,814 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:43,028 INFO ]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:43,028 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:43,028 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) [2018-06-26 17:54:43,044 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:43,077 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 17:54:43,077 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:43,079 INFO ]: Computing forward predicates... [2018-06-26 17:54:43,360 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:43,382 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:43,382 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2018-06-26 17:54:43,382 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:54:43,383 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:54:43,383 INFO ]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:54:43,383 INFO ]: Start difference. First operand 16 states and 19 transitions. Second operand 16 states. [2018-06-26 17:54:43,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:43,891 INFO ]: Finished difference Result 29 states and 35 transitions. [2018-06-26 17:54:43,892 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:54:43,892 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-26 17:54:43,892 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:43,892 INFO ]: With dead ends: 29 [2018-06-26 17:54:43,892 INFO ]: Without dead ends: 21 [2018-06-26 17:54:43,893 INFO ]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:54:43,893 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:54:43,894 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-06-26 17:54:43,894 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:54:43,895 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-06-26 17:54:43,895 INFO ]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2018-06-26 17:54:43,895 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:43,895 INFO ]: Abstraction has 17 states and 20 transitions. [2018-06-26 17:54:43,895 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:54:43,895 INFO ]: Start isEmpty. Operand 17 states and 20 transitions. [2018-06-26 17:54:43,895 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:54:43,895 INFO ]: Found error trace [2018-06-26 17:54:43,895 INFO ]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:43,895 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:43,895 INFO ]: Analyzing trace with hash -1262719336, now seen corresponding path program 7 times [2018-06-26 17:54:43,895 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:43,896 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:43,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:43,896 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:43,896 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:43,909 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:43,980 INFO ]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:43,980 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:43,980 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:43,985 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:44,019 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:44,021 INFO ]: Computing forward predicates... [2018-06-26 17:54:44,117 INFO ]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-06-26 17:54:44,136 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:44,136 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-26 17:54:44,136 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:54:44,136 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:54:44,136 INFO ]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:54:44,136 INFO ]: Start difference. First operand 17 states and 20 transitions. Second operand 13 states. [2018-06-26 17:54:44,193 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:44,193 INFO ]: Finished difference Result 20 states and 23 transitions. [2018-06-26 17:54:44,194 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:54:44,194 INFO ]: Start accepts. Automaton has 13 states. Word has length 14 [2018-06-26 17:54:44,194 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:44,195 INFO ]: With dead ends: 20 [2018-06-26 17:54:44,195 INFO ]: Without dead ends: 20 [2018-06-26 17:54:44,195 INFO ]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:54:44,195 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:54:44,196 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-06-26 17:54:44,196 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:54:44,197 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-26 17:54:44,197 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2018-06-26 17:54:44,197 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:44,197 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-26 17:54:44,197 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:54:44,197 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-26 17:54:44,197 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:54:44,197 INFO ]: Found error trace [2018-06-26 17:54:44,197 INFO ]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:44,198 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:44,198 INFO ]: Analyzing trace with hash -489828131, now seen corresponding path program 8 times [2018-06-26 17:54:44,198 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:44,198 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:44,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:44,198 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:44,198 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:44,208 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:44,291 INFO ]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:44,291 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:44,291 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:44,298 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:44,318 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:44,318 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:44,321 INFO ]: Computing forward predicates... [2018-06-26 17:54:44,433 INFO ]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:44,453 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:44,453 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-06-26 17:54:44,453 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:54:44,453 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:54:44,454 INFO ]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:54:44,454 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2018-06-26 17:54:44,732 WARN ]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-06-26 17:54:44,737 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:44,752 INFO ]: Finished difference Result 21 states and 24 transitions. [2018-06-26 17:54:44,752 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:54:44,752 INFO ]: Start accepts. Automaton has 16 states. Word has length 15 [2018-06-26 17:54:44,752 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:44,752 INFO ]: With dead ends: 21 [2018-06-26 17:54:44,752 INFO ]: Without dead ends: 17 [2018-06-26 17:54:44,753 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:54:44,753 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:54:44,754 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:54:44,754 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:54:44,754 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-06-26 17:54:44,755 INFO ]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2018-06-26 17:54:44,755 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:44,755 INFO ]: Abstraction has 17 states and 19 transitions. [2018-06-26 17:54:44,755 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:54:44,755 INFO ]: Start isEmpty. Operand 17 states and 19 transitions. [2018-06-26 17:54:44,755 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:54:44,755 INFO ]: Found error trace [2018-06-26 17:54:44,755 INFO ]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:44,755 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:44,755 INFO ]: Analyzing trace with hash 1884608662, now seen corresponding path program 9 times [2018-06-26 17:54:44,755 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:44,755 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:44,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:44,756 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:44,756 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:44,772 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:44,951 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:44,951 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:44,951 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:44,957 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:45,000 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:54:45,000 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:45,003 INFO ]: Computing forward predicates... [2018-06-26 17:54:45,201 INFO ]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:45,220 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:45,220 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-06-26 17:54:45,220 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:54:45,220 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:54:45,220 INFO ]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:54:45,220 INFO ]: Start difference. First operand 17 states and 19 transitions. Second operand 19 states. [2018-06-26 17:54:45,462 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:45,462 INFO ]: Finished difference Result 28 states and 33 transitions. [2018-06-26 17:54:45,462 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-06-26 17:54:45,462 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-26 17:54:45,462 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:45,463 INFO ]: With dead ends: 28 [2018-06-26 17:54:45,463 INFO ]: Without dead ends: 28 [2018-06-26 17:54:45,463 INFO ]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:54:45,463 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:54:45,467 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-06-26 17:54:45,467 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:54:45,467 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-06-26 17:54:45,467 INFO ]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 16 [2018-06-26 17:54:45,467 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:45,467 INFO ]: Abstraction has 19 states and 22 transitions. [2018-06-26 17:54:45,467 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:54:45,467 INFO ]: Start isEmpty. Operand 19 states and 22 transitions. [2018-06-26 17:54:45,468 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:54:45,468 INFO ]: Found error trace [2018-06-26 17:54:45,468 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:45,468 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:45,468 INFO ]: Analyzing trace with hash -1817262083, now seen corresponding path program 10 times [2018-06-26 17:54:45,468 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:45,468 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:45,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:45,469 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:45,469 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:45,481 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:45,800 INFO ]: Checked inductivity of 22 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:45,800 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:45,800 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:45,806 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:45,828 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:45,829 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:45,830 INFO ]: Computing forward predicates... [2018-06-26 17:54:45,937 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:45,969 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:45,969 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2018-06-26 17:54:45,969 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:54:45,969 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:54:45,970 INFO ]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:54:45,970 INFO ]: Start difference. First operand 19 states and 22 transitions. Second operand 19 states. [2018-06-26 17:54:46,391 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:46,391 INFO ]: Finished difference Result 27 states and 31 transitions. [2018-06-26 17:54:46,391 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:54:46,391 INFO ]: Start accepts. Automaton has 19 states. Word has length 17 [2018-06-26 17:54:46,391 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:46,391 INFO ]: With dead ends: 27 [2018-06-26 17:54:46,392 INFO ]: Without dead ends: 18 [2018-06-26 17:54:46,392 INFO ]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:54:46,392 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:54:46,393 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:54:46,393 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:54:46,393 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-26 17:54:46,393 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 17 [2018-06-26 17:54:46,393 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:46,393 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-26 17:54:46,393 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:54:46,394 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-26 17:54:46,394 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:54:46,394 INFO ]: Found error trace [2018-06-26 17:54:46,394 INFO ]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:46,394 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:46,394 INFO ]: Analyzing trace with hash 1905723354, now seen corresponding path program 11 times [2018-06-26 17:54:46,394 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:46,394 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:46,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:46,394 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:46,394 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:46,404 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:47,021 INFO ]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:47,021 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:47,021 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:47,027 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:47,051 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 17:54:47,051 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:47,053 INFO ]: Computing forward predicates... [2018-06-26 17:54:47,103 INFO ]: Checked inductivity of 22 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-06-26 17:54:47,124 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:47,124 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-26 17:54:47,124 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:54:47,124 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:54:47,124 INFO ]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:54:47,124 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-06-26 17:54:47,190 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:47,191 INFO ]: Finished difference Result 19 states and 21 transitions. [2018-06-26 17:54:47,191 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:54:47,191 INFO ]: Start accepts. Automaton has 16 states. Word has length 17 [2018-06-26 17:54:47,191 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:47,191 INFO ]: With dead ends: 19 [2018-06-26 17:54:47,191 INFO ]: Without dead ends: 19 [2018-06-26 17:54:47,192 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:54:47,192 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:54:47,193 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:54:47,193 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:54:47,194 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-06-26 17:54:47,194 INFO ]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 17 [2018-06-26 17:54:47,194 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:47,194 INFO ]: Abstraction has 19 states and 21 transitions. [2018-06-26 17:54:47,194 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:54:47,194 INFO ]: Start isEmpty. Operand 19 states and 21 transitions. [2018-06-26 17:54:47,194 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:54:47,194 INFO ]: Found error trace [2018-06-26 17:54:47,194 INFO ]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:47,194 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:47,194 INFO ]: Analyzing trace with hash -1052352549, now seen corresponding path program 12 times [2018-06-26 17:54:47,194 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:47,194 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:47,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:47,196 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:47,196 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:47,206 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:48,097 INFO ]: Checked inductivity of 26 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:48,097 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:48,097 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:48,109 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:48,134 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 17:54:48,134 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:48,137 INFO ]: Computing forward predicates... [2018-06-26 17:54:48,298 INFO ]: Checked inductivity of 26 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:48,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:48,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-06-26 17:54:48,321 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:54:48,321 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:54:48,322 INFO ]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:54:48,322 INFO ]: Start difference. First operand 19 states and 21 transitions. Second operand 20 states. [2018-06-26 17:54:48,522 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:48,523 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-26 17:54:48,524 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:54:48,524 INFO ]: Start accepts. Automaton has 20 states. Word has length 18 [2018-06-26 17:54:48,524 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:48,524 INFO ]: With dead ends: 25 [2018-06-26 17:54:48,524 INFO ]: Without dead ends: 20 [2018-06-26 17:54:48,525 INFO ]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=217, Invalid=653, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:54:48,525 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:54:48,526 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:54:48,526 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:54:48,527 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-26 17:54:48,527 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-06-26 17:54:48,527 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:48,527 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-26 17:54:48,527 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:54:48,527 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-26 17:54:48,527 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:54:48,527 INFO ]: Found error trace [2018-06-26 17:54:48,527 INFO ]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:48,527 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:48,527 INFO ]: Analyzing trace with hash -1684401572, now seen corresponding path program 13 times [2018-06-26 17:54:48,527 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:48,527 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:48,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:48,528 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:48,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:48,541 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:48,752 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:48,752 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:48,752 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:48,757 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:48,783 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:48,786 INFO ]: Computing forward predicates... [2018-06-26 17:54:49,103 INFO ]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:49,122 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:49,122 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-06-26 17:54:49,122 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:54:49,122 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:54:49,123 INFO ]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:54:49,123 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 23 states. [2018-06-26 17:54:49,352 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:49,352 INFO ]: Finished difference Result 33 states and 38 transitions. [2018-06-26 17:54:49,352 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-06-26 17:54:49,352 INFO ]: Start accepts. Automaton has 23 states. Word has length 19 [2018-06-26 17:54:49,353 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:49,353 INFO ]: With dead ends: 33 [2018-06-26 17:54:49,353 INFO ]: Without dead ends: 33 [2018-06-26 17:54:49,353 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:54:49,353 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:54:49,355 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-06-26 17:54:49,355 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:54:49,355 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-06-26 17:54:49,355 INFO ]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 19 [2018-06-26 17:54:49,355 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:49,355 INFO ]: Abstraction has 22 states and 25 transitions. [2018-06-26 17:54:49,355 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:54:49,355 INFO ]: Start isEmpty. Operand 22 states and 25 transitions. [2018-06-26 17:54:49,356 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:54:49,356 INFO ]: Found error trace [2018-06-26 17:54:49,356 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:49,356 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:49,356 INFO ]: Analyzing trace with hash 196915195, now seen corresponding path program 14 times [2018-06-26 17:54:49,356 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:49,356 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:49,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:49,356 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:49,356 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:49,367 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:49,542 INFO ]: Checked inductivity of 35 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:49,542 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:49,542 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:49,557 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:49,587 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:49,587 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:49,589 INFO ]: Computing forward predicates... [2018-06-26 17:54:49,734 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:49,754 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:49,754 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2018-06-26 17:54:49,830 INFO ]: Interpolant automaton has 24 states [2018-06-26 17:54:49,830 INFO ]: Constructing interpolant automaton starting with 24 interpolants. [2018-06-26 17:54:49,830 INFO ]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:54:49,831 INFO ]: Start difference. First operand 22 states and 25 transitions. Second operand 24 states. [2018-06-26 17:54:50,510 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:50,510 INFO ]: Finished difference Result 41 states and 47 transitions. [2018-06-26 17:54:50,511 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:54:50,511 INFO ]: Start accepts. Automaton has 24 states. Word has length 20 [2018-06-26 17:54:50,511 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:50,511 INFO ]: With dead ends: 41 [2018-06-26 17:54:50,511 INFO ]: Without dead ends: 29 [2018-06-26 17:54:50,511 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:50,511 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:54:50,513 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 23. [2018-06-26 17:54:50,513 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:54:50,513 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-06-26 17:54:50,513 INFO ]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2018-06-26 17:54:50,514 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:50,514 INFO ]: Abstraction has 23 states and 26 transitions. [2018-06-26 17:54:50,514 INFO ]: Interpolant automaton has 24 states. [2018-06-26 17:54:50,514 INFO ]: Start isEmpty. Operand 23 states and 26 transitions. [2018-06-26 17:54:50,514 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:54:50,514 INFO ]: Found error trace [2018-06-26 17:54:50,514 INFO ]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:50,514 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:50,514 INFO ]: Analyzing trace with hash 278162584, now seen corresponding path program 15 times [2018-06-26 17:54:50,514 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:50,514 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:50,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:50,515 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:50,515 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:50,523 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:50,742 INFO ]: Checked inductivity of 35 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:50,742 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:50,742 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:50,748 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:50,775 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 17:54:50,775 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:50,777 INFO ]: Computing forward predicates... [2018-06-26 17:54:50,873 INFO ]: Checked inductivity of 35 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-06-26 17:54:50,904 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:50,904 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2018-06-26 17:54:50,904 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:54:50,904 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:54:50,904 INFO ]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:54:50,904 INFO ]: Start difference. First operand 23 states and 26 transitions. Second operand 20 states. [2018-06-26 17:54:51,288 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:51,288 INFO ]: Finished difference Result 29 states and 32 transitions. [2018-06-26 17:54:51,288 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:54:51,288 INFO ]: Start accepts. Automaton has 20 states. Word has length 20 [2018-06-26 17:54:51,289 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:51,289 INFO ]: With dead ends: 29 [2018-06-26 17:54:51,289 INFO ]: Without dead ends: 23 [2018-06-26 17:54:51,289 INFO ]: 0 DeclaredPredicates, 53 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=355, Invalid=977, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:54:51,289 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:54:51,291 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:54:51,291 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:54:51,291 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-06-26 17:54:51,291 INFO ]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-06-26 17:54:51,291 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:51,291 INFO ]: Abstraction has 23 states and 25 transitions. [2018-06-26 17:54:51,291 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:54:51,291 INFO ]: Start isEmpty. Operand 23 states and 25 transitions. [2018-06-26 17:54:51,292 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:54:51,292 INFO ]: Found error trace [2018-06-26 17:54:51,292 INFO ]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:51,292 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:51,292 INFO ]: Analyzing trace with hash -1952286954, now seen corresponding path program 16 times [2018-06-26 17:54:51,292 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:51,292 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:51,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:51,292 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:51,292 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:51,308 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:51,493 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:51,493 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:51,493 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:51,498 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:51,536 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:51,536 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:51,539 INFO ]: Computing forward predicates... [2018-06-26 17:54:52,088 INFO ]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:52,107 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:52,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2018-06-26 17:54:52,107 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:54:52,108 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:54:52,108 INFO ]: CoverageRelationStatistics Valid=57, Invalid=645, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:54:52,108 INFO ]: Start difference. First operand 23 states and 25 transitions. Second operand 27 states. [2018-06-26 17:54:52,845 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:52,845 INFO ]: Finished difference Result 38 states and 43 transitions. [2018-06-26 17:54:52,845 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-06-26 17:54:52,845 INFO ]: Start accepts. Automaton has 27 states. Word has length 22 [2018-06-26 17:54:52,845 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:52,846 INFO ]: With dead ends: 38 [2018-06-26 17:54:52,846 INFO ]: Without dead ends: 38 [2018-06-26 17:54:52,846 INFO ]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=963, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:54:52,846 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:54:52,848 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 25. [2018-06-26 17:54:52,848 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:54:52,848 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-06-26 17:54:52,848 INFO ]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2018-06-26 17:54:52,848 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:52,848 INFO ]: Abstraction has 25 states and 28 transitions. [2018-06-26 17:54:52,848 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:54:52,848 INFO ]: Start isEmpty. Operand 25 states and 28 transitions. [2018-06-26 17:54:52,850 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:54:52,850 INFO ]: Found error trace [2018-06-26 17:54:52,850 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:52,851 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:52,851 INFO ]: Analyzing trace with hash 932321789, now seen corresponding path program 17 times [2018-06-26 17:54:52,851 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:52,851 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:52,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:52,851 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:52,851 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:52,862 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:53,075 INFO ]: Checked inductivity of 51 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:53,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:53,075 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:53,082 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:54:53,116 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:54:53,116 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:53,119 INFO ]: Computing forward predicates... [2018-06-26 17:54:53,284 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:53,303 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:53,303 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2018-06-26 17:54:53,303 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:54:53,304 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:54:53,304 INFO ]: CoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:54:53,304 INFO ]: Start difference. First operand 25 states and 28 transitions. Second operand 25 states. [2018-06-26 17:54:53,430 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:53,430 INFO ]: Finished difference Result 37 states and 41 transitions. [2018-06-26 17:54:53,432 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:54:53,432 INFO ]: Start accepts. Automaton has 25 states. Word has length 23 [2018-06-26 17:54:53,433 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:53,433 INFO ]: With dead ends: 37 [2018-06-26 17:54:53,433 INFO ]: Without dead ends: 24 [2018-06-26 17:54:53,433 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=796, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:54:53,433 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:54:53,435 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:54:53,435 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:54:53,435 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-26 17:54:53,435 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 23 [2018-06-26 17:54:53,435 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:53,435 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-26 17:54:53,435 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:54:53,435 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-26 17:54:53,436 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:54:53,436 INFO ]: Found error trace [2018-06-26 17:54:53,436 INFO ]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:53,436 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:53,436 INFO ]: Analyzing trace with hash 1701651290, now seen corresponding path program 18 times [2018-06-26 17:54:53,436 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:53,436 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:53,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:53,436 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:53,436 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:53,449 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:53,722 INFO ]: Checked inductivity of 51 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:53,722 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:53,722 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:53,729 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:54:53,762 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:54:53,762 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:53,764 INFO ]: Computing forward predicates... [2018-06-26 17:54:53,976 INFO ]: Checked inductivity of 51 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-06-26 17:54:53,995 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:53,995 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 23 [2018-06-26 17:54:53,996 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:54:53,996 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:54:53,996 INFO ]: CoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:54:53,996 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 23 states. [2018-06-26 17:54:54,361 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:54,361 INFO ]: Finished difference Result 33 states and 36 transitions. [2018-06-26 17:54:54,362 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-06-26 17:54:54,362 INFO ]: Start accepts. Automaton has 23 states. Word has length 23 [2018-06-26 17:54:54,362 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:54,362 INFO ]: With dead ends: 33 [2018-06-26 17:54:54,362 INFO ]: Without dead ends: 26 [2018-06-26 17:54:54,363 INFO ]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=534, Invalid=1272, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:54:54,363 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:54:54,364 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:54:54,364 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:54:54,365 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-26 17:54:54,365 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-26 17:54:54,365 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:54,365 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-26 17:54:54,365 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:54:54,365 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-26 17:54:54,367 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:54:54,367 INFO ]: Found error trace [2018-06-26 17:54:54,367 INFO ]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:54,367 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:54,367 INFO ]: Analyzing trace with hash 1283341660, now seen corresponding path program 19 times [2018-06-26 17:54:54,367 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:54,367 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:54,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:54,368 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:54,368 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:54,384 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:54,636 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:54,636 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:54,636 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:54,641 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:54,672 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:54,677 INFO ]: Computing forward predicates... [2018-06-26 17:54:55,132 INFO ]: Checked inductivity of 63 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:55,151 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:55,151 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-06-26 17:54:55,151 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:54:55,151 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:54:55,151 INFO ]: CoverageRelationStatistics Valid=66, Invalid=864, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:54:55,152 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 31 states. [2018-06-26 17:54:55,564 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:55,564 INFO ]: Finished difference Result 43 states and 48 transitions. [2018-06-26 17:54:55,565 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-06-26 17:54:55,565 INFO ]: Start accepts. Automaton has 31 states. Word has length 25 [2018-06-26 17:54:55,565 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:55,565 INFO ]: With dead ends: 43 [2018-06-26 17:54:55,565 INFO ]: Without dead ends: 43 [2018-06-26 17:54:55,565 INFO ]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:54:55,565 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 17:54:55,567 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-06-26 17:54:55,567 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:54:55,568 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-06-26 17:54:55,568 INFO ]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2018-06-26 17:54:55,572 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:55,572 INFO ]: Abstraction has 28 states and 31 transitions. [2018-06-26 17:54:55,572 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:54:55,572 INFO ]: Start isEmpty. Operand 28 states and 31 transitions. [2018-06-26 17:54:55,572 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:54:55,572 INFO ]: Found error trace [2018-06-26 17:54:55,572 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:55,572 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:55,573 INFO ]: Analyzing trace with hash -779824005, now seen corresponding path program 20 times [2018-06-26 17:54:55,573 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:55,573 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:55,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:55,573 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:54:55,573 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:55,588 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:55,862 INFO ]: Checked inductivity of 70 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:55,862 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:55,862 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:55,867 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:54:55,902 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:54:55,902 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:55,904 INFO ]: Computing forward predicates... [2018-06-26 17:54:56,091 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:56,110 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:56,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2018-06-26 17:54:56,110 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:54:56,110 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:54:56,110 INFO ]: CoverageRelationStatistics Valid=139, Invalid=853, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:54:56,111 INFO ]: Start difference. First operand 28 states and 31 transitions. Second operand 32 states. [2018-06-26 17:54:56,823 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:56,823 INFO ]: Finished difference Result 53 states and 59 transitions. [2018-06-26 17:54:56,823 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-26 17:54:56,823 INFO ]: Start accepts. Automaton has 32 states. Word has length 26 [2018-06-26 17:54:56,823 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:56,823 INFO ]: With dead ends: 53 [2018-06-26 17:54:56,823 INFO ]: Without dead ends: 37 [2018-06-26 17:54:56,824 INFO ]: 0 DeclaredPredicates, 74 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=772, Invalid=2420, Unknown=0, NotChecked=0, Total=3192 [2018-06-26 17:54:56,824 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:54:56,826 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 29. [2018-06-26 17:54:56,826 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:54:56,826 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-06-26 17:54:56,826 INFO ]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2018-06-26 17:54:56,826 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:56,826 INFO ]: Abstraction has 29 states and 32 transitions. [2018-06-26 17:54:56,826 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:54:56,826 INFO ]: Start isEmpty. Operand 29 states and 32 transitions. [2018-06-26 17:54:56,827 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:54:56,827 INFO ]: Found error trace [2018-06-26 17:54:56,827 INFO ]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:56,827 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:56,827 INFO ]: Analyzing trace with hash -188548456, now seen corresponding path program 21 times [2018-06-26 17:54:56,827 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:56,827 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:56,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:56,828 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:56,828 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:56,839 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:57,467 INFO ]: Checked inductivity of 70 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:57,467 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:57,467 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:57,473 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:54:57,508 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:54:57,509 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:57,512 INFO ]: Computing forward predicates... [2018-06-26 17:54:58,155 INFO ]: Checked inductivity of 70 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-06-26 17:54:58,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:58,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-26 17:54:58,174 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:54:58,174 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:54:58,174 INFO ]: CoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:54:58,174 INFO ]: Start difference. First operand 29 states and 32 transitions. Second operand 25 states. [2018-06-26 17:54:58,378 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:58,378 INFO ]: Finished difference Result 36 states and 39 transitions. [2018-06-26 17:54:58,378 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:54:58,378 INFO ]: Start accepts. Automaton has 25 states. Word has length 26 [2018-06-26 17:54:58,378 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:58,378 INFO ]: With dead ends: 36 [2018-06-26 17:54:58,378 INFO ]: Without dead ends: 36 [2018-06-26 17:54:58,379 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=311, Invalid=745, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:54:58,379 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:54:58,380 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 28. [2018-06-26 17:54:58,380 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:54:58,380 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-26 17:54:58,381 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-06-26 17:54:58,381 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:58,381 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-26 17:54:58,381 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:54:58,381 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-26 17:54:58,381 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:54:58,381 INFO ]: Found error trace [2018-06-26 17:54:58,381 INFO ]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:58,383 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:58,383 INFO ]: Analyzing trace with hash -1550269219, now seen corresponding path program 22 times [2018-06-26 17:54:58,383 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:58,383 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:58,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:58,383 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:58,383 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:58,396 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:59,031 INFO ]: Checked inductivity of 77 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:59,031 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:54:59,031 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:54:59,036 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:54:59,070 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:54:59,070 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:54:59,073 INFO ]: Computing forward predicates... [2018-06-26 17:54:59,174 INFO ]: Checked inductivity of 77 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:54:59,193 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:54:59,193 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2018-06-26 17:54:59,193 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:54:59,193 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:54:59,193 INFO ]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:54:59,193 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 26 states. [2018-06-26 17:54:59,308 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:54:59,308 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-26 17:54:59,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:54:59,308 INFO ]: Start accepts. Automaton has 26 states. Word has length 27 [2018-06-26 17:54:59,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:54:59,309 INFO ]: With dead ends: 37 [2018-06-26 17:54:59,309 INFO ]: Without dead ends: 29 [2018-06-26 17:54:59,309 INFO ]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=310, Invalid=812, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:54:59,309 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:54:59,311 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:54:59,311 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:54:59,311 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-06-26 17:54:59,311 INFO ]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2018-06-26 17:54:59,311 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:54:59,311 INFO ]: Abstraction has 29 states and 31 transitions. [2018-06-26 17:54:59,311 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:54:59,311 INFO ]: Start isEmpty. Operand 29 states and 31 transitions. [2018-06-26 17:54:59,312 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:54:59,312 INFO ]: Found error trace [2018-06-26 17:54:59,312 INFO ]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:54:59,312 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:54:59,312 INFO ]: Analyzing trace with hash 152864150, now seen corresponding path program 23 times [2018-06-26 17:54:59,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:54:59,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:54:59,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:59,312 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:54:59,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:54:59,332 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:00,679 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:55:00,679 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:00,679 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:00,685 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:00,729 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 17:55:00,729 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:00,734 INFO ]: Computing forward predicates... [2018-06-26 17:55:01,690 INFO ]: Checked inductivity of 84 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:55:01,709 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:01,709 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-06-26 17:55:01,709 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:55:01,709 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:55:01,710 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1115, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:55:01,710 INFO ]: Start difference. First operand 29 states and 31 transitions. Second operand 35 states. [2018-06-26 17:55:02,229 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:02,229 INFO ]: Finished difference Result 48 states and 53 transitions. [2018-06-26 17:55:02,230 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-06-26 17:55:02,230 INFO ]: Start accepts. Automaton has 35 states. Word has length 28 [2018-06-26 17:55:02,230 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:02,230 INFO ]: With dead ends: 48 [2018-06-26 17:55:02,230 INFO ]: Without dead ends: 48 [2018-06-26 17:55:02,231 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:55:02,231 INFO ]: Start minimizeSevpa. Operand 48 states. [2018-06-26 17:55:02,233 INFO ]: Finished minimizeSevpa. Reduced states from 48 to 31. [2018-06-26 17:55:02,233 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:55:02,234 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-06-26 17:55:02,234 INFO ]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 28 [2018-06-26 17:55:02,234 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:02,234 INFO ]: Abstraction has 31 states and 34 transitions. [2018-06-26 17:55:02,234 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:55:02,234 INFO ]: Start isEmpty. Operand 31 states and 34 transitions. [2018-06-26 17:55:02,234 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:55:02,234 INFO ]: Found error trace [2018-06-26 17:55:02,234 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:02,234 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:02,234 INFO ]: Analyzing trace with hash 1410391037, now seen corresponding path program 24 times [2018-06-26 17:55:02,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:02,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:02,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:02,235 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:02,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:02,253 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:02,739 INFO ]: Checked inductivity of 92 backedges. 21 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:55:02,739 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:02,740 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:02,746 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:02,784 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 17:55:02,784 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:02,786 INFO ]: Computing forward predicates... [2018-06-26 17:55:03,026 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:55:03,045 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:03,045 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 36 [2018-06-26 17:55:03,045 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:55:03,045 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:55:03,046 INFO ]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:55:03,046 INFO ]: Start difference. First operand 31 states and 34 transitions. Second operand 36 states. [2018-06-26 17:55:03,755 WARN ]: Spent 399.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-06-26 17:55:04,323 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:04,324 INFO ]: Finished difference Result 59 states and 65 transitions. [2018-06-26 17:55:04,324 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-06-26 17:55:04,324 INFO ]: Start accepts. Automaton has 36 states. Word has length 29 [2018-06-26 17:55:04,324 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:04,324 INFO ]: With dead ends: 59 [2018-06-26 17:55:04,324 INFO ]: Without dead ends: 41 [2018-06-26 17:55:04,325 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=967, Invalid=3065, Unknown=0, NotChecked=0, Total=4032 [2018-06-26 17:55:04,325 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:55:04,326 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-06-26 17:55:04,326 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:55:04,327 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2018-06-26 17:55:04,327 INFO ]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2018-06-26 17:55:04,327 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:04,327 INFO ]: Abstraction has 32 states and 35 transitions. [2018-06-26 17:55:04,327 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:55:04,327 INFO ]: Start isEmpty. Operand 32 states and 35 transitions. [2018-06-26 17:55:04,328 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:55:04,328 INFO ]: Found error trace [2018-06-26 17:55:04,328 INFO ]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:04,328 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:04,328 INFO ]: Analyzing trace with hash -1604456742, now seen corresponding path program 25 times [2018-06-26 17:55:04,328 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:04,328 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:04,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:04,328 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:04,328 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:04,340 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:04,504 INFO ]: Checked inductivity of 92 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:55:04,504 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:04,504 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:04,516 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:04,560 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:04,563 INFO ]: Computing forward predicates... [2018-06-26 17:55:05,064 INFO ]: Checked inductivity of 92 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-06-26 17:55:05,085 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:05,085 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-26 17:55:05,085 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:55:05,085 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:55:05,085 INFO ]: CoverageRelationStatistics Valid=174, Invalid=582, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:55:05,085 INFO ]: Start difference. First operand 32 states and 35 transitions. Second operand 28 states. [2018-06-26 17:55:05,282 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:05,282 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-26 17:55:05,308 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:55:05,308 INFO ]: Start accepts. Automaton has 28 states. Word has length 29 [2018-06-26 17:55:05,308 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:05,309 INFO ]: With dead ends: 40 [2018-06-26 17:55:05,309 INFO ]: Without dead ends: 40 [2018-06-26 17:55:05,309 INFO ]: 0 DeclaredPredicates, 63 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=942, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:55:05,309 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:55:05,310 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 31. [2018-06-26 17:55:05,310 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:55:05,311 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-06-26 17:55:05,311 INFO ]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 29 [2018-06-26 17:55:05,311 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:05,311 INFO ]: Abstraction has 31 states and 33 transitions. [2018-06-26 17:55:05,311 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:55:05,311 INFO ]: Start isEmpty. Operand 31 states and 33 transitions. [2018-06-26 17:55:05,311 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:55:05,311 INFO ]: Found error trace [2018-06-26 17:55:05,311 INFO ]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:05,311 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:05,311 INFO ]: Analyzing trace with hash 1801214171, now seen corresponding path program 26 times [2018-06-26 17:55:05,312 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:05,312 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:05,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:05,312 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:05,312 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:05,325 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:06,045 INFO ]: Checked inductivity of 100 backedges. 29 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:55:06,045 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:06,045 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:06,051 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:06,090 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:06,090 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:06,093 INFO ]: Computing forward predicates... [2018-06-26 17:55:06,564 INFO ]: Checked inductivity of 100 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:55:06,585 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:06,585 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-06-26 17:55:06,585 INFO ]: Interpolant automaton has 36 states [2018-06-26 17:55:06,585 INFO ]: Constructing interpolant automaton starting with 36 interpolants. [2018-06-26 17:55:06,586 INFO ]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:55:06,586 INFO ]: Start difference. First operand 31 states and 33 transitions. Second operand 36 states. [2018-06-26 17:55:06,911 WARN ]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-06-26 17:55:07,529 WARN ]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-06-26 17:55:07,696 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:07,696 INFO ]: Finished difference Result 41 states and 44 transitions. [2018-06-26 17:55:07,696 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:55:07,696 INFO ]: Start accepts. Automaton has 36 states. Word has length 30 [2018-06-26 17:55:07,696 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:07,697 INFO ]: With dead ends: 41 [2018-06-26 17:55:07,697 INFO ]: Without dead ends: 32 [2018-06-26 17:55:07,697 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=659, Invalid=2203, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 17:55:07,697 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:55:07,698 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:55:07,698 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:55:07,699 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-26 17:55:07,699 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-06-26 17:55:07,699 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:07,699 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-26 17:55:07,699 INFO ]: Interpolant automaton has 36 states. [2018-06-26 17:55:07,699 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-26 17:55:07,699 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:55:07,699 INFO ]: Found error trace [2018-06-26 17:55:07,699 INFO ]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:07,699 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:07,700 INFO ]: Analyzing trace with hash -91015076, now seen corresponding path program 27 times [2018-06-26 17:55:07,700 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:07,700 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:07,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:07,700 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:07,700 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:07,716 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:08,105 INFO ]: Checked inductivity of 108 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:55:08,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:08,106 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:08,111 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:08,155 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:55:08,155 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:08,161 INFO ]: Computing forward predicates... [2018-06-26 17:55:09,271 INFO ]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:09,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:09,292 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 29] total 48 [2018-06-26 17:55:09,292 INFO ]: Interpolant automaton has 48 states [2018-06-26 17:55:09,292 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-26 17:55:09,292 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2154, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 17:55:09,292 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 48 states. [2018-06-26 17:55:10,593 WARN ]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-06-26 17:55:11,541 WARN ]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-06-26 17:55:12,374 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:12,374 INFO ]: Finished difference Result 63 states and 69 transitions. [2018-06-26 17:55:12,374 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-06-26 17:55:12,374 INFO ]: Start accepts. Automaton has 48 states. Word has length 31 [2018-06-26 17:55:12,374 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:12,375 INFO ]: With dead ends: 63 [2018-06-26 17:55:12,375 INFO ]: Without dead ends: 53 [2018-06-26 17:55:12,376 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=471, Invalid=4221, Unknown=0, NotChecked=0, Total=4692 [2018-06-26 17:55:12,376 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 17:55:12,377 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-06-26 17:55:12,377 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:55:12,378 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-06-26 17:55:12,378 INFO ]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 31 [2018-06-26 17:55:12,378 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:12,378 INFO ]: Abstraction has 34 states and 37 transitions. [2018-06-26 17:55:12,378 INFO ]: Interpolant automaton has 48 states. [2018-06-26 17:55:12,378 INFO ]: Start isEmpty. Operand 34 states and 37 transitions. [2018-06-26 17:55:12,378 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:55:12,378 INFO ]: Found error trace [2018-06-26 17:55:12,378 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:12,379 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:12,379 INFO ]: Analyzing trace with hash 1379420411, now seen corresponding path program 28 times [2018-06-26 17:55:12,379 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:12,379 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:12,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:12,379 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:12,379 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:12,390 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:13,094 INFO ]: Checked inductivity of 117 backedges. 28 proven. 53 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:55:13,094 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:13,094 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:13,100 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:13,139 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:13,139 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:13,142 INFO ]: Computing forward predicates... [2018-06-26 17:55:13,396 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:55:13,416 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:13,416 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 34 [2018-06-26 17:55:13,416 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:55:13,416 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:55:13,416 INFO ]: CoverageRelationStatistics Valid=239, Invalid=883, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:55:13,416 INFO ]: Start difference. First operand 34 states and 37 transitions. Second operand 34 states. [2018-06-26 17:55:13,598 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:13,598 INFO ]: Finished difference Result 52 states and 56 transitions. [2018-06-26 17:55:13,599 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:55:13,599 INFO ]: Start accepts. Automaton has 34 states. Word has length 32 [2018-06-26 17:55:13,599 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:13,599 INFO ]: With dead ends: 52 [2018-06-26 17:55:13,599 INFO ]: Without dead ends: 33 [2018-06-26 17:55:13,599 INFO ]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=470, Invalid=1510, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:55:13,599 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:55:13,601 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:55:13,601 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:55:13,601 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-06-26 17:55:13,601 INFO ]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 32 [2018-06-26 17:55:13,601 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:13,601 INFO ]: Abstraction has 33 states and 35 transitions. [2018-06-26 17:55:13,601 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:55:13,601 INFO ]: Start isEmpty. Operand 33 states and 35 transitions. [2018-06-26 17:55:13,602 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:55:13,602 INFO ]: Found error trace [2018-06-26 17:55:13,602 INFO ]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:13,602 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:13,602 INFO ]: Analyzing trace with hash -1081337704, now seen corresponding path program 29 times [2018-06-26 17:55:13,602 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:13,602 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:13,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:13,602 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:13,602 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:13,614 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:14,102 INFO ]: Checked inductivity of 117 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:55:14,102 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:14,102 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:14,107 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:14,151 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 17:55:14,151 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:14,155 INFO ]: Computing forward predicates... [2018-06-26 17:55:14,299 INFO ]: Checked inductivity of 117 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-06-26 17:55:14,318 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:14,318 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-26 17:55:14,318 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:55:14,318 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:55:14,318 INFO ]: CoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:55:14,319 INFO ]: Start difference. First operand 33 states and 35 transitions. Second operand 31 states. [2018-06-26 17:55:14,501 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:14,501 INFO ]: Finished difference Result 34 states and 36 transitions. [2018-06-26 17:55:14,502 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:55:14,502 INFO ]: Start accepts. Automaton has 31 states. Word has length 32 [2018-06-26 17:55:14,502 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:14,502 INFO ]: With dead ends: 34 [2018-06-26 17:55:14,502 INFO ]: Without dead ends: 34 [2018-06-26 17:55:14,503 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:55:14,503 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:55:14,504 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:55:14,504 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:55:14,504 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-26 17:55:14,504 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2018-06-26 17:55:14,504 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:14,504 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-26 17:55:14,504 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:55:14,504 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-26 17:55:14,504 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:55:14,504 INFO ]: Found error trace [2018-06-26 17:55:14,504 INFO ]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:14,504 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:14,504 INFO ]: Analyzing trace with hash 838035165, now seen corresponding path program 30 times [2018-06-26 17:55:14,504 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:14,505 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:14,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:14,505 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:14,505 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:14,514 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:14,787 INFO ]: Checked inductivity of 126 backedges. 37 proven. 44 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:14,787 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:14,787 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:14,792 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:14,836 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 17:55:14,837 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:14,839 INFO ]: Computing forward predicates... [2018-06-26 17:55:15,117 INFO ]: Checked inductivity of 126 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:15,137 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:15,137 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2018-06-26 17:55:15,137 INFO ]: Interpolant automaton has 40 states [2018-06-26 17:55:15,137 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-26 17:55:15,137 INFO ]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:55:15,137 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 40 states. [2018-06-26 17:55:15,720 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:15,720 INFO ]: Finished difference Result 45 states and 48 transitions. [2018-06-26 17:55:15,720 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-06-26 17:55:15,720 INFO ]: Start accepts. Automaton has 40 states. Word has length 33 [2018-06-26 17:55:15,720 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:15,721 INFO ]: With dead ends: 45 [2018-06-26 17:55:15,721 INFO ]: Without dead ends: 35 [2018-06-26 17:55:15,721 INFO ]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=807, Invalid=2733, Unknown=0, NotChecked=0, Total=3540 [2018-06-26 17:55:15,721 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:55:15,723 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:55:15,723 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:55:15,723 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-06-26 17:55:15,723 INFO ]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2018-06-26 17:55:15,723 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:15,723 INFO ]: Abstraction has 35 states and 37 transitions. [2018-06-26 17:55:15,723 INFO ]: Interpolant automaton has 40 states. [2018-06-26 17:55:15,723 INFO ]: Start isEmpty. Operand 35 states and 37 transitions. [2018-06-26 17:55:15,723 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:55:15,723 INFO ]: Found error trace [2018-06-26 17:55:15,723 INFO ]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:15,724 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:15,724 INFO ]: Analyzing trace with hash 1594819606, now seen corresponding path program 31 times [2018-06-26 17:55:15,724 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:15,724 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:15,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:15,724 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:15,724 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:15,742 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:16,329 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:16,329 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:16,329 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:16,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:16,377 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:16,382 INFO ]: Computing forward predicates... [2018-06-26 17:55:17,111 INFO ]: Checked inductivity of 135 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:17,131 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:17,131 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 43 [2018-06-26 17:55:17,131 INFO ]: Interpolant automaton has 43 states [2018-06-26 17:55:17,131 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-26 17:55:17,131 INFO ]: CoverageRelationStatistics Valid=93, Invalid=1713, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:55:17,131 INFO ]: Start difference. First operand 35 states and 37 transitions. Second operand 43 states. [2018-06-26 17:55:17,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:17,918 INFO ]: Finished difference Result 58 states and 63 transitions. [2018-06-26 17:55:17,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-06-26 17:55:17,918 INFO ]: Start accepts. Automaton has 43 states. Word has length 34 [2018-06-26 17:55:17,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:17,919 INFO ]: With dead ends: 58 [2018-06-26 17:55:17,919 INFO ]: Without dead ends: 58 [2018-06-26 17:55:17,919 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=153, Invalid=2603, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 17:55:17,919 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 17:55:17,920 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 37. [2018-06-26 17:55:17,920 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:55:17,920 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-06-26 17:55:17,920 INFO ]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 34 [2018-06-26 17:55:17,920 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:17,920 INFO ]: Abstraction has 37 states and 40 transitions. [2018-06-26 17:55:17,921 INFO ]: Interpolant automaton has 43 states. [2018-06-26 17:55:17,921 INFO ]: Start isEmpty. Operand 37 states and 40 transitions. [2018-06-26 17:55:17,921 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:55:17,921 INFO ]: Found error trace [2018-06-26 17:55:17,921 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:17,921 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:17,921 INFO ]: Analyzing trace with hash -714666499, now seen corresponding path program 32 times [2018-06-26 17:55:17,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:17,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:17,921 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:17,921 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:17,922 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:17,933 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:18,236 INFO ]: Checked inductivity of 145 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:18,236 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:18,236 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:18,241 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:18,284 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:18,284 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:18,287 INFO ]: Computing forward predicates... [2018-06-26 17:55:18,682 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:18,700 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:18,701 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2018-06-26 17:55:18,701 INFO ]: Interpolant automaton has 44 states [2018-06-26 17:55:18,701 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-26 17:55:18,701 INFO ]: CoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 17:55:18,701 INFO ]: Start difference. First operand 37 states and 40 transitions. Second operand 44 states. [2018-06-26 17:55:20,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:20,010 INFO ]: Finished difference Result 71 states and 77 transitions. [2018-06-26 17:55:20,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-06-26 17:55:20,010 INFO ]: Start accepts. Automaton has 44 states. Word has length 35 [2018-06-26 17:55:20,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:20,010 INFO ]: With dead ends: 71 [2018-06-26 17:55:20,010 INFO ]: Without dead ends: 49 [2018-06-26 17:55:20,011 INFO ]: 0 DeclaredPredicates, 101 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1423, Invalid=4583, Unknown=0, NotChecked=0, Total=6006 [2018-06-26 17:55:20,011 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 17:55:20,012 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-06-26 17:55:20,012 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:55:20,012 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-06-26 17:55:20,012 INFO ]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2018-06-26 17:55:20,012 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:20,012 INFO ]: Abstraction has 38 states and 41 transitions. [2018-06-26 17:55:20,012 INFO ]: Interpolant automaton has 44 states. [2018-06-26 17:55:20,013 INFO ]: Start isEmpty. Operand 38 states and 41 transitions. [2018-06-26 17:55:20,013 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:55:20,013 INFO ]: Found error trace [2018-06-26 17:55:20,013 INFO ]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:20,013 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:20,013 INFO ]: Analyzing trace with hash 1023765082, now seen corresponding path program 33 times [2018-06-26 17:55:20,013 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:20,013 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:20,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:20,013 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:20,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:20,024 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:20,284 INFO ]: Checked inductivity of 145 backedges. 46 proven. 54 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:20,284 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:20,284 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:20,289 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:20,338 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:55:20,338 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:20,341 INFO ]: Computing forward predicates... [2018-06-26 17:55:20,533 INFO ]: Checked inductivity of 145 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-06-26 17:55:20,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:20,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 35 [2018-06-26 17:55:20,552 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:55:20,552 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:55:20,552 INFO ]: CoverageRelationStatistics Valid=203, Invalid=987, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:55:20,552 INFO ]: Start difference. First operand 38 states and 41 transitions. Second operand 35 states. [2018-06-26 17:55:21,258 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:21,258 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-26 17:55:21,258 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-06-26 17:55:21,258 INFO ]: Start accepts. Automaton has 35 states. Word has length 35 [2018-06-26 17:55:21,258 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:21,258 INFO ]: With dead ends: 49 [2018-06-26 17:55:21,258 INFO ]: Without dead ends: 38 [2018-06-26 17:55:21,259 INFO ]: 0 DeclaredPredicates, 98 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=3144, Unknown=0, NotChecked=0, Total=4422 [2018-06-26 17:55:21,259 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:55:21,260 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:55:21,260 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:55:21,260 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-26 17:55:21,260 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-26 17:55:21,260 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:21,260 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-26 17:55:21,260 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:55:21,260 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-26 17:55:21,260 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:55:21,260 INFO ]: Found error trace [2018-06-26 17:55:21,261 INFO ]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:21,261 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:21,261 INFO ]: Analyzing trace with hash 292356956, now seen corresponding path program 34 times [2018-06-26 17:55:21,261 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:21,261 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:21,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:21,261 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:21,261 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:21,282 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:21,880 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:21,880 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:21,880 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:21,886 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:21,935 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:21,935 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:21,942 INFO ]: Computing forward predicates... [2018-06-26 17:55:22,852 INFO ]: Checked inductivity of 165 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:22,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:22,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 47 [2018-06-26 17:55:22,871 INFO ]: Interpolant automaton has 47 states [2018-06-26 17:55:22,872 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-26 17:55:22,872 INFO ]: CoverageRelationStatistics Valid=102, Invalid=2060, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 17:55:22,872 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 47 states. [2018-06-26 17:55:23,769 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:23,769 INFO ]: Finished difference Result 63 states and 68 transitions. [2018-06-26 17:55:23,769 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-06-26 17:55:23,769 INFO ]: Start accepts. Automaton has 47 states. Word has length 37 [2018-06-26 17:55:23,769 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:23,769 INFO ]: With dead ends: 63 [2018-06-26 17:55:23,769 INFO ]: Without dead ends: 63 [2018-06-26 17:55:23,770 INFO ]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=3138, Unknown=0, NotChecked=0, Total=3306 [2018-06-26 17:55:23,770 INFO ]: Start minimizeSevpa. Operand 63 states. [2018-06-26 17:55:23,770 INFO ]: Finished minimizeSevpa. Reduced states from 63 to 40. [2018-06-26 17:55:23,770 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:55:23,771 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-06-26 17:55:23,771 INFO ]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 37 [2018-06-26 17:55:23,771 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:23,771 INFO ]: Abstraction has 40 states and 43 transitions. [2018-06-26 17:55:23,771 INFO ]: Interpolant automaton has 47 states. [2018-06-26 17:55:23,771 INFO ]: Start isEmpty. Operand 40 states and 43 transitions. [2018-06-26 17:55:23,771 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:55:23,771 INFO ]: Found error trace [2018-06-26 17:55:23,771 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:23,771 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:23,771 INFO ]: Analyzing trace with hash 482020731, now seen corresponding path program 35 times [2018-06-26 17:55:23,771 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:23,771 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:23,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:23,772 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:23,772 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:23,785 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:24,106 INFO ]: Checked inductivity of 176 backedges. 45 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:24,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:24,106 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-26 17:55:24,116 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:24,174 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:55:24,174 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:24,178 INFO ]: Computing forward predicates... [2018-06-26 17:55:24,570 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:24,589 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:24,589 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 48 [2018-06-26 17:55:24,589 INFO ]: Interpolant automaton has 48 states [2018-06-26 17:55:24,589 INFO ]: Constructing interpolant automaton starting with 48 interpolants. [2018-06-26 17:55:24,590 INFO ]: CoverageRelationStatistics Valid=303, Invalid=1953, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 17:55:24,590 INFO ]: Start difference. First operand 40 states and 43 transitions. Second operand 48 states. [2018-06-26 17:55:25,875 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:25,875 INFO ]: Finished difference Result 77 states and 83 transitions. [2018-06-26 17:55:25,876 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-06-26 17:55:25,876 INFO ]: Start accepts. Automaton has 48 states. Word has length 38 [2018-06-26 17:55:25,876 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:25,876 INFO ]: With dead ends: 77 [2018-06-26 17:55:25,876 INFO ]: Without dead ends: 53 [2018-06-26 17:55:25,877 INFO ]: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1234 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1684, Invalid=5456, Unknown=0, NotChecked=0, Total=7140 [2018-06-26 17:55:25,877 INFO ]: Start minimizeSevpa. Operand 53 states. [2018-06-26 17:55:25,878 INFO ]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-06-26 17:55:25,878 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:55:25,878 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-06-26 17:55:25,878 INFO ]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2018-06-26 17:55:25,878 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:25,878 INFO ]: Abstraction has 41 states and 44 transitions. [2018-06-26 17:55:25,878 INFO ]: Interpolant automaton has 48 states. [2018-06-26 17:55:25,878 INFO ]: Start isEmpty. Operand 41 states and 44 transitions. [2018-06-26 17:55:25,878 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:55:25,878 INFO ]: Found error trace [2018-06-26 17:55:25,878 INFO ]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:25,878 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:25,879 INFO ]: Analyzing trace with hash 372491928, now seen corresponding path program 36 times [2018-06-26 17:55:25,879 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:25,879 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:25,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:25,879 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:25,879 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:25,892 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:26,231 INFO ]: Checked inductivity of 176 backedges. 56 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:26,231 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:26,231 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-26 17:55:26,236 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:26,289 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:55:26,289 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:26,292 INFO ]: Computing forward predicates... [2018-06-26 17:55:26,533 INFO ]: Checked inductivity of 176 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-06-26 17:55:26,552 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:26,552 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 38 [2018-06-26 17:55:26,552 INFO ]: Interpolant automaton has 38 states [2018-06-26 17:55:26,552 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 17:55:26,552 INFO ]: CoverageRelationStatistics Valid=239, Invalid=1167, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:55:26,552 INFO ]: Start difference. First operand 41 states and 44 transitions. Second operand 38 states. [2018-06-26 17:55:27,284 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:27,284 INFO ]: Finished difference Result 53 states and 56 transitions. [2018-06-26 17:55:27,284 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-06-26 17:55:27,284 INFO ]: Start accepts. Automaton has 38 states. Word has length 38 [2018-06-26 17:55:27,284 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:27,284 INFO ]: With dead ends: 53 [2018-06-26 17:55:27,284 INFO ]: Without dead ends: 41 [2018-06-26 17:55:27,285 INFO ]: 0 DeclaredPredicates, 107 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1514, Invalid=3742, Unknown=0, NotChecked=0, Total=5256 [2018-06-26 17:55:27,285 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:55:27,286 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:55:27,286 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:55:27,286 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-06-26 17:55:27,286 INFO ]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-06-26 17:55:27,286 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:27,286 INFO ]: Abstraction has 41 states and 43 transitions. [2018-06-26 17:55:27,286 INFO ]: Interpolant automaton has 38 states. [2018-06-26 17:55:27,286 INFO ]: Start isEmpty. Operand 41 states and 43 transitions. [2018-06-26 17:55:27,286 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:55:27,287 INFO ]: Found error trace [2018-06-26 17:55:27,287 INFO ]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:27,287 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:27,287 INFO ]: Analyzing trace with hash 1757803158, now seen corresponding path program 37 times [2018-06-26 17:55:27,287 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:27,287 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:27,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,287 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:27,287 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,309 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:28,203 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:28,203 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:28,203 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-26 17:55:28,208 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:28,260 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:28,268 INFO ]: Computing forward predicates... [2018-06-26 17:55:29,205 INFO ]: Checked inductivity of 198 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:29,224 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:29,224 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 51 [2018-06-26 17:55:29,224 INFO ]: Interpolant automaton has 51 states [2018-06-26 17:55:29,224 INFO ]: Constructing interpolant automaton starting with 51 interpolants. [2018-06-26 17:55:29,224 INFO ]: CoverageRelationStatistics Valid=111, Invalid=2439, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 17:55:29,225 INFO ]: Start difference. First operand 41 states and 43 transitions. Second operand 51 states. [2018-06-26 17:55:30,176 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:30,176 INFO ]: Finished difference Result 68 states and 73 transitions. [2018-06-26 17:55:30,176 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-06-26 17:55:30,177 INFO ]: Start accepts. Automaton has 51 states. Word has length 40 [2018-06-26 17:55:30,177 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:30,177 INFO ]: With dead ends: 68 [2018-06-26 17:55:30,177 INFO ]: Without dead ends: 68 [2018-06-26 17:55:30,177 INFO ]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-06-26 17:55:30,177 INFO ]: Start minimizeSevpa. Operand 68 states. [2018-06-26 17:55:30,178 INFO ]: Finished minimizeSevpa. Reduced states from 68 to 43. [2018-06-26 17:55:30,178 INFO ]: Start removeUnreachable. Operand 43 states. [2018-06-26 17:55:30,178 INFO ]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-06-26 17:55:30,178 INFO ]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2018-06-26 17:55:30,179 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:30,179 INFO ]: Abstraction has 43 states and 46 transitions. [2018-06-26 17:55:30,179 INFO ]: Interpolant automaton has 51 states. [2018-06-26 17:55:30,179 INFO ]: Start isEmpty. Operand 43 states and 46 transitions. [2018-06-26 17:55:30,179 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 17:55:30,179 INFO ]: Found error trace [2018-06-26 17:55:30,179 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:30,179 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:30,179 INFO ]: Analyzing trace with hash -1060065283, now seen corresponding path program 38 times [2018-06-26 17:55:30,179 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:30,179 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:30,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:30,180 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:30,180 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:30,195 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:30,625 INFO ]: Checked inductivity of 210 backedges. 55 proven. 89 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:30,626 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:30,626 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-26 17:55:30,631 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:30,696 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:30,696 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:30,700 INFO ]: Computing forward predicates... [2018-06-26 17:55:31,188 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:31,207 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:31,207 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 52 [2018-06-26 17:55:31,207 INFO ]: Interpolant automaton has 52 states [2018-06-26 17:55:31,207 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-26 17:55:31,208 INFO ]: CoverageRelationStatistics Valid=354, Invalid=2298, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 17:55:31,208 INFO ]: Start difference. First operand 43 states and 46 transitions. Second operand 52 states. [2018-06-26 17:55:32,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:32,704 INFO ]: Finished difference Result 83 states and 89 transitions. [2018-06-26 17:55:32,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-06-26 17:55:32,704 INFO ]: Start accepts. Automaton has 52 states. Word has length 41 [2018-06-26 17:55:32,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:32,704 INFO ]: With dead ends: 83 [2018-06-26 17:55:32,705 INFO ]: Without dead ends: 57 [2018-06-26 17:55:32,705 INFO ]: 0 DeclaredPredicates, 119 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1967, Invalid=6405, Unknown=0, NotChecked=0, Total=8372 [2018-06-26 17:55:32,705 INFO ]: Start minimizeSevpa. Operand 57 states. [2018-06-26 17:55:32,706 INFO ]: Finished minimizeSevpa. Reduced states from 57 to 44. [2018-06-26 17:55:32,706 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 17:55:32,706 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-06-26 17:55:32,706 INFO ]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2018-06-26 17:55:32,706 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:32,706 INFO ]: Abstraction has 44 states and 47 transitions. [2018-06-26 17:55:32,706 INFO ]: Interpolant automaton has 52 states. [2018-06-26 17:55:32,706 INFO ]: Start isEmpty. Operand 44 states and 47 transitions. [2018-06-26 17:55:32,707 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 17:55:32,707 INFO ]: Found error trace [2018-06-26 17:55:32,707 INFO ]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:32,707 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:32,707 INFO ]: Analyzing trace with hash 1056937434, now seen corresponding path program 39 times [2018-06-26 17:55:32,707 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:32,707 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:32,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:32,707 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:32,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:32,723 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:32,978 INFO ]: Checked inductivity of 210 backedges. 67 proven. 77 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:32,978 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:32,978 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-26 17:55:32,983 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:33,042 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:55:33,042 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:33,046 INFO ]: Computing forward predicates... [2018-06-26 17:55:33,298 INFO ]: Checked inductivity of 210 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-06-26 17:55:33,317 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:33,317 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 41 [2018-06-26 17:55:33,317 INFO ]: Interpolant automaton has 41 states [2018-06-26 17:55:33,317 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 17:55:33,317 INFO ]: CoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:55:33,317 INFO ]: Start difference. First operand 44 states and 47 transitions. Second operand 41 states. [2018-06-26 17:55:34,149 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:34,149 INFO ]: Finished difference Result 57 states and 60 transitions. [2018-06-26 17:55:34,149 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-06-26 17:55:34,149 INFO ]: Start accepts. Automaton has 41 states. Word has length 41 [2018-06-26 17:55:34,150 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:34,150 INFO ]: With dead ends: 57 [2018-06-26 17:55:34,150 INFO ]: Without dead ends: 44 [2018-06-26 17:55:34,150 INFO ]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=4392, Unknown=0, NotChecked=0, Total=6162 [2018-06-26 17:55:34,150 INFO ]: Start minimizeSevpa. Operand 44 states. [2018-06-26 17:55:34,151 INFO ]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-06-26 17:55:34,151 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 17:55:34,151 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-26 17:55:34,152 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-06-26 17:55:34,152 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:34,152 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-26 17:55:34,152 INFO ]: Interpolant automaton has 41 states. [2018-06-26 17:55:34,152 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-26 17:55:34,152 INFO ]: Finished isEmpty. Found accepting run of length 44 [2018-06-26 17:55:34,152 INFO ]: Found error trace [2018-06-26 17:55:34,152 INFO ]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:34,152 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:34,152 INFO ]: Analyzing trace with hash -2019582372, now seen corresponding path program 40 times [2018-06-26 17:55:34,152 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:34,152 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:34,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:34,153 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:34,153 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:34,169 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:35,199 INFO ]: Checked inductivity of 234 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-06-26 17:55:35,199 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:35,199 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-26 17:55:35,205 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:35,262 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:35,262 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:35,268 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 17:55:35,791 INFO ]: Timeout while computing interpolants [2018-06-26 17:55:35,991 WARN ]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:35,991 WARN ]: Verification canceled [2018-06-26 17:55:35,993 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:55:35,994 WARN ]: Timeout [2018-06-26 17:55:35,994 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:55:35 BasicIcfg [2018-06-26 17:55:35,994 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:55:35,994 INFO ]: Toolchain (without parser) took 58870.59 ms. Allocated memory was 309.3 MB in the beginning and 823.1 MB in the end (delta: 513.8 MB). Free memory was 265.6 MB in the beginning and 454.0 MB in the end (delta: -188.3 MB). Peak memory consumption was 325.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:35,995 INFO ]: SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:55:35,995 INFO ]: ChcToBoogie took 49.85 ms. Allocated memory is still 309.3 MB. Free memory was 264.6 MB in the beginning and 262.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:35,995 INFO ]: Boogie Preprocessor took 40.05 ms. Allocated memory is still 309.3 MB. Free memory was 262.6 MB in the beginning and 261.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. [2018-06-26 17:55:35,995 INFO ]: RCFGBuilder took 330.73 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 252.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:35,996 INFO ]: BlockEncodingV2 took 102.38 ms. Allocated memory is still 309.3 MB. Free memory was 252.6 MB in the beginning and 249.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:35,996 INFO ]: TraceAbstraction took 58328.45 ms. Allocated memory was 309.3 MB in the beginning and 823.1 MB in the end (delta: 513.8 MB). Free memory was 249.6 MB in the beginning and 454.0 MB in the end (delta: -204.4 MB). Peak memory consumption was 309.5 MB. Max. memory is 3.6 GB. [2018-06-26 17:55:35,999 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 14 locations, 16 edges - StatisticsResult: Encoded RCFG 8 locations, 10 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.06 ms. Allocated memory is still 309.3 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 49.85 ms. Allocated memory is still 309.3 MB. Free memory was 264.6 MB in the beginning and 262.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 40.05 ms. Allocated memory is still 309.3 MB. Free memory was 262.6 MB in the beginning and 261.6 MB in the end (delta: 996.2 kB). Peak memory consumption was 996.2 kB. Max. memory is 3.6 GB. * RCFGBuilder took 330.73 ms. Allocated memory is still 309.3 MB. Free memory was 261.6 MB in the beginning and 252.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 102.38 ms. Allocated memory is still 309.3 MB. Free memory was 252.6 MB in the beginning and 249.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 58328.45 ms. Allocated memory was 309.3 MB in the beginning and 823.1 MB in the end (delta: 513.8 MB). Free memory was 249.6 MB in the beginning and 454.0 MB in the end (delta: -204.4 MB). Peak memory consumption was 309.5 MB. Max. memory is 3.6 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [UNKNOWN] : Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while BasicCegarLoop was analyzing trace of length 44 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 43 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 8 locations, 1 error locations. TIMEOUT Result, 58.2s OverallTime, 44 OverallIterations, 12 TraceHistogramMax, 23.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 272 SDtfs, 917 SDslu, 3828 SDs, 0 SdLazy, 10687 SolverSat, 1871 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2438 GetRequests, 804 SyntacticMatches, 0 SemanticMatches, 1634 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14046 ImplicationChecksByTransitivity, 42.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 43 MinimizatonAttempts, 258 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 2004 NumberOfCodeBlocks, 2004 NumberOfCodeBlocksAsserted, 158 NumberOfCheckSat, 1921 ConstructedInterpolants, 75 QuantifiedInterpolants, 312519 SizeOfPredicates, 271 NumberOfNonLiveVariables, 12674 ConjunctsInSsa, 2916 ConjunctsInUnsatCore, 83 InterpolantComputations, 4 PerfectInterpolantSequences, 3412/6163 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/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-55-36-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-55-36-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-55-36-008.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/square_twice_safe_weaved.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-55-36-008.csv Completed graceful shutdown