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/upcount_merged_safe.c-1.smt2 -------------------------------------------------------------------------------- This is Ultimate 0.1.23-62c3406-m [2018-06-26 17:55:21,610 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-06-26 17:55:21,612 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-06-26 17:55:21,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-06-26 17:55:21,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-06-26 17:55:21,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-06-26 17:55:21,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-06-26 17:55:21,634 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-06-26 17:55:21,636 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-06-26 17:55:21,637 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-06-26 17:55:21,637 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-06-26 17:55:21,638 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-06-26 17:55:21,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-06-26 17:55:21,641 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-06-26 17:55:21,642 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-06-26 17:55:21,643 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-06-26 17:55:21,645 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-06-26 17:55:21,647 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-06-26 17:55:21,657 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-06-26 17:55:21,659 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-06-26 17:55:21,660 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-06-26 17:55:21,661 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-06-26 17:55:21,663 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-06-26 17:55:21,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-06-26 17:55:21,666 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-06-26 17:55:21,667 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-06-26 17:55:21,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-06-26 17:55:21,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-06-26 17:55:21,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-06-26 17:55:21,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-06-26 17:55:21,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-06-26 17:55:21,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-06-26 17:55:21,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-06-26 17:55:21,673 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-06-26 17:55:21,674 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-06-26 17:55:21,674 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-06-26 17:55:21,676 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:55:21,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-06-26 17:55:21,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-06-26 17:55:21,694 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-06-26 17:55:21,694 INFO L133 SettingsManager]: * Logger pattern=[%d{ISO8601} %-5p]: %m%n [2018-06-26 17:55:21,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-06-26 17:55:21,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-06-26 17:55:21,695 INFO L133 SettingsManager]: * Create interprocedural compositions=false [2018-06-26 17:55:21,695 INFO L133 SettingsManager]: * Use SBE=true [2018-06-26 17:55:21,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-06-26 17:55:21,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-06-26 17:55:21,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-06-26 17:55:21,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-06-26 17:55:21,696 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-06-26 17:55:21,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-06-26 17:55:21,697 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-06-26 17:55:21,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-06-26 17:55:21,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-06-26 17:55:21,697 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-06-26 17:55:21,698 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-06-26 17:55:21,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-06-26 17:55:21,698 INFO L133 SettingsManager]: * Compute trace for counterexample result=false [2018-06-26 17:55:21,700 INFO L131 SettingsManager]: Preferences of SmtParser differ from their defaults: [2018-06-26 17:55:21,700 INFO L133 SettingsManager]: * Use TreeAutomizer as solver for the given file (assumes the file contains Horn clauses only).=true [2018-06-26 17:55:21,743 INFO ]: Repository-Root is: /tmp [2018-06-26 17:55:21,758 INFO ]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-06-26 17:55:21,762 INFO ]: [Toolchain 1]: Toolchain data selected. [2018-06-26 17:55:21,765 INFO ]: Initializing SmtParser... [2018-06-26 17:55:21,765 INFO ]: SmtParser initialized [2018-06-26 17:55:21,766 INFO ]: [Toolchain 1]: Parsing single file: /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 [2018-06-26 17:55:21,767 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:55:21,859 INFO ]: Executing SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 unknown [2018-06-26 17:55:22,038 INFO ]: Succesfully executed SMT file /storage/chc-comp/eldarica-misc/LIA/llreve/upcount_merged_safe.c-1.smt2 [2018-06-26 17:55:22,043 INFO ]: ####################### [Toolchain 1] ####################### [2018-06-26 17:55:22,050 INFO ]: Walking toolchain with 5 elements. [2018-06-26 17:55:22,050 INFO ]: ------------------------ChcToBoogie---------------------------- [2018-06-26 17:55:22,050 INFO ]: Initializing ChcToBoogie... [2018-06-26 17:55:22,050 INFO ]: ChcToBoogie initialized [2018-06-26 17:55:22,054 INFO ]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,108 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22 Unit [2018-06-26 17:55:22,108 INFO ]: ------------------------ END ChcToBoogie---------------------------- [2018-06-26 17:55:22,109 INFO ]: ------------------------Boogie Preprocessor---------------------------- [2018-06-26 17:55:22,109 INFO ]: Initializing Boogie Preprocessor... [2018-06-26 17:55:22,109 INFO ]: Boogie Preprocessor initialized [2018-06-26 17:55:22,131 INFO ]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,132 INFO ]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,137 INFO ]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,137 INFO ]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,139 INFO ]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,141 INFO ]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,141 INFO ]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,143 INFO ]: ------------------------ END Boogie Preprocessor---------------------------- [2018-06-26 17:55:22,143 INFO ]: ------------------------RCFGBuilder---------------------------- [2018-06-26 17:55:22,143 INFO ]: Initializing RCFGBuilder... [2018-06-26 17:55:22,143 INFO ]: RCFGBuilder initialized [2018-06-26 17:55:22,144 INFO ]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (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:55:22,159 INFO ]: Specification and implementation of procedure gotoProc given in one single declaration [2018-06-26 17:55:22,159 INFO ]: Found specification of procedure gotoProc [2018-06-26 17:55:22,159 INFO ]: Found implementation of procedure gotoProc [2018-06-26 17:55:22,159 INFO ]: Specification and implementation of procedure Ultimate.START given in one single declaration [2018-06-26 17:55:22,159 INFO ]: Found specification of procedure Ultimate.START [2018-06-26 17:55:22,159 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:55:22,429 INFO ]: Using library mode [2018-06-26 17:55:22,430 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:55:22 BoogieIcfgContainer [2018-06-26 17:55:22,430 INFO ]: ------------------------ END RCFGBuilder---------------------------- [2018-06-26 17:55:22,430 INFO ]: ------------------------BlockEncodingV2---------------------------- [2018-06-26 17:55:22,431 INFO ]: Initializing BlockEncodingV2... [2018-06-26 17:55:22,431 INFO ]: BlockEncodingV2 initialized [2018-06-26 17:55:22,438 INFO ]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:55:22" (1/1) ... [2018-06-26 17:55:22,460 INFO ]: Initial Icfg 13 locations, 14 edges [2018-06-26 17:55:22,465 INFO ]: Using Remove infeasible edges [2018-06-26 17:55:22,465 INFO ]: Using Maximize final states [2018-06-26 17:55:22,466 INFO ]: Using Minimize states even if more edges are added than removed.=false [2018-06-26 17:55:22,466 INFO ]: Using Minimize states using LBE with the strategy=MULTI [2018-06-26 17:55:22,467 INFO ]: Using Remove sink states [2018-06-26 17:55:22,472 INFO ]: Using Apply optimizations until nothing changes=true [2018-06-26 17:55:22,472 INFO ]: Using Use SBE [2018-06-26 17:55:22,478 INFO ]: SBE split 0 edges [2018-06-26 17:55:22,482 INFO ]: Removed 2 edges and 2 locations because of local infeasibility [2018-06-26 17:55:22,487 INFO ]: 0 new accepting states [2018-06-26 17:55:22,535 INFO ]: Removed 8 edges and 4 locations by large block encoding [2018-06-26 17:55:22,536 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:55:22,539 INFO ]: Removed 0 edges and 0 locations because of local infeasibility [2018-06-26 17:55:22,539 INFO ]: 0 new accepting states [2018-06-26 17:55:22,540 INFO ]: Removed 0 edges and 0 locations by large block encoding [2018-06-26 17:55:22,540 INFO ]: Removed 0 edges and 0 locations by removing sink states [2018-06-26 17:55:22,540 INFO ]: Encoded RCFG 7 locations, 8 edges [2018-06-26 17:55:22,540 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:55:22 BasicIcfg [2018-06-26 17:55:22,540 INFO ]: ------------------------ END BlockEncodingV2---------------------------- [2018-06-26 17:55:22,541 INFO ]: ------------------------TraceAbstraction---------------------------- [2018-06-26 17:55:22,541 INFO ]: Initializing TraceAbstraction... [2018-06-26 17:55:22,544 INFO ]: TraceAbstraction initialized [2018-06-26 17:55:22,545 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 26.06 05:55:22" (1/4) ... [2018-06-26 17:55:22,545 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752bf8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 26.06 05:55:22, skipping insertion in model container [2018-06-26 17:55:22,546 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 26.06 05:55:22" (2/4) ... [2018-06-26 17:55:22,546 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752bf8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.06 05:55:22, skipping insertion in model container [2018-06-26 17:55:22,546 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.06 05:55:22" (3/4) ... [2018-06-26 17:55:22,546 INFO ]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752bf8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:55:22, skipping insertion in model container [2018-06-26 17:55:22,546 INFO ]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 26.06 05:55:22" (4/4) ... [2018-06-26 17:55:22,548 INFO ]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver_BEv2 [2018-06-26 17:55:22,566 INFO ]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-06-26 17:55:22,575 INFO ]: Appying trace abstraction to program that has 1 error locations. [2018-06-26 17:55:22,607 INFO ]: Using default assertion order modulation [2018-06-26 17:55:22,608 INFO ]: Interprodecural is true [2018-06-26 17:55:22,608 INFO ]: Hoare is false [2018-06-26 17:55:22,608 INFO ]: Compute interpolants for FPandBP [2018-06-26 17:55:22,608 INFO ]: Backedges is TWOTRACK [2018-06-26 17:55:22,608 INFO ]: Determinization is PREDICATE_ABSTRACTION [2018-06-26 17:55:22,608 INFO ]: Difference is false [2018-06-26 17:55:22,608 INFO ]: Minimize is MINIMIZE_SEVPA [2018-06-26 17:55:22,608 INFO ]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-06-26 17:55:22,622 INFO ]: Start isEmpty. Operand 7 states. [2018-06-26 17:55:22,635 INFO ]: Finished isEmpty. Found accepting run of length 7 [2018-06-26 17:55:22,635 INFO ]: Found error trace [2018-06-26 17:55:22,636 INFO ]: trace histogram [1, 1, 1, 1, 1, 1] [2018-06-26 17:55:22,636 INFO ]: === Iteration 1 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:22,641 INFO ]: Analyzing trace with hash 987439445, now seen corresponding path program 1 times [2018-06-26 17:55:22,643 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:22,643 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:22,673 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:22,674 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:22,674 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:22,722 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:22,817 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:55:22,820 INFO ]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-06-26 17:55:22,820 INFO ]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-06-26 17:55:22,822 INFO ]: Interpolant automaton has 4 states [2018-06-26 17:55:22,835 INFO ]: Constructing interpolant automaton starting with 4 interpolants. [2018-06-26 17:55:22,835 INFO ]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-06-26 17:55:22,837 INFO ]: Start difference. First operand 7 states. Second operand 4 states. [2018-06-26 17:55:22,922 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:22,922 INFO ]: Finished difference Result 8 states and 9 transitions. [2018-06-26 17:55:22,922 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-06-26 17:55:22,923 INFO ]: Start accepts. Automaton has 4 states. Word has length 6 [2018-06-26 17:55:22,923 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:22,929 INFO ]: With dead ends: 8 [2018-06-26 17:55:22,929 INFO ]: Without dead ends: 8 [2018-06-26 17:55:22,931 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:55:22,945 INFO ]: Start minimizeSevpa. Operand 8 states. [2018-06-26 17:55:22,962 INFO ]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-06-26 17:55:22,964 INFO ]: Start removeUnreachable. Operand 8 states. [2018-06-26 17:55:22,964 INFO ]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-06-26 17:55:22,966 INFO ]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-06-26 17:55:22,966 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:22,966 INFO ]: Abstraction has 8 states and 9 transitions. [2018-06-26 17:55:22,966 INFO ]: Interpolant automaton has 4 states. [2018-06-26 17:55:22,966 INFO ]: Start isEmpty. Operand 8 states and 9 transitions. [2018-06-26 17:55:22,966 INFO ]: Finished isEmpty. Found accepting run of length 8 [2018-06-26 17:55:22,966 INFO ]: Found error trace [2018-06-26 17:55:22,966 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:22,966 INFO ]: === Iteration 2 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:22,967 INFO ]: Analyzing trace with hash 545379014, now seen corresponding path program 1 times [2018-06-26 17:55:22,967 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:22,967 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:22,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:22,967 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:22,967 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:22,998 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:23,121 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:55:23,121 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:23,121 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:55:23,128 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:23,170 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:23,181 INFO ]: Computing forward predicates... [2018-06-26 17:55:23,322 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:55:23,342 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:23,342 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-06-26 17:55:23,343 INFO ]: Interpolant automaton has 6 states [2018-06-26 17:55:23,343 INFO ]: Constructing interpolant automaton starting with 6 interpolants. [2018-06-26 17:55:23,343 INFO ]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-06-26 17:55:23,343 INFO ]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2018-06-26 17:55:23,567 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:23,568 INFO ]: Finished difference Result 13 states and 16 transitions. [2018-06-26 17:55:23,568 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-06-26 17:55:23,568 INFO ]: Start accepts. Automaton has 6 states. Word has length 7 [2018-06-26 17:55:23,568 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:23,571 INFO ]: With dead ends: 13 [2018-06-26 17:55:23,571 INFO ]: Without dead ends: 13 [2018-06-26 17:55:23,571 INFO ]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-06-26 17:55:23,572 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:55:23,574 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-06-26 17:55:23,574 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:55:23,574 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-06-26 17:55:23,574 INFO ]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-06-26 17:55:23,574 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:23,574 INFO ]: Abstraction has 10 states and 12 transitions. [2018-06-26 17:55:23,574 INFO ]: Interpolant automaton has 6 states. [2018-06-26 17:55:23,574 INFO ]: Start isEmpty. Operand 10 states and 12 transitions. [2018-06-26 17:55:23,575 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:55:23,575 INFO ]: Found error trace [2018-06-26 17:55:23,575 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:23,575 INFO ]: === Iteration 3 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:23,575 INFO ]: Analyzing trace with hash -273592459, now seen corresponding path program 2 times [2018-06-26 17:55:23,575 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:23,575 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:23,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:23,576 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:23,576 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:23,599 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:23,889 INFO ]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:23,889 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:23,889 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:23,898 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:23,919 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:23,919 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:23,921 INFO ]: Computing forward predicates... [2018-06-26 17:55:24,091 INFO ]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:24,111 INFO ]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-06-26 17:55:24,111 INFO ]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-06-26 17:55:24,112 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:55:24,112 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:55:24,112 INFO ]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:55:24,112 INFO ]: Start difference. First operand 10 states and 12 transitions. Second operand 10 states. [2018-06-26 17:55:24,227 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:24,227 INFO ]: Finished difference Result 12 states and 14 transitions. [2018-06-26 17:55:24,227 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:55:24,227 INFO ]: Start accepts. Automaton has 10 states. Word has length 8 [2018-06-26 17:55:24,228 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:24,228 INFO ]: With dead ends: 12 [2018-06-26 17:55:24,228 INFO ]: Without dead ends: 9 [2018-06-26 17:55:24,228 INFO ]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:55:24,228 INFO ]: Start minimizeSevpa. Operand 9 states. [2018-06-26 17:55:24,229 INFO ]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-06-26 17:55:24,229 INFO ]: Start removeUnreachable. Operand 9 states. [2018-06-26 17:55:24,230 INFO ]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-06-26 17:55:24,230 INFO ]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-06-26 17:55:24,230 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:24,230 INFO ]: Abstraction has 9 states and 10 transitions. [2018-06-26 17:55:24,230 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:55:24,230 INFO ]: Start isEmpty. Operand 9 states and 10 transitions. [2018-06-26 17:55:24,230 INFO ]: Finished isEmpty. Found accepting run of length 9 [2018-06-26 17:55:24,230 INFO ]: Found error trace [2018-06-26 17:55:24,230 INFO ]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:24,230 INFO ]: === Iteration 4 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:24,234 INFO ]: Analyzing trace with hash -240345703, now seen corresponding path program 1 times [2018-06-26 17:55:24,234 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:24,234 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:24,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:24,235 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:24,235 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:24,259 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:24,328 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:24,328 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:24,328 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:55:24,334 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:24,355 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:24,356 INFO ]: Computing forward predicates... [2018-06-26 17:55:24,397 INFO ]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:24,418 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:24,418 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-06-26 17:55:24,418 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:55:24,418 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:55:24,418 INFO ]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:55:24,418 INFO ]: Start difference. First operand 9 states and 10 transitions. Second operand 7 states. [2018-06-26 17:55:24,586 WARN ]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-06-26 17:55:24,784 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:24,784 INFO ]: Finished difference Result 10 states and 11 transitions. [2018-06-26 17:55:24,785 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-06-26 17:55:24,785 INFO ]: Start accepts. Automaton has 7 states. Word has length 8 [2018-06-26 17:55:24,785 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:24,786 INFO ]: With dead ends: 10 [2018-06-26 17:55:24,786 INFO ]: Without dead ends: 10 [2018-06-26 17:55:24,786 INFO ]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:55:24,786 INFO ]: Start minimizeSevpa. Operand 10 states. [2018-06-26 17:55:24,787 INFO ]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-06-26 17:55:24,787 INFO ]: Start removeUnreachable. Operand 10 states. [2018-06-26 17:55:24,787 INFO ]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-06-26 17:55:24,787 INFO ]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-06-26 17:55:24,788 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:24,788 INFO ]: Abstraction has 10 states and 11 transitions. [2018-06-26 17:55:24,788 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:55:24,788 INFO ]: Start isEmpty. Operand 10 states and 11 transitions. [2018-06-26 17:55:24,788 INFO ]: Finished isEmpty. Found accepting run of length 10 [2018-06-26 17:55:24,788 INFO ]: Found error trace [2018-06-26 17:55:24,788 INFO ]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:24,788 INFO ]: === Iteration 5 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:24,788 INFO ]: Analyzing trace with hash 1138745090, now seen corresponding path program 2 times [2018-06-26 17:55:24,788 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:24,788 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:24,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:24,789 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:24,789 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:24,800 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:24,867 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:24,867 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:24,867 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:55:24,876 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:24,901 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:24,901 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:24,904 INFO ]: Computing forward predicates... [2018-06-26 17:55:24,938 INFO ]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:24,972 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:24,972 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-06-26 17:55:24,973 INFO ]: Interpolant automaton has 7 states [2018-06-26 17:55:24,973 INFO ]: Constructing interpolant automaton starting with 7 interpolants. [2018-06-26 17:55:24,973 INFO ]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-06-26 17:55:24,973 INFO ]: Start difference. First operand 10 states and 11 transitions. Second operand 7 states. [2018-06-26 17:55:25,130 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:25,130 INFO ]: Finished difference Result 16 states and 19 transitions. [2018-06-26 17:55:25,130 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:55:25,130 INFO ]: Start accepts. Automaton has 7 states. Word has length 9 [2018-06-26 17:55:25,130 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:25,130 INFO ]: With dead ends: 16 [2018-06-26 17:55:25,130 INFO ]: Without dead ends: 16 [2018-06-26 17:55:25,131 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-06-26 17:55:25,131 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:55:25,132 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-06-26 17:55:25,132 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:55:25,133 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-06-26 17:55:25,133 INFO ]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-06-26 17:55:25,133 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:25,133 INFO ]: Abstraction has 12 states and 14 transitions. [2018-06-26 17:55:25,133 INFO ]: Interpolant automaton has 7 states. [2018-06-26 17:55:25,133 INFO ]: Start isEmpty. Operand 12 states and 14 transitions. [2018-06-26 17:55:25,133 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:55:25,133 INFO ]: Found error trace [2018-06-26 17:55:25,133 INFO ]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:25,133 INFO ]: === Iteration 6 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:25,134 INFO ]: Analyzing trace with hash 940886713, now seen corresponding path program 3 times [2018-06-26 17:55:25,134 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:25,134 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:25,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:25,134 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:25,134 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:25,146 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:25,217 INFO ]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:25,217 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:25,217 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:55:25,229 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:25,288 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-06-26 17:55:25,288 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:25,290 INFO ]: Computing forward predicates... [2018-06-26 17:55:25,377 INFO ]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:25,396 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:25,396 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2018-06-26 17:55:25,396 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:55:25,396 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:55:25,396 INFO ]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:55:25,397 INFO ]: Start difference. First operand 12 states and 14 transitions. Second operand 11 states. [2018-06-26 17:55:25,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:25,486 INFO ]: Finished difference Result 15 states and 17 transitions. [2018-06-26 17:55:25,487 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:55:25,487 INFO ]: Start accepts. Automaton has 11 states. Word has length 10 [2018-06-26 17:55:25,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:25,487 INFO ]: With dead ends: 15 [2018-06-26 17:55:25,487 INFO ]: Without dead ends: 11 [2018-06-26 17:55:25,487 INFO ]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:55:25,487 INFO ]: Start minimizeSevpa. Operand 11 states. [2018-06-26 17:55:25,489 INFO ]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-06-26 17:55:25,489 INFO ]: Start removeUnreachable. Operand 11 states. [2018-06-26 17:55:25,489 INFO ]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-06-26 17:55:25,489 INFO ]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-06-26 17:55:25,489 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:25,489 INFO ]: Abstraction has 11 states and 12 transitions. [2018-06-26 17:55:25,489 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:55:25,489 INFO ]: Start isEmpty. Operand 11 states and 12 transitions. [2018-06-26 17:55:25,489 INFO ]: Finished isEmpty. Found accepting run of length 11 [2018-06-26 17:55:25,489 INFO ]: Found error trace [2018-06-26 17:55:25,490 INFO ]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:25,490 INFO ]: === Iteration 7 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:25,490 INFO ]: Analyzing trace with hash 1971536149, now seen corresponding path program 4 times [2018-06-26 17:55:25,490 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:25,490 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:25,490 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:25,490 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:25,491 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:25,501 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:25,660 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:25,660 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:25,660 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:55:25,666 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:25,687 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:25,687 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:25,688 INFO ]: Computing forward predicates... [2018-06-26 17:55:25,904 INFO ]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:25,923 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:25,923 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-06-26 17:55:25,923 INFO ]: Interpolant automaton has 10 states [2018-06-26 17:55:25,923 INFO ]: Constructing interpolant automaton starting with 10 interpolants. [2018-06-26 17:55:25,923 INFO ]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-06-26 17:55:25,924 INFO ]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-06-26 17:55:25,990 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:25,990 INFO ]: Finished difference Result 12 states and 13 transitions. [2018-06-26 17:55:25,991 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-06-26 17:55:25,991 INFO ]: Start accepts. Automaton has 10 states. Word has length 10 [2018-06-26 17:55:25,991 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:25,991 INFO ]: With dead ends: 12 [2018-06-26 17:55:25,991 INFO ]: Without dead ends: 12 [2018-06-26 17:55:25,991 INFO ]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:55:25,991 INFO ]: Start minimizeSevpa. Operand 12 states. [2018-06-26 17:55:25,992 INFO ]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-06-26 17:55:25,992 INFO ]: Start removeUnreachable. Operand 12 states. [2018-06-26 17:55:25,992 INFO ]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-06-26 17:55:25,992 INFO ]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-06-26 17:55:25,993 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:25,993 INFO ]: Abstraction has 12 states and 13 transitions. [2018-06-26 17:55:25,993 INFO ]: Interpolant automaton has 10 states. [2018-06-26 17:55:25,993 INFO ]: Start isEmpty. Operand 12 states and 13 transitions. [2018-06-26 17:55:25,993 INFO ]: Finished isEmpty. Found accepting run of length 12 [2018-06-26 17:55:25,993 INFO ]: Found error trace [2018-06-26 17:55:25,993 INFO ]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:25,993 INFO ]: === Iteration 8 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:25,993 INFO ]: Analyzing trace with hash 987605766, now seen corresponding path program 5 times [2018-06-26 17:55:25,993 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:25,993 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:25,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:25,994 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:25,994 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:26,006 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:26,134 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:26,134 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:26,134 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:26,142 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:26,178 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-06-26 17:55:26,178 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:26,180 INFO ]: Computing forward predicates... [2018-06-26 17:55:26,224 INFO ]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:26,244 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:26,244 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-06-26 17:55:26,244 INFO ]: Interpolant automaton has 9 states [2018-06-26 17:55:26,244 INFO ]: Constructing interpolant automaton starting with 9 interpolants. [2018-06-26 17:55:26,244 INFO ]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-06-26 17:55:26,245 INFO ]: Start difference. First operand 12 states and 13 transitions. Second operand 9 states. [2018-06-26 17:55:26,356 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:26,356 INFO ]: Finished difference Result 19 states and 22 transitions. [2018-06-26 17:55:26,356 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:55:26,356 INFO ]: Start accepts. Automaton has 9 states. Word has length 11 [2018-06-26 17:55:26,356 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:26,357 INFO ]: With dead ends: 19 [2018-06-26 17:55:26,357 INFO ]: Without dead ends: 19 [2018-06-26 17:55:26,357 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:55:26,357 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:55:26,359 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-06-26 17:55:26,359 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:55:26,359 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-06-26 17:55:26,359 INFO ]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-06-26 17:55:26,359 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:26,359 INFO ]: Abstraction has 14 states and 16 transitions. [2018-06-26 17:55:26,359 INFO ]: Interpolant automaton has 9 states. [2018-06-26 17:55:26,359 INFO ]: Start isEmpty. Operand 14 states and 16 transitions. [2018-06-26 17:55:26,360 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:55:26,360 INFO ]: Found error trace [2018-06-26 17:55:26,360 INFO ]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:26,360 INFO ]: === Iteration 9 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:26,360 INFO ]: Analyzing trace with hash 550534965, now seen corresponding path program 6 times [2018-06-26 17:55:26,360 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:26,360 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:26,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:26,361 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:26,361 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:26,388 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:26,886 INFO ]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:26,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:26,887 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:55:26,893 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:26,911 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2018-06-26 17:55:26,911 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:26,912 INFO ]: Computing forward predicates... [2018-06-26 17:55:26,989 INFO ]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:27,008 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:27,008 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-06-26 17:55:27,008 INFO ]: Interpolant automaton has 14 states [2018-06-26 17:55:27,008 INFO ]: Constructing interpolant automaton starting with 14 interpolants. [2018-06-26 17:55:27,008 INFO ]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-06-26 17:55:27,009 INFO ]: Start difference. First operand 14 states and 16 transitions. Second operand 14 states. [2018-06-26 17:55:27,081 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:27,081 INFO ]: Finished difference Result 18 states and 20 transitions. [2018-06-26 17:55:27,081 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:55:27,081 INFO ]: Start accepts. Automaton has 14 states. Word has length 12 [2018-06-26 17:55:27,081 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:27,081 INFO ]: With dead ends: 18 [2018-06-26 17:55:27,081 INFO ]: Without dead ends: 13 [2018-06-26 17:55:27,082 INFO ]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:55:27,082 INFO ]: Start minimizeSevpa. Operand 13 states. [2018-06-26 17:55:27,083 INFO ]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-06-26 17:55:27,083 INFO ]: Start removeUnreachable. Operand 13 states. [2018-06-26 17:55:27,083 INFO ]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-06-26 17:55:27,083 INFO ]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-06-26 17:55:27,084 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:27,084 INFO ]: Abstraction has 13 states and 14 transitions. [2018-06-26 17:55:27,084 INFO ]: Interpolant automaton has 14 states. [2018-06-26 17:55:27,084 INFO ]: Start isEmpty. Operand 13 states and 14 transitions. [2018-06-26 17:55:27,084 INFO ]: Finished isEmpty. Found accepting run of length 13 [2018-06-26 17:55:27,084 INFO ]: Found error trace [2018-06-26 17:55:27,084 INFO ]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:27,084 INFO ]: === Iteration 10 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:27,084 INFO ]: Analyzing trace with hash -1859070887, now seen corresponding path program 7 times [2018-06-26 17:55:27,084 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:27,084 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:27,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,085 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:27,085 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,095 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:27,159 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:27,160 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:27,160 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:55:27,165 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:27,195 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:27,197 INFO ]: Computing forward predicates... [2018-06-26 17:55:27,240 INFO ]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:27,269 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:27,269 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-06-26 17:55:27,269 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:55:27,269 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:55:27,269 INFO ]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:55:27,269 INFO ]: Start difference. First operand 13 states and 14 transitions. Second operand 13 states. [2018-06-26 17:55:27,328 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:27,328 INFO ]: Finished difference Result 14 states and 15 transitions. [2018-06-26 17:55:27,328 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-06-26 17:55:27,328 INFO ]: Start accepts. Automaton has 13 states. Word has length 12 [2018-06-26 17:55:27,328 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:27,328 INFO ]: With dead ends: 14 [2018-06-26 17:55:27,328 INFO ]: Without dead ends: 14 [2018-06-26 17:55:27,329 INFO ]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:55:27,329 INFO ]: Start minimizeSevpa. Operand 14 states. [2018-06-26 17:55:27,330 INFO ]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-06-26 17:55:27,330 INFO ]: Start removeUnreachable. Operand 14 states. [2018-06-26 17:55:27,330 INFO ]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-06-26 17:55:27,330 INFO ]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-06-26 17:55:27,330 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:27,330 INFO ]: Abstraction has 14 states and 15 transitions. [2018-06-26 17:55:27,330 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:55:27,330 INFO ]: Start isEmpty. Operand 14 states and 15 transitions. [2018-06-26 17:55:27,331 INFO ]: Finished isEmpty. Found accepting run of length 14 [2018-06-26 17:55:27,331 INFO ]: Found error trace [2018-06-26 17:55:27,331 INFO ]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:27,331 INFO ]: === Iteration 11 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:27,331 INFO ]: Analyzing trace with hash -1797095358, now seen corresponding path program 8 times [2018-06-26 17:55:27,331 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:27,331 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:27,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,332 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:27,332 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,342 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:27,440 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:27,440 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:27,440 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:55:27,447 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:27,493 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:27,493 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:27,496 INFO ]: Computing forward predicates... [2018-06-26 17:55:27,581 INFO ]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:27,600 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:27,600 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-06-26 17:55:27,600 INFO ]: Interpolant automaton has 11 states [2018-06-26 17:55:27,601 INFO ]: Constructing interpolant automaton starting with 11 interpolants. [2018-06-26 17:55:27,601 INFO ]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-06-26 17:55:27,601 INFO ]: Start difference. First operand 14 states and 15 transitions. Second operand 11 states. [2018-06-26 17:55:27,804 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:27,804 INFO ]: Finished difference Result 22 states and 25 transitions. [2018-06-26 17:55:27,804 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:55:27,804 INFO ]: Start accepts. Automaton has 11 states. Word has length 13 [2018-06-26 17:55:27,804 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:27,805 INFO ]: With dead ends: 22 [2018-06-26 17:55:27,805 INFO ]: Without dead ends: 22 [2018-06-26 17:55:27,805 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2018-06-26 17:55:27,805 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:55:27,807 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-06-26 17:55:27,807 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:55:27,807 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-06-26 17:55:27,807 INFO ]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-06-26 17:55:27,807 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:27,807 INFO ]: Abstraction has 16 states and 18 transitions. [2018-06-26 17:55:27,807 INFO ]: Interpolant automaton has 11 states. [2018-06-26 17:55:27,807 INFO ]: Start isEmpty. Operand 16 states and 18 transitions. [2018-06-26 17:55:27,808 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:55:27,808 INFO ]: Found error trace [2018-06-26 17:55:27,808 INFO ]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:27,808 INFO ]: === Iteration 12 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:27,808 INFO ]: Analyzing trace with hash 124146041, now seen corresponding path program 9 times [2018-06-26 17:55:27,808 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:27,808 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:27,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,809 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:27,809 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:27,819 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:28,000 INFO ]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:28,000 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:28,000 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:55:28,005 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:28,029 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-06-26 17:55:28,029 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:28,032 INFO ]: Computing forward predicates... [2018-06-26 17:55:28,269 INFO ]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:28,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:28,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 17 [2018-06-26 17:55:28,291 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:55:28,291 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:55:28,291 INFO ]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:55:28,291 INFO ]: Start difference. First operand 16 states and 18 transitions. Second operand 17 states. [2018-06-26 17:55:28,726 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:28,726 INFO ]: Finished difference Result 21 states and 23 transitions. [2018-06-26 17:55:28,726 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:55:28,726 INFO ]: Start accepts. Automaton has 17 states. Word has length 14 [2018-06-26 17:55:28,726 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:28,726 INFO ]: With dead ends: 21 [2018-06-26 17:55:28,726 INFO ]: Without dead ends: 15 [2018-06-26 17:55:28,727 INFO ]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:55:28,727 INFO ]: Start minimizeSevpa. Operand 15 states. [2018-06-26 17:55:28,728 INFO ]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-06-26 17:55:28,728 INFO ]: Start removeUnreachable. Operand 15 states. [2018-06-26 17:55:28,728 INFO ]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-06-26 17:55:28,728 INFO ]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-06-26 17:55:28,728 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:28,728 INFO ]: Abstraction has 15 states and 16 transitions. [2018-06-26 17:55:28,728 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:55:28,728 INFO ]: Start isEmpty. Operand 15 states and 16 transitions. [2018-06-26 17:55:28,728 INFO ]: Finished isEmpty. Found accepting run of length 15 [2018-06-26 17:55:28,729 INFO ]: Found error trace [2018-06-26 17:55:28,729 INFO ]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:28,729 INFO ]: === Iteration 13 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:28,729 INFO ]: Analyzing trace with hash -1559191339, now seen corresponding path program 10 times [2018-06-26 17:55:28,729 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:28,729 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:28,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:28,729 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:28,729 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:28,737 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:28,887 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:28,887 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:28,887 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:55:28,893 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:28,916 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:28,916 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:28,918 INFO ]: Computing forward predicates... [2018-06-26 17:55:29,090 INFO ]: Checked inductivity of 20 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:29,109 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:29,110 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-06-26 17:55:29,110 INFO ]: Interpolant automaton has 16 states [2018-06-26 17:55:29,110 INFO ]: Constructing interpolant automaton starting with 16 interpolants. [2018-06-26 17:55:29,110 INFO ]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2018-06-26 17:55:29,110 INFO ]: Start difference. First operand 15 states and 16 transitions. Second operand 16 states. [2018-06-26 17:55:29,201 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:29,201 INFO ]: Finished difference Result 16 states and 17 transitions. [2018-06-26 17:55:29,201 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-06-26 17:55:29,201 INFO ]: Start accepts. Automaton has 16 states. Word has length 14 [2018-06-26 17:55:29,201 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:29,201 INFO ]: With dead ends: 16 [2018-06-26 17:55:29,201 INFO ]: Without dead ends: 16 [2018-06-26 17:55:29,202 INFO ]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:55:29,202 INFO ]: Start minimizeSevpa. Operand 16 states. [2018-06-26 17:55:29,203 INFO ]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-06-26 17:55:29,203 INFO ]: Start removeUnreachable. Operand 16 states. [2018-06-26 17:55:29,203 INFO ]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-06-26 17:55:29,203 INFO ]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-06-26 17:55:29,203 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:29,203 INFO ]: Abstraction has 16 states and 17 transitions. [2018-06-26 17:55:29,203 INFO ]: Interpolant automaton has 16 states. [2018-06-26 17:55:29,203 INFO ]: Start isEmpty. Operand 16 states and 17 transitions. [2018-06-26 17:55:29,204 INFO ]: Finished isEmpty. Found accepting run of length 16 [2018-06-26 17:55:29,204 INFO ]: Found error trace [2018-06-26 17:55:29,204 INFO ]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:29,204 INFO ]: === Iteration 14 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:29,204 INFO ]: Analyzing trace with hash -1090763962, now seen corresponding path program 11 times [2018-06-26 17:55:29,204 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:29,204 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:29,204 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:29,205 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:29,205 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:29,215 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:29,457 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:29,457 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:29,457 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:55:29,464 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:29,484 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-06-26 17:55:29,484 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:29,486 INFO ]: Computing forward predicates... [2018-06-26 17:55:29,602 INFO ]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:29,621 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:29,621 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-06-26 17:55:29,622 INFO ]: Interpolant automaton has 13 states [2018-06-26 17:55:29,622 INFO ]: Constructing interpolant automaton starting with 13 interpolants. [2018-06-26 17:55:29,622 INFO ]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-06-26 17:55:29,622 INFO ]: Start difference. First operand 16 states and 17 transitions. Second operand 13 states. [2018-06-26 17:55:29,805 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:29,805 INFO ]: Finished difference Result 25 states and 28 transitions. [2018-06-26 17:55:29,805 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:55:29,805 INFO ]: Start accepts. Automaton has 13 states. Word has length 15 [2018-06-26 17:55:29,805 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:29,806 INFO ]: With dead ends: 25 [2018-06-26 17:55:29,806 INFO ]: Without dead ends: 25 [2018-06-26 17:55:29,806 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:55:29,806 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:55:29,808 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-06-26 17:55:29,808 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:55:29,808 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-06-26 17:55:29,808 INFO ]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-06-26 17:55:29,809 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:29,809 INFO ]: Abstraction has 18 states and 20 transitions. [2018-06-26 17:55:29,809 INFO ]: Interpolant automaton has 13 states. [2018-06-26 17:55:29,809 INFO ]: Start isEmpty. Operand 18 states and 20 transitions. [2018-06-26 17:55:29,809 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:55:29,809 INFO ]: Found error trace [2018-06-26 17:55:29,809 INFO ]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:29,809 INFO ]: === Iteration 15 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:29,809 INFO ]: Analyzing trace with hash 545582837, now seen corresponding path program 12 times [2018-06-26 17:55:29,809 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:29,809 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:29,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:29,810 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:29,810 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:29,820 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:29,937 INFO ]: Checked inductivity of 31 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:29,937 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:29,937 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:55:29,942 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:29,984 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-06-26 17:55:29,984 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:29,987 INFO ]: Computing forward predicates... [2018-06-26 17:55:30,097 INFO ]: Checked inductivity of 31 backedges. 21 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:30,115 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:30,116 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2018-06-26 17:55:30,116 INFO ]: Interpolant automaton has 20 states [2018-06-26 17:55:30,116 INFO ]: Constructing interpolant automaton starting with 20 interpolants. [2018-06-26 17:55:30,116 INFO ]: CoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2018-06-26 17:55:30,116 INFO ]: Start difference. First operand 18 states and 20 transitions. Second operand 20 states. [2018-06-26 17:55:30,220 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:30,220 INFO ]: Finished difference Result 24 states and 26 transitions. [2018-06-26 17:55:30,221 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:55:30,221 INFO ]: Start accepts. Automaton has 20 states. Word has length 16 [2018-06-26 17:55:30,221 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:30,221 INFO ]: With dead ends: 24 [2018-06-26 17:55:30,221 INFO ]: Without dead ends: 17 [2018-06-26 17:55:30,221 INFO ]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:55:30,221 INFO ]: Start minimizeSevpa. Operand 17 states. [2018-06-26 17:55:30,223 INFO ]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-06-26 17:55:30,223 INFO ]: Start removeUnreachable. Operand 17 states. [2018-06-26 17:55:30,223 INFO ]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-06-26 17:55:30,223 INFO ]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-06-26 17:55:30,223 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:30,223 INFO ]: Abstraction has 17 states and 18 transitions. [2018-06-26 17:55:30,223 INFO ]: Interpolant automaton has 20 states. [2018-06-26 17:55:30,223 INFO ]: Start isEmpty. Operand 17 states and 18 transitions. [2018-06-26 17:55:30,223 INFO ]: Finished isEmpty. Found accepting run of length 17 [2018-06-26 17:55:30,223 INFO ]: Found error trace [2018-06-26 17:55:30,223 INFO ]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:30,224 INFO ]: === Iteration 16 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:30,224 INFO ]: Analyzing trace with hash -98268391, now seen corresponding path program 13 times [2018-06-26 17:55:30,224 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:30,224 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:30,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:30,224 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:30,224 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:30,242 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:30,377 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:30,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:30,377 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:55:30,382 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:30,404 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:30,406 INFO ]: Computing forward predicates... [2018-06-26 17:55:30,520 INFO ]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:30,539 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:30,539 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 19 [2018-06-26 17:55:30,539 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:55:30,539 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:55:30,539 INFO ]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:55:30,539 INFO ]: Start difference. First operand 17 states and 18 transitions. Second operand 19 states. [2018-06-26 17:55:30,833 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:30,833 INFO ]: Finished difference Result 18 states and 19 transitions. [2018-06-26 17:55:30,834 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-06-26 17:55:30,834 INFO ]: Start accepts. Automaton has 19 states. Word has length 16 [2018-06-26 17:55:30,834 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:30,834 INFO ]: With dead ends: 18 [2018-06-26 17:55:30,834 INFO ]: Without dead ends: 18 [2018-06-26 17:55:30,834 INFO ]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=405, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:55:30,834 INFO ]: Start minimizeSevpa. Operand 18 states. [2018-06-26 17:55:30,836 INFO ]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-06-26 17:55:30,836 INFO ]: Start removeUnreachable. Operand 18 states. [2018-06-26 17:55:30,836 INFO ]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-06-26 17:55:30,836 INFO ]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-06-26 17:55:30,836 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:30,836 INFO ]: Abstraction has 18 states and 19 transitions. [2018-06-26 17:55:30,836 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:55:30,836 INFO ]: Start isEmpty. Operand 18 states and 19 transitions. [2018-06-26 17:55:30,836 INFO ]: Finished isEmpty. Found accepting run of length 18 [2018-06-26 17:55:30,836 INFO ]: Found error trace [2018-06-26 17:55:30,837 INFO ]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:30,837 INFO ]: === Iteration 17 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:30,837 INFO ]: Analyzing trace with hash 1248174466, now seen corresponding path program 14 times [2018-06-26 17:55:30,837 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:30,837 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:30,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:30,837 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:30,837 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:30,847 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:31,106 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:31,106 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:31,106 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:55:31,114 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:31,137 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:31,137 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:31,140 INFO ]: Computing forward predicates... [2018-06-26 17:55:31,208 INFO ]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:31,227 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:31,227 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-06-26 17:55:31,227 INFO ]: Interpolant automaton has 15 states [2018-06-26 17:55:31,228 INFO ]: Constructing interpolant automaton starting with 15 interpolants. [2018-06-26 17:55:31,228 INFO ]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-06-26 17:55:31,228 INFO ]: Start difference. First operand 18 states and 19 transitions. Second operand 15 states. [2018-06-26 17:55:31,436 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:31,436 INFO ]: Finished difference Result 28 states and 31 transitions. [2018-06-26 17:55:31,509 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:55:31,509 INFO ]: Start accepts. Automaton has 15 states. Word has length 17 [2018-06-26 17:55:31,509 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:31,510 INFO ]: With dead ends: 28 [2018-06-26 17:55:31,510 INFO ]: Without dead ends: 28 [2018-06-26 17:55:31,510 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-06-26 17:55:31,510 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:55:31,512 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-06-26 17:55:31,512 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:55:31,512 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-06-26 17:55:31,512 INFO ]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-06-26 17:55:31,512 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:31,512 INFO ]: Abstraction has 20 states and 22 transitions. [2018-06-26 17:55:31,513 INFO ]: Interpolant automaton has 15 states. [2018-06-26 17:55:31,513 INFO ]: Start isEmpty. Operand 20 states and 22 transitions. [2018-06-26 17:55:31,513 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:55:31,513 INFO ]: Found error trace [2018-06-26 17:55:31,513 INFO ]: trace histogram [7, 5, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:31,513 INFO ]: === Iteration 18 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:31,513 INFO ]: Analyzing trace with hash 38230073, now seen corresponding path program 15 times [2018-06-26 17:55:31,513 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:31,513 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:31,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:31,514 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:31,514 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:31,522 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:31,708 INFO ]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:31,708 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:31,708 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:55:31,714 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:31,742 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-06-26 17:55:31,742 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:31,744 INFO ]: Computing forward predicates... [2018-06-26 17:55:32,088 INFO ]: Checked inductivity of 43 backedges. 28 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:32,106 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:32,107 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2018-06-26 17:55:32,107 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:55:32,107 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:55:32,107 INFO ]: CoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:55:32,107 INFO ]: Start difference. First operand 20 states and 22 transitions. Second operand 23 states. [2018-06-26 17:55:32,215 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:32,215 INFO ]: Finished difference Result 27 states and 29 transitions. [2018-06-26 17:55:32,217 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:55:32,217 INFO ]: Start accepts. Automaton has 23 states. Word has length 18 [2018-06-26 17:55:32,217 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:32,217 INFO ]: With dead ends: 27 [2018-06-26 17:55:32,217 INFO ]: Without dead ends: 19 [2018-06-26 17:55:32,217 INFO ]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:55:32,217 INFO ]: Start minimizeSevpa. Operand 19 states. [2018-06-26 17:55:32,218 INFO ]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-06-26 17:55:32,219 INFO ]: Start removeUnreachable. Operand 19 states. [2018-06-26 17:55:32,219 INFO ]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-06-26 17:55:32,219 INFO ]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-06-26 17:55:32,219 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:32,219 INFO ]: Abstraction has 19 states and 20 transitions. [2018-06-26 17:55:32,219 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:55:32,219 INFO ]: Start isEmpty. Operand 19 states and 20 transitions. [2018-06-26 17:55:32,219 INFO ]: Finished isEmpty. Found accepting run of length 19 [2018-06-26 17:55:32,219 INFO ]: Found error trace [2018-06-26 17:55:32,219 INFO ]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:32,219 INFO ]: === Iteration 19 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:32,220 INFO ]: Analyzing trace with hash 1553678485, now seen corresponding path program 16 times [2018-06-26 17:55:32,220 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:32,220 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:32,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:32,220 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:32,220 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:32,230 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:32,416 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:32,416 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:32,416 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:55:32,422 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:32,444 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:32,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:32,446 INFO ]: Computing forward predicates... [2018-06-26 17:55:32,561 INFO ]: Checked inductivity of 42 backedges. 21 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:32,580 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:32,580 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2018-06-26 17:55:32,580 INFO ]: Interpolant automaton has 22 states [2018-06-26 17:55:32,580 INFO ]: Constructing interpolant automaton starting with 22 interpolants. [2018-06-26 17:55:32,580 INFO ]: CoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2018-06-26 17:55:32,581 INFO ]: Start difference. First operand 19 states and 20 transitions. Second operand 22 states. [2018-06-26 17:55:32,712 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:32,712 INFO ]: Finished difference Result 20 states and 21 transitions. [2018-06-26 17:55:32,712 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-06-26 17:55:32,712 INFO ]: Start accepts. Automaton has 22 states. Word has length 18 [2018-06-26 17:55:32,712 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:32,712 INFO ]: With dead ends: 20 [2018-06-26 17:55:32,712 INFO ]: Without dead ends: 20 [2018-06-26 17:55:32,712 INFO ]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=553, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:55:32,712 INFO ]: Start minimizeSevpa. Operand 20 states. [2018-06-26 17:55:32,714 INFO ]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-06-26 17:55:32,714 INFO ]: Start removeUnreachable. Operand 20 states. [2018-06-26 17:55:32,714 INFO ]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-06-26 17:55:32,714 INFO ]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-06-26 17:55:32,714 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:32,714 INFO ]: Abstraction has 20 states and 21 transitions. [2018-06-26 17:55:32,714 INFO ]: Interpolant automaton has 22 states. [2018-06-26 17:55:32,714 INFO ]: Start isEmpty. Operand 20 states and 21 transitions. [2018-06-26 17:55:32,714 INFO ]: Finished isEmpty. Found accepting run of length 20 [2018-06-26 17:55:32,715 INFO ]: Found error trace [2018-06-26 17:55:32,715 INFO ]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:32,715 INFO ]: === Iteration 20 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:32,715 INFO ]: Analyzing trace with hash 918920070, now seen corresponding path program 17 times [2018-06-26 17:55:32,715 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:32,715 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:32,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:32,715 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:32,715 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:32,725 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:32,969 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:32,969 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:32,969 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:55:32,983 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:33,016 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-06-26 17:55:33,016 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:33,018 INFO ]: Computing forward predicates... [2018-06-26 17:55:33,089 INFO ]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:33,108 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:33,108 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-06-26 17:55:33,109 INFO ]: Interpolant automaton has 17 states [2018-06-26 17:55:33,109 INFO ]: Constructing interpolant automaton starting with 17 interpolants. [2018-06-26 17:55:33,109 INFO ]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-06-26 17:55:33,109 INFO ]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-06-26 17:55:33,471 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:33,471 INFO ]: Finished difference Result 31 states and 34 transitions. [2018-06-26 17:55:33,471 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:55:33,471 INFO ]: Start accepts. Automaton has 17 states. Word has length 19 [2018-06-26 17:55:33,471 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:33,472 INFO ]: With dead ends: 31 [2018-06-26 17:55:33,472 INFO ]: Without dead ends: 31 [2018-06-26 17:55:33,472 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:55:33,472 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:55:33,474 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-06-26 17:55:33,474 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:55:33,474 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-06-26 17:55:33,474 INFO ]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-06-26 17:55:33,474 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:33,474 INFO ]: Abstraction has 22 states and 24 transitions. [2018-06-26 17:55:33,474 INFO ]: Interpolant automaton has 17 states. [2018-06-26 17:55:33,474 INFO ]: Start isEmpty. Operand 22 states and 24 transitions. [2018-06-26 17:55:33,475 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:55:33,475 INFO ]: Found error trace [2018-06-26 17:55:33,475 INFO ]: trace histogram [8, 6, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:33,475 INFO ]: === Iteration 21 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:33,475 INFO ]: Analyzing trace with hash -1578721611, now seen corresponding path program 18 times [2018-06-26 17:55:33,475 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:33,475 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:33,475 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:33,475 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:33,476 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:33,487 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:34,313 INFO ]: Checked inductivity of 57 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:34,313 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:34,313 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:55:34,321 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:34,353 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-06-26 17:55:34,353 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:34,355 INFO ]: Computing forward predicates... [2018-06-26 17:55:34,477 INFO ]: Checked inductivity of 57 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:34,496 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:34,496 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 26 [2018-06-26 17:55:34,496 INFO ]: Interpolant automaton has 26 states [2018-06-26 17:55:34,497 INFO ]: Constructing interpolant automaton starting with 26 interpolants. [2018-06-26 17:55:34,497 INFO ]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2018-06-26 17:55:34,497 INFO ]: Start difference. First operand 22 states and 24 transitions. Second operand 26 states. [2018-06-26 17:55:34,660 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:34,660 INFO ]: Finished difference Result 30 states and 32 transitions. [2018-06-26 17:55:34,660 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:55:34,660 INFO ]: Start accepts. Automaton has 26 states. Word has length 20 [2018-06-26 17:55:34,660 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:34,661 INFO ]: With dead ends: 30 [2018-06-26 17:55:34,661 INFO ]: Without dead ends: 21 [2018-06-26 17:55:34,661 INFO ]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:55:34,661 INFO ]: Start minimizeSevpa. Operand 21 states. [2018-06-26 17:55:34,662 INFO ]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-06-26 17:55:34,662 INFO ]: Start removeUnreachable. Operand 21 states. [2018-06-26 17:55:34,663 INFO ]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-06-26 17:55:34,663 INFO ]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-06-26 17:55:34,663 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:34,663 INFO ]: Abstraction has 21 states and 22 transitions. [2018-06-26 17:55:34,663 INFO ]: Interpolant automaton has 26 states. [2018-06-26 17:55:34,663 INFO ]: Start isEmpty. Operand 21 states and 22 transitions. [2018-06-26 17:55:34,663 INFO ]: Finished isEmpty. Found accepting run of length 21 [2018-06-26 17:55:34,663 INFO ]: Found error trace [2018-06-26 17:55:34,663 INFO ]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:34,664 INFO ]: === Iteration 22 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:34,664 INFO ]: Analyzing trace with hash -1844461095, now seen corresponding path program 19 times [2018-06-26 17:55:34,664 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:34,664 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:34,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:34,664 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:34,664 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:34,673 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:35,020 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:35,021 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:35,021 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:55:35,027 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:35,054 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:35,056 INFO ]: Computing forward predicates... [2018-06-26 17:55:35,181 INFO ]: Checked inductivity of 56 backedges. 28 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:35,200 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:35,200 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2018-06-26 17:55:35,200 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:55:35,200 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:55:35,201 INFO ]: CoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:55:35,201 INFO ]: Start difference. First operand 21 states and 22 transitions. Second operand 25 states. [2018-06-26 17:55:35,365 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:35,365 INFO ]: Finished difference Result 22 states and 23 transitions. [2018-06-26 17:55:35,366 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-06-26 17:55:35,366 INFO ]: Start accepts. Automaton has 25 states. Word has length 20 [2018-06-26 17:55:35,366 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:35,366 INFO ]: With dead ends: 22 [2018-06-26 17:55:35,366 INFO ]: Without dead ends: 22 [2018-06-26 17:55:35,367 INFO ]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=724, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:55:35,367 INFO ]: Start minimizeSevpa. Operand 22 states. [2018-06-26 17:55:35,368 INFO ]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-06-26 17:55:35,368 INFO ]: Start removeUnreachable. Operand 22 states. [2018-06-26 17:55:35,368 INFO ]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-06-26 17:55:35,368 INFO ]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-06-26 17:55:35,368 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:35,368 INFO ]: Abstraction has 22 states and 23 transitions. [2018-06-26 17:55:35,368 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:55:35,368 INFO ]: Start isEmpty. Operand 22 states and 23 transitions. [2018-06-26 17:55:35,368 INFO ]: Finished isEmpty. Found accepting run of length 22 [2018-06-26 17:55:35,368 INFO ]: Found error trace [2018-06-26 17:55:35,368 INFO ]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:35,368 INFO ]: === Iteration 23 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:35,368 INFO ]: Analyzing trace with hash -1344191806, now seen corresponding path program 20 times [2018-06-26 17:55:35,368 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:35,368 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:35,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:35,369 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:35,369 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:35,380 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:35,686 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:35,687 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:35,687 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:55:35,692 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:35,719 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:35,719 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:35,722 INFO ]: Computing forward predicates... [2018-06-26 17:55:35,797 INFO ]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:35,815 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:35,815 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-06-26 17:55:35,815 INFO ]: Interpolant automaton has 19 states [2018-06-26 17:55:35,816 INFO ]: Constructing interpolant automaton starting with 19 interpolants. [2018-06-26 17:55:35,816 INFO ]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-06-26 17:55:35,816 INFO ]: Start difference. First operand 22 states and 23 transitions. Second operand 19 states. [2018-06-26 17:55:36,232 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:36,232 INFO ]: Finished difference Result 34 states and 37 transitions. [2018-06-26 17:55:36,232 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:55:36,232 INFO ]: Start accepts. Automaton has 19 states. Word has length 21 [2018-06-26 17:55:36,232 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:36,232 INFO ]: With dead ends: 34 [2018-06-26 17:55:36,232 INFO ]: Without dead ends: 34 [2018-06-26 17:55:36,233 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2018-06-26 17:55:36,233 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:55:36,234 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 24. [2018-06-26 17:55:36,234 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:55:36,235 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-06-26 17:55:36,235 INFO ]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-06-26 17:55:36,235 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:36,235 INFO ]: Abstraction has 24 states and 26 transitions. [2018-06-26 17:55:36,235 INFO ]: Interpolant automaton has 19 states. [2018-06-26 17:55:36,235 INFO ]: Start isEmpty. Operand 24 states and 26 transitions. [2018-06-26 17:55:36,235 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:55:36,235 INFO ]: Found error trace [2018-06-26 17:55:36,235 INFO ]: trace histogram [9, 7, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:36,235 INFO ]: === Iteration 24 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:36,235 INFO ]: Analyzing trace with hash 1279254265, now seen corresponding path program 21 times [2018-06-26 17:55:36,235 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:36,235 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:36,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:36,236 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:36,236 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:36,244 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:36,407 INFO ]: Checked inductivity of 73 backedges. 28 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:36,408 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:36,408 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:55:36,413 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:36,444 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-06-26 17:55:36,444 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:36,445 INFO ]: Computing forward predicates... [2018-06-26 17:55:36,599 INFO ]: Checked inductivity of 73 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:36,620 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:36,620 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 29 [2018-06-26 17:55:36,620 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:55:36,620 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:55:36,620 INFO ]: CoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:55:36,620 INFO ]: Start difference. First operand 24 states and 26 transitions. Second operand 29 states. [2018-06-26 17:55:37,030 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:37,030 INFO ]: Finished difference Result 33 states and 35 transitions. [2018-06-26 17:55:37,030 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:55:37,030 INFO ]: Start accepts. Automaton has 29 states. Word has length 22 [2018-06-26 17:55:37,030 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:37,030 INFO ]: With dead ends: 33 [2018-06-26 17:55:37,030 INFO ]: Without dead ends: 23 [2018-06-26 17:55:37,031 INFO ]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=376, Invalid=1106, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:55:37,031 INFO ]: Start minimizeSevpa. Operand 23 states. [2018-06-26 17:55:37,032 INFO ]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-06-26 17:55:37,032 INFO ]: Start removeUnreachable. Operand 23 states. [2018-06-26 17:55:37,032 INFO ]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-06-26 17:55:37,032 INFO ]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-06-26 17:55:37,032 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:37,032 INFO ]: Abstraction has 23 states and 24 transitions. [2018-06-26 17:55:37,032 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:55:37,033 INFO ]: Start isEmpty. Operand 23 states and 24 transitions. [2018-06-26 17:55:37,033 INFO ]: Finished isEmpty. Found accepting run of length 23 [2018-06-26 17:55:37,033 INFO ]: Found error trace [2018-06-26 17:55:37,033 INFO ]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:37,033 INFO ]: === Iteration 25 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:37,033 INFO ]: Analyzing trace with hash 1631264853, now seen corresponding path program 22 times [2018-06-26 17:55:37,033 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:37,033 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:37,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:37,034 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:37,034 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:37,042 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:37,322 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:37,322 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:37,322 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:37,329 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:37,356 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:37,357 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:37,359 INFO ]: Computing forward predicates... [2018-06-26 17:55:37,609 INFO ]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:37,628 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:37,628 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 28 [2018-06-26 17:55:37,628 INFO ]: Interpolant automaton has 28 states [2018-06-26 17:55:37,628 INFO ]: Constructing interpolant automaton starting with 28 interpolants. [2018-06-26 17:55:37,629 INFO ]: CoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2018-06-26 17:55:37,629 INFO ]: Start difference. First operand 23 states and 24 transitions. Second operand 28 states. [2018-06-26 17:55:37,818 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:37,818 INFO ]: Finished difference Result 24 states and 25 transitions. [2018-06-26 17:55:37,818 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-06-26 17:55:37,818 INFO ]: Start accepts. Automaton has 28 states. Word has length 22 [2018-06-26 17:55:37,818 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:37,819 INFO ]: With dead ends: 24 [2018-06-26 17:55:37,819 INFO ]: Without dead ends: 24 [2018-06-26 17:55:37,819 INFO ]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=414, Invalid=918, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:55:37,819 INFO ]: Start minimizeSevpa. Operand 24 states. [2018-06-26 17:55:37,820 INFO ]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-06-26 17:55:37,820 INFO ]: Start removeUnreachable. Operand 24 states. [2018-06-26 17:55:37,821 INFO ]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-06-26 17:55:37,821 INFO ]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-06-26 17:55:37,821 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:37,821 INFO ]: Abstraction has 24 states and 25 transitions. [2018-06-26 17:55:37,821 INFO ]: Interpolant automaton has 28 states. [2018-06-26 17:55:37,821 INFO ]: Start isEmpty. Operand 24 states and 25 transitions. [2018-06-26 17:55:37,821 INFO ]: Finished isEmpty. Found accepting run of length 24 [2018-06-26 17:55:37,821 INFO ]: Found error trace [2018-06-26 17:55:37,821 INFO ]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:37,821 INFO ]: === Iteration 26 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:37,821 INFO ]: Analyzing trace with hash -970869818, now seen corresponding path program 23 times [2018-06-26 17:55:37,821 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:37,821 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:37,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:37,822 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:37,822 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:37,834 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:38,309 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:38,309 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:38,309 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:38,318 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:38,353 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-06-26 17:55:38,353 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:38,356 INFO ]: Computing forward predicates... [2018-06-26 17:55:38,417 INFO ]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:38,436 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:38,436 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-06-26 17:55:38,436 INFO ]: Interpolant automaton has 21 states [2018-06-26 17:55:38,436 INFO ]: Constructing interpolant automaton starting with 21 interpolants. [2018-06-26 17:55:38,436 INFO ]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-06-26 17:55:38,437 INFO ]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2018-06-26 17:55:38,868 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:38,868 INFO ]: Finished difference Result 37 states and 40 transitions. [2018-06-26 17:55:38,868 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:55:38,868 INFO ]: Start accepts. Automaton has 21 states. Word has length 23 [2018-06-26 17:55:38,868 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:38,869 INFO ]: With dead ends: 37 [2018-06-26 17:55:38,869 INFO ]: Without dead ends: 37 [2018-06-26 17:55:38,869 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:55:38,869 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:55:38,871 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-06-26 17:55:38,871 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:55:38,871 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-06-26 17:55:38,871 INFO ]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-06-26 17:55:38,871 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:38,871 INFO ]: Abstraction has 26 states and 28 transitions. [2018-06-26 17:55:38,871 INFO ]: Interpolant automaton has 21 states. [2018-06-26 17:55:38,871 INFO ]: Start isEmpty. Operand 26 states and 28 transitions. [2018-06-26 17:55:38,872 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:55:38,872 INFO ]: Found error trace [2018-06-26 17:55:38,872 INFO ]: trace histogram [10, 8, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:38,872 INFO ]: === Iteration 27 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:38,872 INFO ]: Analyzing trace with hash -32665995, now seen corresponding path program 24 times [2018-06-26 17:55:38,872 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:38,872 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:38,872 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:38,872 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:38,873 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:38,883 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:39,080 INFO ]: Checked inductivity of 91 backedges. 36 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:39,080 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:39,080 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:39,086 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:39,120 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-06-26 17:55:39,120 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:39,123 INFO ]: Computing forward predicates... [2018-06-26 17:55:39,302 INFO ]: Checked inductivity of 91 backedges. 55 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:39,321 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:39,321 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 32 [2018-06-26 17:55:39,321 INFO ]: Interpolant automaton has 32 states [2018-06-26 17:55:39,321 INFO ]: Constructing interpolant automaton starting with 32 interpolants. [2018-06-26 17:55:39,321 INFO ]: CoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2018-06-26 17:55:39,321 INFO ]: Start difference. First operand 26 states and 28 transitions. Second operand 32 states. [2018-06-26 17:55:39,613 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:39,613 INFO ]: Finished difference Result 36 states and 38 transitions. [2018-06-26 17:55:39,613 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:55:39,613 INFO ]: Start accepts. Automaton has 32 states. Word has length 24 [2018-06-26 17:55:39,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:39,614 INFO ]: With dead ends: 36 [2018-06-26 17:55:39,614 INFO ]: Without dead ends: 25 [2018-06-26 17:55:39,614 INFO ]: 0 DeclaredPredicates, 56 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=452, Invalid=1354, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:55:39,614 INFO ]: Start minimizeSevpa. Operand 25 states. [2018-06-26 17:55:39,616 INFO ]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-06-26 17:55:39,616 INFO ]: Start removeUnreachable. Operand 25 states. [2018-06-26 17:55:39,616 INFO ]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-06-26 17:55:39,616 INFO ]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-06-26 17:55:39,616 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:39,616 INFO ]: Abstraction has 25 states and 26 transitions. [2018-06-26 17:55:39,616 INFO ]: Interpolant automaton has 32 states. [2018-06-26 17:55:39,616 INFO ]: Start isEmpty. Operand 25 states and 26 transitions. [2018-06-26 17:55:39,617 INFO ]: Finished isEmpty. Found accepting run of length 25 [2018-06-26 17:55:39,617 INFO ]: Found error trace [2018-06-26 17:55:39,617 INFO ]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:39,617 INFO ]: === Iteration 28 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:39,617 INFO ]: Analyzing trace with hash -2005239655, now seen corresponding path program 25 times [2018-06-26 17:55:39,617 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:39,617 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:39,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:39,617 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:39,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:39,627 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:39,938 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:39,938 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:39,938 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:39,944 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:39,978 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:39,980 INFO ]: Computing forward predicates... [2018-06-26 17:55:40,135 INFO ]: Checked inductivity of 90 backedges. 45 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:40,155 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:40,155 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 31 [2018-06-26 17:55:40,155 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:55:40,155 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:55:40,155 INFO ]: CoverageRelationStatistics Valid=240, Invalid=690, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:55:40,155 INFO ]: Start difference. First operand 25 states and 26 transitions. Second operand 31 states. [2018-06-26 17:55:40,338 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:40,338 INFO ]: Finished difference Result 26 states and 27 transitions. [2018-06-26 17:55:40,338 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-06-26 17:55:40,338 INFO ]: Start accepts. Automaton has 31 states. Word has length 24 [2018-06-26 17:55:40,338 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:40,339 INFO ]: With dead ends: 26 [2018-06-26 17:55:40,339 INFO ]: Without dead ends: 26 [2018-06-26 17:55:40,339 INFO ]: 0 DeclaredPredicates, 55 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=505, Invalid=1135, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:55:40,339 INFO ]: Start minimizeSevpa. Operand 26 states. [2018-06-26 17:55:40,340 INFO ]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-06-26 17:55:40,340 INFO ]: Start removeUnreachable. Operand 26 states. [2018-06-26 17:55:40,341 INFO ]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-06-26 17:55:40,341 INFO ]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-06-26 17:55:40,341 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:40,341 INFO ]: Abstraction has 26 states and 27 transitions. [2018-06-26 17:55:40,341 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:55:40,341 INFO ]: Start isEmpty. Operand 26 states and 27 transitions. [2018-06-26 17:55:40,341 INFO ]: Finished isEmpty. Found accepting run of length 26 [2018-06-26 17:55:40,341 INFO ]: Found error trace [2018-06-26 17:55:40,341 INFO ]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:40,341 INFO ]: === Iteration 29 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:40,342 INFO ]: Analyzing trace with hash -2033359870, now seen corresponding path program 26 times [2018-06-26 17:55:40,342 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:40,342 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:40,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:40,342 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:40,342 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:40,352 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:40,689 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:40,689 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:40,689 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:40,699 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:40,732 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:40,732 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:40,736 INFO ]: Computing forward predicates... [2018-06-26 17:55:41,156 INFO ]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:41,174 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:41,174 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-06-26 17:55:41,175 INFO ]: Interpolant automaton has 23 states [2018-06-26 17:55:41,175 INFO ]: Constructing interpolant automaton starting with 23 interpolants. [2018-06-26 17:55:41,175 INFO ]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-06-26 17:55:41,175 INFO ]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2018-06-26 17:55:41,811 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:41,811 INFO ]: Finished difference Result 40 states and 43 transitions. [2018-06-26 17:55:41,811 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:55:41,811 INFO ]: Start accepts. Automaton has 23 states. Word has length 25 [2018-06-26 17:55:41,811 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:41,811 INFO ]: With dead ends: 40 [2018-06-26 17:55:41,811 INFO ]: Without dead ends: 40 [2018-06-26 17:55:41,812 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2018-06-26 17:55:41,812 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:55:41,814 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-06-26 17:55:41,814 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:55:41,814 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-06-26 17:55:41,814 INFO ]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-06-26 17:55:41,814 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:41,814 INFO ]: Abstraction has 28 states and 30 transitions. [2018-06-26 17:55:41,814 INFO ]: Interpolant automaton has 23 states. [2018-06-26 17:55:41,814 INFO ]: Start isEmpty. Operand 28 states and 30 transitions. [2018-06-26 17:55:41,815 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:55:41,815 INFO ]: Found error trace [2018-06-26 17:55:41,815 INFO ]: trace histogram [11, 9, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:41,815 INFO ]: === Iteration 30 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:41,815 INFO ]: Analyzing trace with hash 1389880761, now seen corresponding path program 27 times [2018-06-26 17:55:41,815 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:41,815 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:41,815 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:41,815 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:41,816 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:41,825 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:42,680 INFO ]: Checked inductivity of 111 backedges. 45 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:42,680 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:42,680 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:42,686 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:42,739 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-06-26 17:55:42,739 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:42,741 INFO ]: Computing forward predicates... [2018-06-26 17:55:44,333 INFO ]: Checked inductivity of 111 backedges. 66 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:44,353 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:44,353 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-06-26 17:55:44,353 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:55:44,354 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:55:44,354 INFO ]: CoverageRelationStatistics Valid=289, Invalid=901, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:55:44,354 INFO ]: Start difference. First operand 28 states and 30 transitions. Second operand 35 states. [2018-06-26 17:55:44,674 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:44,674 INFO ]: Finished difference Result 39 states and 41 transitions. [2018-06-26 17:55:44,675 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:55:44,675 INFO ]: Start accepts. Automaton has 35 states. Word has length 26 [2018-06-26 17:55:44,675 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:44,675 INFO ]: With dead ends: 39 [2018-06-26 17:55:44,675 INFO ]: Without dead ends: 27 [2018-06-26 17:55:44,676 INFO ]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=535, Invalid=1627, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 17:55:44,676 INFO ]: Start minimizeSevpa. Operand 27 states. [2018-06-26 17:55:44,677 INFO ]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-06-26 17:55:44,677 INFO ]: Start removeUnreachable. Operand 27 states. [2018-06-26 17:55:44,677 INFO ]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-06-26 17:55:44,677 INFO ]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-06-26 17:55:44,677 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:44,677 INFO ]: Abstraction has 27 states and 28 transitions. [2018-06-26 17:55:44,677 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:55:44,677 INFO ]: Start isEmpty. Operand 27 states and 28 transitions. [2018-06-26 17:55:44,678 INFO ]: Finished isEmpty. Found accepting run of length 27 [2018-06-26 17:55:44,678 INFO ]: Found error trace [2018-06-26 17:55:44,678 INFO ]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:44,678 INFO ]: === Iteration 31 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:44,678 INFO ]: Analyzing trace with hash 369639445, now seen corresponding path program 28 times [2018-06-26 17:55:44,678 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:44,678 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:44,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:44,679 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:44,679 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:44,688 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:46,139 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:46,139 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:46,139 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:46,145 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:46,177 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:46,177 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:46,179 INFO ]: Computing forward predicates... [2018-06-26 17:55:46,322 INFO ]: Checked inductivity of 110 backedges. 55 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:46,341 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:46,341 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 34 [2018-06-26 17:55:46,341 INFO ]: Interpolant automaton has 34 states [2018-06-26 17:55:46,342 INFO ]: Constructing interpolant automaton starting with 34 interpolants. [2018-06-26 17:55:46,342 INFO ]: CoverageRelationStatistics Valid=286, Invalid=836, Unknown=0, NotChecked=0, Total=1122 [2018-06-26 17:55:46,342 INFO ]: Start difference. First operand 27 states and 28 transitions. Second operand 34 states. [2018-06-26 17:55:47,103 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:47,103 INFO ]: Finished difference Result 28 states and 29 transitions. [2018-06-26 17:55:47,103 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-06-26 17:55:47,103 INFO ]: Start accepts. Automaton has 34 states. Word has length 26 [2018-06-26 17:55:47,103 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:47,104 INFO ]: With dead ends: 28 [2018-06-26 17:55:47,104 INFO ]: Without dead ends: 28 [2018-06-26 17:55:47,104 INFO ]: 0 DeclaredPredicates, 60 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=605, Invalid=1375, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:55:47,104 INFO ]: Start minimizeSevpa. Operand 28 states. [2018-06-26 17:55:47,106 INFO ]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-06-26 17:55:47,106 INFO ]: Start removeUnreachable. Operand 28 states. [2018-06-26 17:55:47,106 INFO ]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-06-26 17:55:47,106 INFO ]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-06-26 17:55:47,106 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:47,106 INFO ]: Abstraction has 28 states and 29 transitions. [2018-06-26 17:55:47,106 INFO ]: Interpolant automaton has 34 states. [2018-06-26 17:55:47,106 INFO ]: Start isEmpty. Operand 28 states and 29 transitions. [2018-06-26 17:55:47,109 INFO ]: Finished isEmpty. Found accepting run of length 28 [2018-06-26 17:55:47,109 INFO ]: Found error trace [2018-06-26 17:55:47,109 INFO ]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:47,110 INFO ]: === Iteration 32 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:47,110 INFO ]: Analyzing trace with hash -1426551802, now seen corresponding path program 29 times [2018-06-26 17:55:47,110 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:47,110 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:47,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:47,110 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:47,110 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:47,121 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:47,473 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:47,473 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:47,473 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:47,478 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:47,581 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-06-26 17:55:47,581 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:47,585 INFO ]: Computing forward predicates... [2018-06-26 17:55:47,676 INFO ]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:47,695 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:47,695 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-06-26 17:55:47,695 INFO ]: Interpolant automaton has 25 states [2018-06-26 17:55:47,695 INFO ]: Constructing interpolant automaton starting with 25 interpolants. [2018-06-26 17:55:47,695 INFO ]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-06-26 17:55:47,695 INFO ]: Start difference. First operand 28 states and 29 transitions. Second operand 25 states. [2018-06-26 17:55:48,198 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:48,199 INFO ]: Finished difference Result 43 states and 46 transitions. [2018-06-26 17:55:48,199 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:55:48,199 INFO ]: Start accepts. Automaton has 25 states. Word has length 27 [2018-06-26 17:55:48,199 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:48,199 INFO ]: With dead ends: 43 [2018-06-26 17:55:48,199 INFO ]: Without dead ends: 43 [2018-06-26 17:55:48,199 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=1348, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:55:48,199 INFO ]: Start minimizeSevpa. Operand 43 states. [2018-06-26 17:55:48,201 INFO ]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-06-26 17:55:48,201 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:55:48,201 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-06-26 17:55:48,201 INFO ]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-06-26 17:55:48,201 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:48,201 INFO ]: Abstraction has 30 states and 32 transitions. [2018-06-26 17:55:48,201 INFO ]: Interpolant automaton has 25 states. [2018-06-26 17:55:48,201 INFO ]: Start isEmpty. Operand 30 states and 32 transitions. [2018-06-26 17:55:48,202 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:55:48,202 INFO ]: Found error trace [2018-06-26 17:55:48,202 INFO ]: trace histogram [12, 10, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:48,202 INFO ]: === Iteration 33 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:48,202 INFO ]: Analyzing trace with hash -1273905611, now seen corresponding path program 30 times [2018-06-26 17:55:48,202 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:48,202 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:48,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:48,202 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:48,202 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:48,214 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:48,633 INFO ]: Checked inductivity of 133 backedges. 55 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:48,633 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:48,633 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:48,644 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:48,684 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-06-26 17:55:48,684 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:48,686 INFO ]: Computing forward predicates... [2018-06-26 17:55:48,996 INFO ]: Checked inductivity of 133 backedges. 78 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:49,014 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:49,014 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 38 [2018-06-26 17:55:49,015 INFO ]: Interpolant automaton has 38 states [2018-06-26 17:55:49,015 INFO ]: Constructing interpolant automaton starting with 38 interpolants. [2018-06-26 17:55:49,015 INFO ]: CoverageRelationStatistics Valid=339, Invalid=1067, Unknown=0, NotChecked=0, Total=1406 [2018-06-26 17:55:49,015 INFO ]: Start difference. First operand 30 states and 32 transitions. Second operand 38 states. [2018-06-26 17:55:49,252 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:49,253 INFO ]: Finished difference Result 42 states and 44 transitions. [2018-06-26 17:55:49,253 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:55:49,253 INFO ]: Start accepts. Automaton has 38 states. Word has length 28 [2018-06-26 17:55:49,253 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:49,253 INFO ]: With dead ends: 42 [2018-06-26 17:55:49,253 INFO ]: Without dead ends: 29 [2018-06-26 17:55:49,254 INFO ]: 0 DeclaredPredicates, 66 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=625, Invalid=1925, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 17:55:49,254 INFO ]: Start minimizeSevpa. Operand 29 states. [2018-06-26 17:55:49,255 INFO ]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-06-26 17:55:49,255 INFO ]: Start removeUnreachable. Operand 29 states. [2018-06-26 17:55:49,256 INFO ]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-06-26 17:55:49,256 INFO ]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-06-26 17:55:49,256 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:49,256 INFO ]: Abstraction has 29 states and 30 transitions. [2018-06-26 17:55:49,256 INFO ]: Interpolant automaton has 38 states. [2018-06-26 17:55:49,256 INFO ]: Start isEmpty. Operand 29 states and 30 transitions. [2018-06-26 17:55:49,256 INFO ]: Finished isEmpty. Found accepting run of length 29 [2018-06-26 17:55:49,256 INFO ]: Found error trace [2018-06-26 17:55:49,256 INFO ]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:49,257 INFO ]: === Iteration 34 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:49,257 INFO ]: Analyzing trace with hash 1458351961, now seen corresponding path program 31 times [2018-06-26 17:55:49,257 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:49,257 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:49,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:49,257 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:49,257 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:49,270 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:49,514 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:49,515 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:49,515 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:49,520 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:49,555 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:49,558 INFO ]: Computing forward predicates... [2018-06-26 17:55:49,719 INFO ]: Checked inductivity of 132 backedges. 66 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:49,737 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:49,737 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 37 [2018-06-26 17:55:49,737 INFO ]: Interpolant automaton has 37 states [2018-06-26 17:55:49,737 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 17:55:49,738 INFO ]: CoverageRelationStatistics Valid=336, Invalid=996, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:55:49,738 INFO ]: Start difference. First operand 29 states and 30 transitions. Second operand 37 states. [2018-06-26 17:55:49,918 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:49,918 INFO ]: Finished difference Result 30 states and 31 transitions. [2018-06-26 17:55:49,918 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-06-26 17:55:49,918 INFO ]: Start accepts. Automaton has 37 states. Word has length 28 [2018-06-26 17:55:49,918 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:49,918 INFO ]: With dead ends: 30 [2018-06-26 17:55:49,918 INFO ]: Without dead ends: 30 [2018-06-26 17:55:49,919 INFO ]: 0 DeclaredPredicates, 65 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=714, Invalid=1638, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 17:55:49,919 INFO ]: Start minimizeSevpa. Operand 30 states. [2018-06-26 17:55:49,920 INFO ]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-06-26 17:55:49,920 INFO ]: Start removeUnreachable. Operand 30 states. [2018-06-26 17:55:49,921 INFO ]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-06-26 17:55:49,921 INFO ]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-06-26 17:55:49,921 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:49,921 INFO ]: Abstraction has 30 states and 31 transitions. [2018-06-26 17:55:49,921 INFO ]: Interpolant automaton has 37 states. [2018-06-26 17:55:49,921 INFO ]: Start isEmpty. Operand 30 states and 31 transitions. [2018-06-26 17:55:49,921 INFO ]: Finished isEmpty. Found accepting run of length 30 [2018-06-26 17:55:49,921 INFO ]: Found error trace [2018-06-26 17:55:49,921 INFO ]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:49,921 INFO ]: === Iteration 35 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:49,921 INFO ]: Analyzing trace with hash -2036202174, now seen corresponding path program 32 times [2018-06-26 17:55:49,921 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:49,921 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:49,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:49,924 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:49,924 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:49,934 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:50,377 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:50,377 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:50,377 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:50,383 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:50,421 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:50,421 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:50,425 INFO ]: Computing forward predicates... [2018-06-26 17:55:50,533 INFO ]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:50,551 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:50,551 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-06-26 17:55:50,551 INFO ]: Interpolant automaton has 27 states [2018-06-26 17:55:50,551 INFO ]: Constructing interpolant automaton starting with 27 interpolants. [2018-06-26 17:55:50,552 INFO ]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-06-26 17:55:50,552 INFO ]: Start difference. First operand 30 states and 31 transitions. Second operand 27 states. [2018-06-26 17:55:51,348 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:51,348 INFO ]: Finished difference Result 46 states and 49 transitions. [2018-06-26 17:55:51,348 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:55:51,348 INFO ]: Start accepts. Automaton has 27 states. Word has length 29 [2018-06-26 17:55:51,348 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:51,348 INFO ]: With dead ends: 46 [2018-06-26 17:55:51,348 INFO ]: Without dead ends: 46 [2018-06-26 17:55:51,349 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=1577, Unknown=0, NotChecked=0, Total=1722 [2018-06-26 17:55:51,349 INFO ]: Start minimizeSevpa. Operand 46 states. [2018-06-26 17:55:51,350 INFO ]: Finished minimizeSevpa. Reduced states from 46 to 32. [2018-06-26 17:55:51,350 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:55:51,350 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-06-26 17:55:51,350 INFO ]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-06-26 17:55:51,351 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:51,351 INFO ]: Abstraction has 32 states and 34 transitions. [2018-06-26 17:55:51,351 INFO ]: Interpolant automaton has 27 states. [2018-06-26 17:55:51,351 INFO ]: Start isEmpty. Operand 32 states and 34 transitions. [2018-06-26 17:55:51,351 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:55:51,351 INFO ]: Found error trace [2018-06-26 17:55:51,351 INFO ]: trace histogram [13, 11, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:51,351 INFO ]: === Iteration 36 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:51,351 INFO ]: Analyzing trace with hash 1301769337, now seen corresponding path program 33 times [2018-06-26 17:55:51,351 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:51,351 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:51,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:51,352 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:51,352 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:51,361 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:51,643 INFO ]: Checked inductivity of 157 backedges. 66 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:51,643 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:51,643 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:51,648 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:51,693 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-06-26 17:55:51,693 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:51,696 INFO ]: Computing forward predicates... [2018-06-26 17:55:52,033 INFO ]: Checked inductivity of 157 backedges. 91 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:52,052 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:52,052 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 41 [2018-06-26 17:55:52,053 INFO ]: Interpolant automaton has 41 states [2018-06-26 17:55:52,053 INFO ]: Constructing interpolant automaton starting with 41 interpolants. [2018-06-26 17:55:52,053 INFO ]: CoverageRelationStatistics Valid=393, Invalid=1247, Unknown=0, NotChecked=0, Total=1640 [2018-06-26 17:55:52,053 INFO ]: Start difference. First operand 32 states and 34 transitions. Second operand 41 states. [2018-06-26 17:55:52,303 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:52,303 INFO ]: Finished difference Result 45 states and 47 transitions. [2018-06-26 17:55:52,303 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:55:52,303 INFO ]: Start accepts. Automaton has 41 states. Word has length 30 [2018-06-26 17:55:52,303 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:52,304 INFO ]: With dead ends: 45 [2018-06-26 17:55:52,304 INFO ]: Without dead ends: 31 [2018-06-26 17:55:52,304 INFO ]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=722, Invalid=2248, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 17:55:52,304 INFO ]: Start minimizeSevpa. Operand 31 states. [2018-06-26 17:55:52,305 INFO ]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-06-26 17:55:52,305 INFO ]: Start removeUnreachable. Operand 31 states. [2018-06-26 17:55:52,306 INFO ]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-06-26 17:55:52,306 INFO ]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-06-26 17:55:52,306 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:52,306 INFO ]: Abstraction has 31 states and 32 transitions. [2018-06-26 17:55:52,306 INFO ]: Interpolant automaton has 41 states. [2018-06-26 17:55:52,306 INFO ]: Start isEmpty. Operand 31 states and 32 transitions. [2018-06-26 17:55:52,306 INFO ]: Finished isEmpty. Found accepting run of length 31 [2018-06-26 17:55:52,306 INFO ]: Found error trace [2018-06-26 17:55:52,306 INFO ]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:52,306 INFO ]: === Iteration 37 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:52,306 INFO ]: Analyzing trace with hash 102408149, now seen corresponding path program 34 times [2018-06-26 17:55:52,306 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:52,306 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:52,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:52,307 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:52,307 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:52,318 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:52,751 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:52,751 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:52,751 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:52,757 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:52,796 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:52,796 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:52,799 INFO ]: Computing forward predicates... [2018-06-26 17:55:53,020 INFO ]: Checked inductivity of 156 backedges. 78 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:53,040 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:53,040 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 40 [2018-06-26 17:55:53,040 INFO ]: Interpolant automaton has 40 states [2018-06-26 17:55:53,040 INFO ]: Constructing interpolant automaton starting with 40 interpolants. [2018-06-26 17:55:53,040 INFO ]: CoverageRelationStatistics Valid=390, Invalid=1170, Unknown=0, NotChecked=0, Total=1560 [2018-06-26 17:55:53,040 INFO ]: Start difference. First operand 31 states and 32 transitions. Second operand 40 states. [2018-06-26 17:55:53,292 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:53,292 INFO ]: Finished difference Result 32 states and 33 transitions. [2018-06-26 17:55:53,292 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-06-26 17:55:53,292 INFO ]: Start accepts. Automaton has 40 states. Word has length 30 [2018-06-26 17:55:53,292 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:53,292 INFO ]: With dead ends: 32 [2018-06-26 17:55:53,292 INFO ]: Without dead ends: 32 [2018-06-26 17:55:53,293 INFO ]: 0 DeclaredPredicates, 70 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=832, Invalid=1924, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 17:55:53,293 INFO ]: Start minimizeSevpa. Operand 32 states. [2018-06-26 17:55:53,294 INFO ]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-06-26 17:55:53,294 INFO ]: Start removeUnreachable. Operand 32 states. [2018-06-26 17:55:53,294 INFO ]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-06-26 17:55:53,294 INFO ]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-06-26 17:55:53,294 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:53,294 INFO ]: Abstraction has 32 states and 33 transitions. [2018-06-26 17:55:53,294 INFO ]: Interpolant automaton has 40 states. [2018-06-26 17:55:53,294 INFO ]: Start isEmpty. Operand 32 states and 33 transitions. [2018-06-26 17:55:53,295 INFO ]: Finished isEmpty. Found accepting run of length 32 [2018-06-26 17:55:53,295 INFO ]: Found error trace [2018-06-26 17:55:53,295 INFO ]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:53,295 INFO ]: === Iteration 38 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:53,295 INFO ]: Analyzing trace with hash -1120787386, now seen corresponding path program 35 times [2018-06-26 17:55:53,295 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:53,295 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:53,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:53,295 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:53,295 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:53,307 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:53,913 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:53,913 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:53,913 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:53,919 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:55:53,970 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-06-26 17:55:53,970 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:53,974 INFO ]: Computing forward predicates... [2018-06-26 17:55:54,069 INFO ]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:54,087 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:54,087 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-06-26 17:55:54,087 INFO ]: Interpolant automaton has 29 states [2018-06-26 17:55:54,087 INFO ]: Constructing interpolant automaton starting with 29 interpolants. [2018-06-26 17:55:54,088 INFO ]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-06-26 17:55:54,088 INFO ]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2018-06-26 17:55:54,743 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:54,743 INFO ]: Finished difference Result 49 states and 52 transitions. [2018-06-26 17:55:54,743 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:55:54,743 INFO ]: Start accepts. Automaton has 29 states. Word has length 31 [2018-06-26 17:55:54,743 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:54,743 INFO ]: With dead ends: 49 [2018-06-26 17:55:54,743 INFO ]: Without dead ends: 49 [2018-06-26 17:55:54,744 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=1824, Unknown=0, NotChecked=0, Total=1980 [2018-06-26 17:55:54,744 INFO ]: Start minimizeSevpa. Operand 49 states. [2018-06-26 17:55:54,744 INFO ]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-06-26 17:55:54,744 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:55:54,745 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-06-26 17:55:54,745 INFO ]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-06-26 17:55:54,745 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:54,745 INFO ]: Abstraction has 34 states and 36 transitions. [2018-06-26 17:55:54,745 INFO ]: Interpolant automaton has 29 states. [2018-06-26 17:55:54,745 INFO ]: Start isEmpty. Operand 34 states and 36 transitions. [2018-06-26 17:55:54,745 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:55:54,745 INFO ]: Found error trace [2018-06-26 17:55:54,745 INFO ]: trace histogram [14, 12, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:54,745 INFO ]: === Iteration 39 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:54,746 INFO ]: Analyzing trace with hash -385143307, now seen corresponding path program 36 times [2018-06-26 17:55:54,746 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:54,746 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:54,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:54,746 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:54,746 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:54,753 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:55,119 INFO ]: Checked inductivity of 183 backedges. 78 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:55,119 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:55,119 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:55,124 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:55:55,173 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-06-26 17:55:55,173 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:55,176 INFO ]: Computing forward predicates... [2018-06-26 17:55:55,472 INFO ]: Checked inductivity of 183 backedges. 105 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:55,490 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:55,491 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 44 [2018-06-26 17:55:55,491 INFO ]: Interpolant automaton has 44 states [2018-06-26 17:55:55,491 INFO ]: Constructing interpolant automaton starting with 44 interpolants. [2018-06-26 17:55:55,491 INFO ]: CoverageRelationStatistics Valid=451, Invalid=1441, Unknown=0, NotChecked=0, Total=1892 [2018-06-26 17:55:55,491 INFO ]: Start difference. First operand 34 states and 36 transitions. Second operand 44 states. [2018-06-26 17:55:55,758 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:55,758 INFO ]: Finished difference Result 48 states and 50 transitions. [2018-06-26 17:55:55,758 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:55:55,758 INFO ]: Start accepts. Automaton has 44 states. Word has length 32 [2018-06-26 17:55:55,758 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:55,759 INFO ]: With dead ends: 48 [2018-06-26 17:55:55,759 INFO ]: Without dead ends: 33 [2018-06-26 17:55:55,759 INFO ]: 0 DeclaredPredicates, 76 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=826, Invalid=2596, Unknown=0, NotChecked=0, Total=3422 [2018-06-26 17:55:55,759 INFO ]: Start minimizeSevpa. Operand 33 states. [2018-06-26 17:55:55,760 INFO ]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-06-26 17:55:55,760 INFO ]: Start removeUnreachable. Operand 33 states. [2018-06-26 17:55:55,761 INFO ]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-06-26 17:55:55,761 INFO ]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-06-26 17:55:55,761 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:55,761 INFO ]: Abstraction has 33 states and 34 transitions. [2018-06-26 17:55:55,761 INFO ]: Interpolant automaton has 44 states. [2018-06-26 17:55:55,761 INFO ]: Start isEmpty. Operand 33 states and 34 transitions. [2018-06-26 17:55:55,761 INFO ]: Finished isEmpty. Found accepting run of length 33 [2018-06-26 17:55:55,761 INFO ]: Found error trace [2018-06-26 17:55:55,761 INFO ]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:55,761 INFO ]: === Iteration 40 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:55,761 INFO ]: Analyzing trace with hash 1089365529, now seen corresponding path program 37 times [2018-06-26 17:55:55,761 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:55,761 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:55,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:55,762 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:55,762 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:55,771 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:56,169 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:56,169 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:56,169 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:56,174 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:56,214 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:56,217 INFO ]: Computing forward predicates... [2018-06-26 17:55:56,433 INFO ]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:56,451 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:56,451 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 43 [2018-06-26 17:55:56,451 INFO ]: Interpolant automaton has 43 states [2018-06-26 17:55:56,452 INFO ]: Constructing interpolant automaton starting with 43 interpolants. [2018-06-26 17:55:56,452 INFO ]: CoverageRelationStatistics Valid=448, Invalid=1358, Unknown=0, NotChecked=0, Total=1806 [2018-06-26 17:55:56,452 INFO ]: Start difference. First operand 33 states and 34 transitions. Second operand 43 states. [2018-06-26 17:55:56,704 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:56,704 INFO ]: Finished difference Result 34 states and 35 transitions. [2018-06-26 17:55:56,704 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-06-26 17:55:56,704 INFO ]: Start accepts. Automaton has 43 states. Word has length 32 [2018-06-26 17:55:56,704 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:56,705 INFO ]: With dead ends: 34 [2018-06-26 17:55:56,705 INFO ]: Without dead ends: 34 [2018-06-26 17:55:56,705 INFO ]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=959, Invalid=2233, Unknown=0, NotChecked=0, Total=3192 [2018-06-26 17:55:56,705 INFO ]: Start minimizeSevpa. Operand 34 states. [2018-06-26 17:55:56,705 INFO ]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-06-26 17:55:56,706 INFO ]: Start removeUnreachable. Operand 34 states. [2018-06-26 17:55:56,706 INFO ]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-06-26 17:55:56,706 INFO ]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-06-26 17:55:56,706 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:56,706 INFO ]: Abstraction has 34 states and 35 transitions. [2018-06-26 17:55:56,706 INFO ]: Interpolant automaton has 43 states. [2018-06-26 17:55:56,706 INFO ]: Start isEmpty. Operand 34 states and 35 transitions. [2018-06-26 17:55:56,706 INFO ]: Finished isEmpty. Found accepting run of length 34 [2018-06-26 17:55:56,706 INFO ]: Found error trace [2018-06-26 17:55:56,706 INFO ]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:56,706 INFO ]: === Iteration 41 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:56,706 INFO ]: Analyzing trace with hash -589879678, now seen corresponding path program 38 times [2018-06-26 17:55:56,706 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:56,706 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:56,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:56,707 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:55:56,707 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:56,716 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:57,149 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:57,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:57,149 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:57,155 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:55:57,198 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:55:57,198 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:57,202 INFO ]: Computing forward predicates... [2018-06-26 17:55:57,333 INFO ]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:57,351 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:57,352 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-06-26 17:55:57,352 INFO ]: Interpolant automaton has 31 states [2018-06-26 17:55:57,352 INFO ]: Constructing interpolant automaton starting with 31 interpolants. [2018-06-26 17:55:57,352 INFO ]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-06-26 17:55:57,352 INFO ]: Start difference. First operand 34 states and 35 transitions. Second operand 31 states. [2018-06-26 17:55:58,094 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:58,094 INFO ]: Finished difference Result 52 states and 55 transitions. [2018-06-26 17:55:58,094 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:55:58,094 INFO ]: Start accepts. Automaton has 31 states. Word has length 33 [2018-06-26 17:55:58,094 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:58,095 INFO ]: With dead ends: 52 [2018-06-26 17:55:58,095 INFO ]: Without dead ends: 52 [2018-06-26 17:55:58,095 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 23 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=2089, Unknown=0, NotChecked=0, Total=2256 [2018-06-26 17:55:58,095 INFO ]: Start minimizeSevpa. Operand 52 states. [2018-06-26 17:55:58,096 INFO ]: Finished minimizeSevpa. Reduced states from 52 to 36. [2018-06-26 17:55:58,096 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:55:58,096 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-06-26 17:55:58,096 INFO ]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-06-26 17:55:58,096 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:58,096 INFO ]: Abstraction has 36 states and 38 transitions. [2018-06-26 17:55:58,096 INFO ]: Interpolant automaton has 31 states. [2018-06-26 17:55:58,096 INFO ]: Start isEmpty. Operand 36 states and 38 transitions. [2018-06-26 17:55:58,096 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:55:58,096 INFO ]: Found error trace [2018-06-26 17:55:58,097 INFO ]: trace histogram [15, 13, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:58,097 INFO ]: === Iteration 42 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:58,097 INFO ]: Analyzing trace with hash -1106873543, now seen corresponding path program 39 times [2018-06-26 17:55:58,097 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:58,097 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:58,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:58,097 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:58,097 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:58,104 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:58,435 INFO ]: Checked inductivity of 211 backedges. 91 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:58,435 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:58,435 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:58,441 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:55:58,494 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-06-26 17:55:58,494 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:58,497 INFO ]: Computing forward predicates... [2018-06-26 17:55:58,876 INFO ]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:58,894 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:58,894 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 47 [2018-06-26 17:55:58,895 INFO ]: Interpolant automaton has 47 states [2018-06-26 17:55:58,895 INFO ]: Constructing interpolant automaton starting with 47 interpolants. [2018-06-26 17:55:58,895 INFO ]: CoverageRelationStatistics Valid=513, Invalid=1649, Unknown=0, NotChecked=0, Total=2162 [2018-06-26 17:55:58,895 INFO ]: Start difference. First operand 36 states and 38 transitions. Second operand 47 states. [2018-06-26 17:55:59,219 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:55:59,219 INFO ]: Finished difference Result 51 states and 53 transitions. [2018-06-26 17:55:59,219 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:55:59,219 INFO ]: Start accepts. Automaton has 47 states. Word has length 34 [2018-06-26 17:55:59,220 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:55:59,220 INFO ]: With dead ends: 51 [2018-06-26 17:55:59,220 INFO ]: Without dead ends: 35 [2018-06-26 17:55:59,220 INFO ]: 0 DeclaredPredicates, 81 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=937, Invalid=2969, Unknown=0, NotChecked=0, Total=3906 [2018-06-26 17:55:59,220 INFO ]: Start minimizeSevpa. Operand 35 states. [2018-06-26 17:55:59,221 INFO ]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-06-26 17:55:59,221 INFO ]: Start removeUnreachable. Operand 35 states. [2018-06-26 17:55:59,221 INFO ]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-06-26 17:55:59,221 INFO ]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-06-26 17:55:59,221 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:55:59,221 INFO ]: Abstraction has 35 states and 36 transitions. [2018-06-26 17:55:59,221 INFO ]: Interpolant automaton has 47 states. [2018-06-26 17:55:59,221 INFO ]: Start isEmpty. Operand 35 states and 36 transitions. [2018-06-26 17:55:59,221 INFO ]: Finished isEmpty. Found accepting run of length 35 [2018-06-26 17:55:59,221 INFO ]: Found error trace [2018-06-26 17:55:59,221 INFO ]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1] [2018-06-26 17:55:59,222 INFO ]: === Iteration 43 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:55:59,222 INFO ]: Analyzing trace with hash 1653227413, now seen corresponding path program 40 times [2018-06-26 17:55:59,222 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:55:59,222 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:55:59,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:59,222 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:55:59,222 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:55:59,237 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:59,578 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:59,578 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:55:59,578 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:55:59,583 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:55:59,630 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:55:59,630 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:55:59,634 INFO ]: Computing forward predicates... [2018-06-26 17:55:59,851 INFO ]: Checked inductivity of 210 backedges. 105 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:55:59,871 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:55:59,871 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 46 [2018-06-26 17:55:59,871 INFO ]: Interpolant automaton has 46 states [2018-06-26 17:55:59,871 INFO ]: Constructing interpolant automaton starting with 46 interpolants. [2018-06-26 17:55:59,872 INFO ]: CoverageRelationStatistics Valid=510, Invalid=1560, Unknown=0, NotChecked=0, Total=2070 [2018-06-26 17:55:59,872 INFO ]: Start difference. First operand 35 states and 36 transitions. Second operand 46 states. [2018-06-26 17:56:00,241 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:00,241 INFO ]: Finished difference Result 36 states and 37 transitions. [2018-06-26 17:56:00,241 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-06-26 17:56:00,241 INFO ]: Start accepts. Automaton has 46 states. Word has length 34 [2018-06-26 17:56:00,241 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:00,241 INFO ]: With dead ends: 36 [2018-06-26 17:56:00,241 INFO ]: Without dead ends: 36 [2018-06-26 17:56:00,242 INFO ]: 0 DeclaredPredicates, 80 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1095, Invalid=2565, Unknown=0, NotChecked=0, Total=3660 [2018-06-26 17:56:00,242 INFO ]: Start minimizeSevpa. Operand 36 states. [2018-06-26 17:56:00,242 INFO ]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-06-26 17:56:00,242 INFO ]: Start removeUnreachable. Operand 36 states. [2018-06-26 17:56:00,243 INFO ]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-06-26 17:56:00,243 INFO ]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-06-26 17:56:00,243 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:00,243 INFO ]: Abstraction has 36 states and 37 transitions. [2018-06-26 17:56:00,243 INFO ]: Interpolant automaton has 46 states. [2018-06-26 17:56:00,243 INFO ]: Start isEmpty. Operand 36 states and 37 transitions. [2018-06-26 17:56:00,243 INFO ]: Finished isEmpty. Found accepting run of length 36 [2018-06-26 17:56:00,243 INFO ]: Found error trace [2018-06-26 17:56:00,243 INFO ]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:00,243 INFO ]: === Iteration 44 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:00,243 INFO ]: Analyzing trace with hash -290030458, now seen corresponding path program 41 times [2018-06-26 17:56:00,243 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:00,243 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:00,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:00,244 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:00,244 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:00,254 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:00,844 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:00,844 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:00,844 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:00,849 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:56:00,905 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-06-26 17:56:00,905 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:00,910 INFO ]: Computing forward predicates... [2018-06-26 17:56:01,020 INFO ]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:01,039 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:01,039 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-06-26 17:56:01,039 INFO ]: Interpolant automaton has 33 states [2018-06-26 17:56:01,039 INFO ]: Constructing interpolant automaton starting with 33 interpolants. [2018-06-26 17:56:01,039 INFO ]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-06-26 17:56:01,040 INFO ]: Start difference. First operand 36 states and 37 transitions. Second operand 33 states. [2018-06-26 17:56:01,891 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:01,891 INFO ]: Finished difference Result 55 states and 58 transitions. [2018-06-26 17:56:01,891 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:56:01,891 INFO ]: Start accepts. Automaton has 33 states. Word has length 35 [2018-06-26 17:56:01,891 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:01,891 INFO ]: With dead ends: 55 [2018-06-26 17:56:01,891 INFO ]: Without dead ends: 55 [2018-06-26 17:56:01,891 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 25 SyntacticMatches, 11 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=178, Invalid=2372, Unknown=0, NotChecked=0, Total=2550 [2018-06-26 17:56:01,891 INFO ]: Start minimizeSevpa. Operand 55 states. [2018-06-26 17:56:01,893 INFO ]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-06-26 17:56:01,893 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:56:01,893 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-06-26 17:56:01,893 INFO ]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-06-26 17:56:01,893 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:01,893 INFO ]: Abstraction has 38 states and 40 transitions. [2018-06-26 17:56:01,893 INFO ]: Interpolant automaton has 33 states. [2018-06-26 17:56:01,893 INFO ]: Start isEmpty. Operand 38 states and 40 transitions. [2018-06-26 17:56:01,893 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:56:01,893 INFO ]: Found error trace [2018-06-26 17:56:01,893 INFO ]: trace histogram [16, 14, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:01,893 INFO ]: === Iteration 45 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:01,893 INFO ]: Analyzing trace with hash -401482315, now seen corresponding path program 42 times [2018-06-26 17:56:01,893 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:01,893 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:01,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:01,894 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:01,894 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:01,901 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:02,745 INFO ]: Checked inductivity of 241 backedges. 105 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:02,745 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:02,745 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:02,751 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:56:02,804 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-06-26 17:56:02,805 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:02,807 INFO ]: Computing forward predicates... [2018-06-26 17:56:03,175 INFO ]: Checked inductivity of 241 backedges. 136 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:03,194 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:03,194 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 50 [2018-06-26 17:56:03,194 INFO ]: Interpolant automaton has 50 states [2018-06-26 17:56:03,195 INFO ]: Constructing interpolant automaton starting with 50 interpolants. [2018-06-26 17:56:03,195 INFO ]: CoverageRelationStatistics Valid=579, Invalid=1871, Unknown=0, NotChecked=0, Total=2450 [2018-06-26 17:56:03,195 INFO ]: Start difference. First operand 38 states and 40 transitions. Second operand 50 states. [2018-06-26 17:56:03,526 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:03,526 INFO ]: Finished difference Result 54 states and 56 transitions. [2018-06-26 17:56:03,526 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:56:03,526 INFO ]: Start accepts. Automaton has 50 states. Word has length 36 [2018-06-26 17:56:03,526 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:03,526 INFO ]: With dead ends: 54 [2018-06-26 17:56:03,526 INFO ]: Without dead ends: 37 [2018-06-26 17:56:03,527 INFO ]: 0 DeclaredPredicates, 86 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1055, Invalid=3367, Unknown=0, NotChecked=0, Total=4422 [2018-06-26 17:56:03,527 INFO ]: Start minimizeSevpa. Operand 37 states. [2018-06-26 17:56:03,527 INFO ]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-06-26 17:56:03,528 INFO ]: Start removeUnreachable. Operand 37 states. [2018-06-26 17:56:03,528 INFO ]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-06-26 17:56:03,528 INFO ]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-06-26 17:56:03,528 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:03,528 INFO ]: Abstraction has 37 states and 38 transitions. [2018-06-26 17:56:03,528 INFO ]: Interpolant automaton has 50 states. [2018-06-26 17:56:03,528 INFO ]: Start isEmpty. Operand 37 states and 38 transitions. [2018-06-26 17:56:03,528 INFO ]: Finished isEmpty. Found accepting run of length 37 [2018-06-26 17:56:03,528 INFO ]: Found error trace [2018-06-26 17:56:03,528 INFO ]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:03,528 INFO ]: === Iteration 46 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:03,528 INFO ]: Analyzing trace with hash -737698599, now seen corresponding path program 43 times [2018-06-26 17:56:03,528 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:03,528 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:03,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:03,528 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:03,528 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:03,537 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:03,836 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:03,836 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:03,836 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:03,841 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:56:03,887 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:03,890 INFO ]: Computing forward predicates... [2018-06-26 17:56:04,128 INFO ]: Checked inductivity of 240 backedges. 120 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:04,147 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:04,147 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 49 [2018-06-26 17:56:04,147 INFO ]: Interpolant automaton has 49 states [2018-06-26 17:56:04,147 INFO ]: Constructing interpolant automaton starting with 49 interpolants. [2018-06-26 17:56:04,147 INFO ]: CoverageRelationStatistics Valid=576, Invalid=1776, Unknown=0, NotChecked=0, Total=2352 [2018-06-26 17:56:04,147 INFO ]: Start difference. First operand 37 states and 38 transitions. Second operand 49 states. [2018-06-26 17:56:04,486 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:04,486 INFO ]: Finished difference Result 38 states and 39 transitions. [2018-06-26 17:56:04,486 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-06-26 17:56:04,486 INFO ]: Start accepts. Automaton has 49 states. Word has length 36 [2018-06-26 17:56:04,487 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:04,487 INFO ]: With dead ends: 38 [2018-06-26 17:56:04,487 INFO ]: Without dead ends: 38 [2018-06-26 17:56:04,487 INFO ]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1240, Invalid=2920, Unknown=0, NotChecked=0, Total=4160 [2018-06-26 17:56:04,487 INFO ]: Start minimizeSevpa. Operand 38 states. [2018-06-26 17:56:04,488 INFO ]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-06-26 17:56:04,488 INFO ]: Start removeUnreachable. Operand 38 states. [2018-06-26 17:56:04,488 INFO ]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-06-26 17:56:04,488 INFO ]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-06-26 17:56:04,488 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:04,488 INFO ]: Abstraction has 38 states and 39 transitions. [2018-06-26 17:56:04,488 INFO ]: Interpolant automaton has 49 states. [2018-06-26 17:56:04,488 INFO ]: Start isEmpty. Operand 38 states and 39 transitions. [2018-06-26 17:56:04,489 INFO ]: Finished isEmpty. Found accepting run of length 38 [2018-06-26 17:56:04,489 INFO ]: Found error trace [2018-06-26 17:56:04,489 INFO ]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:04,489 INFO ]: === Iteration 47 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:04,489 INFO ]: Analyzing trace with hash -1394292798, now seen corresponding path program 44 times [2018-06-26 17:56:04,489 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:04,489 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:04,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:04,489 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:56:04,489 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:04,497 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:05,075 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:05,075 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:05,075 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:05,083 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:56:05,135 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:56:05,135 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:05,139 INFO ]: Computing forward predicates... [2018-06-26 17:56:05,273 INFO ]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:05,291 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:05,291 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-06-26 17:56:05,291 INFO ]: Interpolant automaton has 35 states [2018-06-26 17:56:05,291 INFO ]: Constructing interpolant automaton starting with 35 interpolants. [2018-06-26 17:56:05,291 INFO ]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-06-26 17:56:05,292 INFO ]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2018-06-26 17:56:06,402 WARN ]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-06-26 17:56:06,403 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:06,403 INFO ]: Finished difference Result 58 states and 61 transitions. [2018-06-26 17:56:06,403 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:56:06,403 INFO ]: Start accepts. Automaton has 35 states. Word has length 37 [2018-06-26 17:56:06,404 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:06,404 INFO ]: With dead ends: 58 [2018-06-26 17:56:06,404 INFO ]: Without dead ends: 58 [2018-06-26 17:56:06,404 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 26 SyntacticMatches, 12 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2018-06-26 17:56:06,404 INFO ]: Start minimizeSevpa. Operand 58 states. [2018-06-26 17:56:06,405 INFO ]: Finished minimizeSevpa. Reduced states from 58 to 40. [2018-06-26 17:56:06,405 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:56:06,405 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-06-26 17:56:06,405 INFO ]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-06-26 17:56:06,406 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:06,406 INFO ]: Abstraction has 40 states and 42 transitions. [2018-06-26 17:56:06,406 INFO ]: Interpolant automaton has 35 states. [2018-06-26 17:56:06,406 INFO ]: Start isEmpty. Operand 40 states and 42 transitions. [2018-06-26 17:56:06,406 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:56:06,406 INFO ]: Found error trace [2018-06-26 17:56:06,406 INFO ]: trace histogram [17, 15, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:06,406 INFO ]: === Iteration 48 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:06,406 INFO ]: Analyzing trace with hash -273876487, now seen corresponding path program 45 times [2018-06-26 17:56:06,406 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:06,406 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:06,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:06,407 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:06,407 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:06,417 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:07,390 INFO ]: Checked inductivity of 273 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:07,390 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:07,390 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:07,395 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:56:07,454 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-06-26 17:56:07,455 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:07,458 INFO ]: Computing forward predicates... [2018-06-26 17:56:08,105 INFO ]: Checked inductivity of 273 backedges. 153 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:08,125 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:08,125 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 53 [2018-06-26 17:56:08,125 INFO ]: Interpolant automaton has 53 states [2018-06-26 17:56:08,126 INFO ]: Constructing interpolant automaton starting with 53 interpolants. [2018-06-26 17:56:08,126 INFO ]: CoverageRelationStatistics Valid=649, Invalid=2107, Unknown=0, NotChecked=0, Total=2756 [2018-06-26 17:56:08,126 INFO ]: Start difference. First operand 40 states and 42 transitions. Second operand 53 states. [2018-06-26 17:56:08,504 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:08,504 INFO ]: Finished difference Result 57 states and 59 transitions. [2018-06-26 17:56:08,504 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:56:08,504 INFO ]: Start accepts. Automaton has 53 states. Word has length 38 [2018-06-26 17:56:08,504 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:08,504 INFO ]: With dead ends: 57 [2018-06-26 17:56:08,504 INFO ]: Without dead ends: 39 [2018-06-26 17:56:08,505 INFO ]: 0 DeclaredPredicates, 91 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1180, Invalid=3790, Unknown=0, NotChecked=0, Total=4970 [2018-06-26 17:56:08,505 INFO ]: Start minimizeSevpa. Operand 39 states. [2018-06-26 17:56:08,506 INFO ]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-06-26 17:56:08,506 INFO ]: Start removeUnreachable. Operand 39 states. [2018-06-26 17:56:08,506 INFO ]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-06-26 17:56:08,506 INFO ]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-06-26 17:56:08,506 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:08,506 INFO ]: Abstraction has 39 states and 40 transitions. [2018-06-26 17:56:08,506 INFO ]: Interpolant automaton has 53 states. [2018-06-26 17:56:08,506 INFO ]: Start isEmpty. Operand 39 states and 40 transitions. [2018-06-26 17:56:08,507 INFO ]: Finished isEmpty. Found accepting run of length 39 [2018-06-26 17:56:08,507 INFO ]: Found error trace [2018-06-26 17:56:08,507 INFO ]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:08,507 INFO ]: === Iteration 49 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:08,507 INFO ]: Analyzing trace with hash -2106646699, now seen corresponding path program 46 times [2018-06-26 17:56:08,507 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:08,507 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:08,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:08,507 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:08,507 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:08,521 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:08,915 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:08,915 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:08,915 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:08,921 INFO ]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-06-26 17:56:08,969 INFO ]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-06-26 17:56:08,969 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:08,972 INFO ]: Computing forward predicates... [2018-06-26 17:56:09,278 INFO ]: Checked inductivity of 272 backedges. 136 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:09,296 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:09,296 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 52 [2018-06-26 17:56:09,296 INFO ]: Interpolant automaton has 52 states [2018-06-26 17:56:09,297 INFO ]: Constructing interpolant automaton starting with 52 interpolants. [2018-06-26 17:56:09,297 INFO ]: CoverageRelationStatistics Valid=646, Invalid=2006, Unknown=0, NotChecked=0, Total=2652 [2018-06-26 17:56:09,297 INFO ]: Start difference. First operand 39 states and 40 transitions. Second operand 52 states. [2018-06-26 17:56:09,808 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:09,808 INFO ]: Finished difference Result 40 states and 41 transitions. [2018-06-26 17:56:09,808 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-06-26 17:56:09,808 INFO ]: Start accepts. Automaton has 52 states. Word has length 38 [2018-06-26 17:56:09,808 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:09,808 INFO ]: With dead ends: 40 [2018-06-26 17:56:09,808 INFO ]: Without dead ends: 40 [2018-06-26 17:56:09,809 INFO ]: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1394, Invalid=3298, Unknown=0, NotChecked=0, Total=4692 [2018-06-26 17:56:09,810 INFO ]: Start minimizeSevpa. Operand 40 states. [2018-06-26 17:56:09,810 INFO ]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-06-26 17:56:09,810 INFO ]: Start removeUnreachable. Operand 40 states. [2018-06-26 17:56:09,810 INFO ]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-06-26 17:56:09,810 INFO ]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-06-26 17:56:09,811 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:09,811 INFO ]: Abstraction has 40 states and 41 transitions. [2018-06-26 17:56:09,811 INFO ]: Interpolant automaton has 52 states. [2018-06-26 17:56:09,811 INFO ]: Start isEmpty. Operand 40 states and 41 transitions. [2018-06-26 17:56:09,811 INFO ]: Finished isEmpty. Found accepting run of length 40 [2018-06-26 17:56:09,811 INFO ]: Found error trace [2018-06-26 17:56:09,811 INFO ]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:09,811 INFO ]: === Iteration 50 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:09,811 INFO ]: Analyzing trace with hash -882010938, now seen corresponding path program 47 times [2018-06-26 17:56:09,811 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:09,811 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:09,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:09,811 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:09,811 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:09,821 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:11,149 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:11,149 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:11,149 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:11,155 INFO ]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-06-26 17:56:11,236 INFO ]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-06-26 17:56:11,236 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:11,241 INFO ]: Computing forward predicates... [2018-06-26 17:56:11,354 INFO ]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:11,373 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:11,373 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-06-26 17:56:11,373 INFO ]: Interpolant automaton has 37 states [2018-06-26 17:56:11,373 INFO ]: Constructing interpolant automaton starting with 37 interpolants. [2018-06-26 17:56:11,373 INFO ]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-06-26 17:56:11,373 INFO ]: Start difference. First operand 40 states and 41 transitions. Second operand 37 states. [2018-06-26 17:56:12,459 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:12,460 INFO ]: Finished difference Result 61 states and 64 transitions. [2018-06-26 17:56:12,460 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 17:56:12,460 INFO ]: Start accepts. Automaton has 37 states. Word has length 39 [2018-06-26 17:56:12,460 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:12,460 INFO ]: With dead ends: 61 [2018-06-26 17:56:12,460 INFO ]: Without dead ends: 61 [2018-06-26 17:56:12,460 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 11 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=200, Invalid=2992, Unknown=0, NotChecked=0, Total=3192 [2018-06-26 17:56:12,460 INFO ]: Start minimizeSevpa. Operand 61 states. [2018-06-26 17:56:12,461 INFO ]: Finished minimizeSevpa. Reduced states from 61 to 42. [2018-06-26 17:56:12,461 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 17:56:12,462 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-06-26 17:56:12,462 INFO ]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-06-26 17:56:12,462 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:12,462 INFO ]: Abstraction has 42 states and 44 transitions. [2018-06-26 17:56:12,462 INFO ]: Interpolant automaton has 37 states. [2018-06-26 17:56:12,462 INFO ]: Start isEmpty. Operand 42 states and 44 transitions. [2018-06-26 17:56:12,462 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:56:12,462 INFO ]: Found error trace [2018-06-26 17:56:12,462 INFO ]: trace histogram [18, 16, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:12,462 INFO ]: === Iteration 51 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:12,463 INFO ]: Analyzing trace with hash -1573008011, now seen corresponding path program 48 times [2018-06-26 17:56:12,463 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:12,463 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:12,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:12,463 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:12,463 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:12,474 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:13,512 INFO ]: Checked inductivity of 307 backedges. 136 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:13,512 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:13,512 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:13,519 INFO ]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-06-26 17:56:13,581 INFO ]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-06-26 17:56:13,581 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:13,585 INFO ]: Computing forward predicates... [2018-06-26 17:56:15,251 INFO ]: Checked inductivity of 307 backedges. 171 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:15,270 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:15,270 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 56 [2018-06-26 17:56:15,270 INFO ]: Interpolant automaton has 56 states [2018-06-26 17:56:15,270 INFO ]: Constructing interpolant automaton starting with 56 interpolants. [2018-06-26 17:56:15,270 INFO ]: CoverageRelationStatistics Valid=723, Invalid=2357, Unknown=0, NotChecked=0, Total=3080 [2018-06-26 17:56:15,270 INFO ]: Start difference. First operand 42 states and 44 transitions. Second operand 56 states. [2018-06-26 17:56:15,614 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:15,614 INFO ]: Finished difference Result 60 states and 62 transitions. [2018-06-26 17:56:15,614 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-06-26 17:56:15,614 INFO ]: Start accepts. Automaton has 56 states. Word has length 40 [2018-06-26 17:56:15,614 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:15,614 INFO ]: With dead ends: 60 [2018-06-26 17:56:15,614 INFO ]: Without dead ends: 41 [2018-06-26 17:56:15,615 INFO ]: 0 DeclaredPredicates, 96 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1312, Invalid=4238, Unknown=0, NotChecked=0, Total=5550 [2018-06-26 17:56:15,615 INFO ]: Start minimizeSevpa. Operand 41 states. [2018-06-26 17:56:15,615 INFO ]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-06-26 17:56:15,616 INFO ]: Start removeUnreachable. Operand 41 states. [2018-06-26 17:56:15,616 INFO ]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-06-26 17:56:15,616 INFO ]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-06-26 17:56:15,616 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:15,616 INFO ]: Abstraction has 41 states and 42 transitions. [2018-06-26 17:56:15,616 INFO ]: Interpolant automaton has 56 states. [2018-06-26 17:56:15,616 INFO ]: Start isEmpty. Operand 41 states and 42 transitions. [2018-06-26 17:56:15,616 INFO ]: Finished isEmpty. Found accepting run of length 41 [2018-06-26 17:56:15,616 INFO ]: Found error trace [2018-06-26 17:56:15,616 INFO ]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:15,616 INFO ]: === Iteration 52 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:15,616 INFO ]: Analyzing trace with hash 1740657561, now seen corresponding path program 49 times [2018-06-26 17:56:15,616 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:15,616 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:15,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:15,617 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:15,617 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:15,628 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:16,044 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:16,044 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:16,044 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:16,052 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:56:16,105 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:16,109 INFO ]: Computing forward predicates... [2018-06-26 17:56:16,464 INFO ]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:16,483 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:16,483 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 55 [2018-06-26 17:56:16,483 INFO ]: Interpolant automaton has 55 states [2018-06-26 17:56:16,484 INFO ]: Constructing interpolant automaton starting with 55 interpolants. [2018-06-26 17:56:16,484 INFO ]: CoverageRelationStatistics Valid=720, Invalid=2250, Unknown=0, NotChecked=0, Total=2970 [2018-06-26 17:56:16,484 INFO ]: Start difference. First operand 41 states and 42 transitions. Second operand 55 states. [2018-06-26 17:56:17,010 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:17,010 INFO ]: Finished difference Result 42 states and 43 transitions. [2018-06-26 17:56:17,010 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-06-26 17:56:17,010 INFO ]: Start accepts. Automaton has 55 states. Word has length 40 [2018-06-26 17:56:17,010 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:17,011 INFO ]: With dead ends: 42 [2018-06-26 17:56:17,011 INFO ]: Without dead ends: 42 [2018-06-26 17:56:17,011 INFO ]: 0 DeclaredPredicates, 95 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1557, Invalid=3699, Unknown=0, NotChecked=0, Total=5256 [2018-06-26 17:56:17,011 INFO ]: Start minimizeSevpa. Operand 42 states. [2018-06-26 17:56:17,012 INFO ]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-06-26 17:56:17,012 INFO ]: Start removeUnreachable. Operand 42 states. [2018-06-26 17:56:17,012 INFO ]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-06-26 17:56:17,012 INFO ]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-06-26 17:56:17,012 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:17,012 INFO ]: Abstraction has 42 states and 43 transitions. [2018-06-26 17:56:17,012 INFO ]: Interpolant automaton has 55 states. [2018-06-26 17:56:17,012 INFO ]: Start isEmpty. Operand 42 states and 43 transitions. [2018-06-26 17:56:17,012 INFO ]: Finished isEmpty. Found accepting run of length 42 [2018-06-26 17:56:17,012 INFO ]: Found error trace [2018-06-26 17:56:17,012 INFO ]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:17,012 INFO ]: === Iteration 53 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:17,012 INFO ]: Analyzing trace with hash -1874663166, now seen corresponding path program 50 times [2018-06-26 17:56:17,012 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:17,012 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:17,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:17,013 INFO ]: Keeping assertion order NOT_INCREMENTALLY [2018-06-26 17:56:17,013 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:17,023 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:17,713 INFO ]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:17,713 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:17,713 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:17,720 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-06-26 17:56:17,775 INFO ]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-06-26 17:56:17,775 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:17,780 INFO ]: Computing forward predicates... [2018-06-26 17:56:17,906 INFO ]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:17,925 INFO ]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-06-26 17:56:17,944 INFO ]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-06-26 17:56:17,945 INFO ]: Interpolant automaton has 39 states [2018-06-26 17:56:17,945 INFO ]: Constructing interpolant automaton starting with 39 interpolants. [2018-06-26 17:56:17,945 INFO ]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-06-26 17:56:17,945 INFO ]: Start difference. First operand 42 states and 43 transitions. Second operand 39 states. [2018-06-26 17:56:19,160 INFO ]: Subtrahend was deterministic. Have not used determinization. [2018-06-26 17:56:19,160 INFO ]: Finished difference Result 64 states and 67 transitions. [2018-06-26 17:56:19,160 INFO ]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-06-26 17:56:19,160 INFO ]: Start accepts. Automaton has 39 states. Word has length 41 [2018-06-26 17:56:19,160 INFO ]: Finished accepts. some prefix is accepted. [2018-06-26 17:56:19,160 INFO ]: With dead ends: 64 [2018-06-26 17:56:19,160 INFO ]: Without dead ends: 64 [2018-06-26 17:56:19,161 INFO ]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=3329, Unknown=0, NotChecked=0, Total=3540 [2018-06-26 17:56:19,161 INFO ]: Start minimizeSevpa. Operand 64 states. [2018-06-26 17:56:19,162 INFO ]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-06-26 17:56:19,162 INFO ]: Start removeUnreachable. Operand 44 states. [2018-06-26 17:56:19,162 INFO ]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-06-26 17:56:19,163 INFO ]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-06-26 17:56:19,163 INFO ]: Finished accepts. word is rejected. [2018-06-26 17:56:19,163 INFO ]: Abstraction has 44 states and 46 transitions. [2018-06-26 17:56:19,163 INFO ]: Interpolant automaton has 39 states. [2018-06-26 17:56:19,163 INFO ]: Start isEmpty. Operand 44 states and 46 transitions. [2018-06-26 17:56:19,163 INFO ]: Finished isEmpty. Found accepting run of length 43 [2018-06-26 17:56:19,163 INFO ]: Found error trace [2018-06-26 17:56:19,163 INFO ]: trace histogram [19, 17, 1, 1, 1, 1, 1, 1] [2018-06-26 17:56:19,163 INFO ]: === Iteration 54 === [Ultimate.STARTErr0AssertViolationASSERT]=== [2018-06-26 17:56:19,163 INFO ]: Analyzing trace with hash 2014511289, now seen corresponding path program 51 times [2018-06-26 17:56:19,163 INFO ]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-06-26 17:56:19,163 INFO ]: Using refinement strategy CamelRefinementStrategy [2018-06-26 17:56:19,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:19,164 INFO ]: Changing assertion order to NOT_INCREMENTALLY [2018-06-26 17:56:19,164 INFO ]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-06-26 17:56:19,171 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:19,611 INFO ]: Checked inductivity of 343 backedges. 153 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-06-26 17:56:19,611 INFO ]: The current sequences of interpolants are not accepted, trying to find more. [2018-06-26 17:56:19,611 INFO ]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:19,616 INFO ]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-06-26 17:56:19,688 INFO ]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-06-26 17:56:19,688 INFO ]: Conjunction of SSA is unsat [2018-06-26 17:56:19,692 INFO ]: Computing forward predicates... Received shutdown request... [2018-06-26 17:56:19,853 INFO ]: Timeout while computing interpolants [2018-06-26 17:56:20,054 WARN ]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-06-26 17:56:20,054 WARN ]: Verification canceled [2018-06-26 17:56:20,056 INFO ]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-06-26 17:56:20,057 WARN ]: Timeout [2018-06-26 17:56:20,057 INFO ]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.06 05:56:20 BasicIcfg [2018-06-26 17:56:20,057 INFO ]: ------------------------ END TraceAbstraction---------------------------- [2018-06-26 17:56:20,058 INFO ]: Toolchain (without parser) took 58014.27 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 719.3 MB). Free memory was 259.3 MB in the beginning and 969.1 MB in the end (delta: -709.7 MB). Peak memory consumption was 753.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:56:20,058 INFO ]: SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. [2018-06-26 17:56:20,059 INFO ]: ChcToBoogie took 58.72 ms. Allocated memory is still 303.0 MB. Free memory was 259.3 MB in the beginning and 257.4 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:56:20,059 INFO ]: Boogie Preprocessor took 33.44 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 255.4 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:56:20,059 INFO ]: RCFGBuilder took 286.77 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 247.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. [2018-06-26 17:56:20,059 INFO ]: BlockEncodingV2 took 109.98 ms. Allocated memory is still 303.0 MB. Free memory was 247.4 MB in the beginning and 244.4 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:56:20,060 INFO ]: TraceAbstraction took 57515.55 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 719.3 MB). Free memory was 244.4 MB in the beginning and 969.1 MB in the end (delta: -724.7 MB). Peak memory consumption was 738.1 MB. Max. memory is 3.6 GB. [2018-06-26 17:56:20,062 INFO ]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 13 locations, 14 edges - StatisticsResult: Encoded RCFG 7 locations, 8 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * SmtParser took 0.07 ms. Allocated memory is still 303.0 MB. Free memory is still 268.5 MB. There was no memory consumed. Max. memory is 3.6 GB. * ChcToBoogie took 58.72 ms. Allocated memory is still 303.0 MB. Free memory was 259.3 MB in the beginning and 257.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * Boogie Preprocessor took 33.44 ms. Allocated memory is still 303.0 MB. Free memory was 257.4 MB in the beginning and 255.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 3.6 GB. * RCFGBuilder took 286.77 ms. Allocated memory is still 303.0 MB. Free memory was 255.4 MB in the beginning and 247.4 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 3.6 GB. * BlockEncodingV2 took 109.98 ms. Allocated memory is still 303.0 MB. Free memory was 247.4 MB in the beginning and 244.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 3.6 GB. * TraceAbstraction took 57515.55 ms. Allocated memory was 303.0 MB in the beginning and 1.0 GB in the end (delta: 719.3 MB). Free memory was 244.4 MB in the beginning and 969.1 MB in the end (delta: -724.7 MB). Peak memory consumption was 738.1 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 43 with TraceHistMax 19, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 40 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 7 locations, 1 error locations. TIMEOUT Result, 57.4s OverallTime, 54 OverallIterations, 19 TraceHistogramMax, 19.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 282 SDtfs, 465 SDslu, 3636 SDs, 0 SdLazy, 16204 SolverSat, 2381 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2925 GetRequests, 839 SyntacticMatches, 137 SemanticMatches, 1949 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17158 ImplicationChecksByTransitivity, 40.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 53 MinimizatonAttempts, 207 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 2502 NumberOfCodeBlocks, 2502 NumberOfCodeBlocksAsserted, 247 NumberOfCheckSat, 2397 ConstructedInterpolants, 0 QuantifiedInterpolants, 343318 SizeOfPredicates, 278 NumberOfNonLiveVariables, 17264 ConjunctsInSsa, 3967 ConjunctsInUnsatCore, 105 InterpolantComputations, 2 PerfectInterpolantSequences, 3893/12004 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/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-0-2018-06-26_17-56-20-073.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-GraphSizeCsvProvider-1-2018-06-26_17-56-20-073.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-Benchmark-0-2018-06-26_17-56-20-073.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/upcount_merged_safe.c-1.smt2_AutomizerCHC_Goto.epf_AutomizerCHC_wBE.xml/Csv-TraceAbstractionBenchmarks-0-2018-06-26_17-56-20-073.csv Completed graceful shutdown